Sampling large hyperplane-truncated multivariate normal distributions

نویسندگان

چکیده

Generating multivariate normal distributions is widely used in various fields, including engineering, statistics, finance and machine learning. In this paper, simulating large truncated on the intersection of a set hyperplanes investigated. Specifically, proposed methodology focuses cases where prior extracted from stationary Gaussian process (GP). It based combining both Karhunen-Loève expansions (KLE) Matheron’s update rules (MUR). The KLE requires computation decomposition covariance matrix random variables, which can become expensive when vector too large. To address issue, input domain split smallest subdomains eigendecomposition be computed. Due to property, only first subdomain required. Through strategy, computational complexity drastically reduced. mean-square truncation block errors have been calculated. efficiency approach has demonstrated through synthetic real data studies.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficient Sampling Methods for Truncated Multivariate Normal and Student-t Distributions Subject to Linear Inequality Constraints

Sampling from a truncated multivariate normal distribution subject to multiple linear inequality constraints is a recurring problem in many areas in statistics and econometrics, such as the order restricted regressions, censored data models, and shape-restricted nonparametric regressions. However, the sampling problem still appears non-trivial due to the existence of the analytically intractabl...

متن کامل

Optimal direction Gibbs sampler for truncated multivariate normal distributions

Generalized Gibbs samplers simulate from any direction, not necessarily limited to the coordinate directions of the parameters of the objective function. We study how to optimally choose such directions in a random scan Gibbs sampler setting. We consider that optimal directions will be those that minimize the Kullback-Leibler divergence of two Markov chain Monte Carlo steps. Two distributions o...

متن کامل

Clustering Multivariate Normal Distributions

In this paper, we consider the task of clustering multivariate normal distributions with respect to the relative entropy into a prescribed number, k, of clusters using a generalization of Lloyd’s k-means algorithm [1]. We revisit this information-theoretic clustering problem under the auspices of mixed-type Bregman divergences, and show that the approach of Davis and Dhillon [2] (NIPS*06) can a...

متن کامل

Large-Sample Asymptotic Approximations for the Sampling and Posterior Distributions of Differential Entropy for Multivariate Normal Distributions

In the present paper, we propose a large sample asymptotic approximation for the sampling and posterior distributions of differential entropy when the sample is composed of independent and identically distributed realization of a multivariate normal distribution.

متن کامل

On Sampling from Multivariate Distributions

Let X1, X2, . . . , Xn be a set of random variables. Suppose that in addition to the prior distributions of these random variables we are also given linear constraints relating them. We ask for necessary and sufficient conditions under which we can efficiently sample the constrained distributions, find constrained marginal distributions for each of the random variables, etc. We give a tight cha...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computational Statistics

سال: 2023

ISSN: ['0943-4062', '1613-9658']

DOI: https://doi.org/10.1007/s00180-023-01416-7