SearcharxivSearch

arXiv · 1911.03017

Normal variance mixtures: Distribution, density and parameter estimation

Abstract

Normal variance mixtures are a class of multivariate distributions that generalize the multivariate normal by randomizing (or mixing) the covariance matrix via multiplication by a non-negative random variable W. The multivariate t distribution is an example of such mixture, where W has an inverse-gamma distribution. Algorithms to compute the joint distribution function and perform parameter estimation for the multivariate normal and t (with integer degrees of freedom) can be found in the literature and are implemented in, e.g., the R package mvtnorm. In this paper, efficient algorithms to perform these tasks in the general case of a normal variance mixture are proposed. In addition to the above two tasks, the evaluation of the joint (logarithmic) density function of a general normal variance mixture is tackled as well, as it is needed for parameter estimation and does not always exist in closed form in this more general setup. For the evaluation of the joint distribution function, the proposed algorithms apply randomized quasi-Monte Carlo (RQMC) methods in a way that improves upon existing methods proposed for the multivariate normal and t distributions. An adaptive RQMC algorithm that similarly exploits the superior convergence properties of RQMC methods is presented for the task of evaluating the joint log-density function. This allows the parameter estimation task to be accomplished via an EM-like algorithm where all weights and log-densities are numerically estimated. It is demonstrated through numerical examples that the suggested algorithms are quite fast; even for high dimensions around 1000 the distribution function can be estimated with moderate accuracy using only a few seconds of run time. Even log-densities around -100 can be estimated accurately and quickly. An implementation of all algorithms presented in this work is available in the R package nvmix (version >= 0.0.4).

Explore related subjects

Keep this discovery

BibTeXRIS

Erik Hintz, Marius Hofert, Christiane Lemieux. 2019-11-08. Normal variance mixtures: Distribution, density and parameter estimation. https://arxiv.org/abs/1911.03017

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Estimating Hierarchically Rank Structured Covariance Matrices

We consider the problem of estimating a high-dimensional covariance matrix from a very limited number of samples. This problem is ubiquitous in computational fluid dynamics, where a small number of fluid snapshots must be used to construct a Gramian matrix determining a reduced-order model, as well as in computational geoscience, where a small ensemble of Earth system forecasts must be used to estimate the covariance matrix associated with the forecast uncertainty. It is common practice to regularize the small-sample covariance by imposing a "localization" structure that enforces a physically realistic correlation length scale, imposing a sparsity constraint, "shrinking" towards a prescribed target, or attenuating small correlations. We propose an alternate technique that regularizes the small-sample covariance by imposing hierarchical rank structure. Compared to regularization methods that assume sparsity such as spatial localization, hierarchical rank structure accommodates a wider range of covariance matrices, roughly corresponding to situations where long-range correlations vary more smoothly than short-range ones. It also results in a data-sparse matrix format that permits highly efficient matrix-vector products. We present theory and algorithms which show how to efficiently estimate a high-dimensional, hierarchically rank structured covariance matrix from limited samples. Through an error analysis and numerical experiments with a variety of model problems, we demonstrate that these techniques are effective at reducing sampling errors, and that in many cases they achieve smaller estimation error than conventional techniques.

stat.CO

Optimal Slice-Adaptive Tuning of Hybrid Slice Sampling

Slice sampling is a Markov chain Monte Carlo algorithm that draws its next state uniformly from a "slice"---a super-level set of the target density function---at each iteration, thereby providing automatic local adaptivity to the scale of the target. In practice the exact slice is not known, so general-purpose implementations use an approximate slice that is grown from a starting interval of length $w>0$, with a computational cost that depends on $w$. This work presents an analysis of the average per-iteration number of target density evaluations, as a function of $w$, of hybrid slice sampling with various slice-finding schemes for targets with contiguous slices. The paper uses the results of the analysis to develop automated, slice-adaptive tuning schemes along with suboptimality bounds and asymptotic convergence guarantees. Simulations demonstrate that the tuning schemes reliably yield near-optimal slice-adaptive tuning with essentially no dependence on the initial setting of $w$.

stat.CO