# An Efficient Scheme for Sampling in Constrained Domains

@inproceedings{Chaudhry2021AnES, title={An Efficient Scheme for Sampling in Constrained Domains}, author={Sharang Chaudhry and Daniel Lautzenheiser and Kaushik Ghosh}, year={2021} }

The creation of optimal samplers can be a challenging task, especially in the presence of constraints on the support of parameters. One way of mitigating the severity of this challenge is to work with transformed variables, where the support is more conducive to sampling. In this work, a particular transformation called inversion in a sphere is embedded within the popular Metropolis-Hastings paradigm to effectively sample in such scenarios. The method is illustrated on three domains: the…

## Figures from this paper

## References

SHOWING 1-10 OF 21 REFERENCES

Efficient sampling on the simplex with a self-adjusting logit transform proposal

- Mathematics
- 2017

ABSTRACT A vector of k positive coordinates lies in the k-dimensional simplex when the sum of all coordinates in the vector is constrained to equal 1. Sampling distributions efficiently on the…

Spherical Hamiltonian Monte Carlo for Constrained Target Distributions

- Mathematics, Computer ScienceICML
- 2014

A novel Markov Chain Monte Carlo (MCMC) method is proposed that provides a general and computationally efficient framework for handling boundary conditions inStatistical models with constrained probability distributions including truncated Gaussian, Bayesian Lasso, Bayes bridge regression, and a copula model for identifying synchrony among multiple neurons.

Cruising The Simplex: Hamiltonian Monte Carlo and the Dirichlet Distribution

- Physics, Mathematics
- 2012

Due to its constrained support, the Dirichlet distribution is uniquely suited to many applications. The constraints that make it powerful, however, can also hinder practical implementations,…

Sampling from manifold-restricted distributions using tangent bundle projections

- Computer Science, MathematicsStat. Comput.
- 2020

A derivative-based importance sampling framework for target probability distributions that is designed for the efficient production of approximate high-resolution histograms from manifold-restricted Gaussian distributions and can provide large computational savings when sampling directly from the target distribution is expensive.

Sampling from a multivariate Gaussian distribution truncated on a simplex: A review

- Mathematics, Computer Science2014 IEEE Workshop on Statistical Signal Processing (SSP)
- 2014

This paper reviews recent Monte Carlo methods for sampling from multivariate Gaussian distributions restricted to the standard simplex and describes and analyzes two Hamiltonian Monte Carlo Methods.

The Skew-Normal and Related Families

- Computer Science
- 2018

This comprehensive treatment, blending theory and practice, will be the standard resource for statisticians and applied researchers, and Assuming only basic knowledge of (non-measure-theoretic) probability and statistical inference, the book is accessible to the wide range of researchers who use statistical modelling techniques.

A Gibbs sampler on the $n$-simplex

- Mathematics
- 2011

We determine the mixing time of a simple Gibbs sampler on the unit simplex, confirming a conjecture of Aldous. The upper bound is based on a two-step coupling, where the first step is a simple…

Bayesian separation of spectral sources under non-negativity and full additivity constraints

- Mathematics, Computer ScienceSignal Process.
- 2009

A new hierarchical Bayesian model appropriate to the non-negativity and sum-to-one constraints associated to the sources and the mixing coefficients of linear mixtures and is applied to the processing of multicomponent chemical mixtures resulting from Raman spectroscopy.

An Introduction to Markov Chain Monte Carlo

- Computer Science
- 2010

The Bayesian approach to statistics is introduced, and the necessary continuous state space Markov chain theory is summarized, and two common algorithms for generating random draws from complex joint distribution are presented.

Quantitative Comparison of Reconstruction Methods for Intra-Voxel Fiber Recovery From Diffusion MRI

- Computer Science, MedicineIEEE Transactions on Medical Imaging
- 2014

Evaluated methods encompass a mixture of classical techniques well known in the literature such as diffusion tensor, Q-Ball and diffusion spectrum imaging, algorithms inspired by the recent theory of compressed sensing and also brand new approaches proposed for the first time at this contest.