Sampling constrained probability distributions using spherical augmentation
From MaRDI portal
Abstract: Statistical models with constrained probability distributions are abundant in machine learning. Some examples include regression models with norm constraints (e.g., Lasso), probit, many copula models, and latent Dirichlet allocation (LDA). Bayesian inference involving probability distributions confined to constrained domains could be quite challenging for commonly used sampling algorithms. In this paper, we propose a novel augmentation technique that handles a wide range of constraints by mapping the constrained domain to a sphere in the augmented space. By moving freely on the surface of this sphere, sampling algorithms handle constraints implicitly and generate proposals that remain within boundaries when mapped back to the original space. Our proposed method, called {Spherical Augmentation}, provides a mathematically natural and computationally efficient framework for sampling from constrained probability distributions. We show the advantages of our method over state-of-the-art sampling algorithms, such as exact Hamiltonian Monte Carlo, using several examples including truncated Gaussian distributions, Bayesian Lasso, Bayesian bridge regression, reconstruction of quantized stationary Gaussian process, and LDA for topic modeling.
Recommendations
Cites work
- 10.1162/jmlr.2003.3.4-5.993
- A sequential particle filter method for static models
- A Statistical View of Some Chemometrics Regression Tools
- A vanilla Rao-Blackwellization of Metropolis-Hastings algorithms
- Adaptive Markov Chain Monte Carlo through Regeneration
- Bayesian lasso regression
- Bayesian learning for neural networks
- Efficient Markov chain Monte Carlo methods for decoding neural spike trains
- Geodesic Monte Carlo on embedded manifolds
- scientific article; zbMATH DE number 1085989 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- scientific article; zbMATH DE number 3227205 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- Hybrid Monte Carlo on Hilbert spaces
- Learn from thy neighbor: parallel-chain and regional adaptive MCMC
- MCMC METHODS FOR DIFFUSION BRIDGES
- MCMC methods for functions: modifying old algorithms to make them faster
- Minimum variance importance samplingviaPopulation Monte Carlo
- On scale mixtures of normal distributions
- On the ergodicity properties of some adaptive MCMC algorithms
- Optimal scaling and diffusion limits for the Langevin algorithm in high dimensions
- Optimal scaling for random walk Metropolis on spherically constrained target densities
- Optimal scaling for various Metropolis-Hastings algorithms.
- Optimal scaling of random walk Metropolis algorithms with discontinuous target densities
- Optimal scaling of the random walk Metropolis on elliptically symmetric unimodal targets
- Practical Markov Chain Monte Carlo
- Regeneration in Markov Chain Samplers
- Simulating Hamiltonian Dynamics
- Slice sampling. (With discussions and rejoinder)
- Split Hamiltonian Monte Carlo
- The Bayesian Lasso
- The no-U-turn sampler: adaptively setting path lengths in Hamiltonian Monte Carlo
- Weak convergence and optimal scaling of random walk Metropolis algorithms
Cited in
(5)- Scalable Bayes via barycenter in Wasserstein space
- Finite-Dimensional Gaussian Approximation with Linear Inequality Constraints
- Geodesic Lagrangian Monte Carlo over the space of positive definite matrices: with application to Bayesian spectral density estimation
- Approximating Gaussian Process Emulators with Linear Inequality Constraints and Noisy Observations via MC and MCMC
- Sampling constrained continuous probability distributions: a review
This page was built for publication: Sampling constrained probability distributions using spherical augmentation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2954274)
