TY - GEN
T1 - Spherical Hamiltonian Monte Carlo for constrained target distributions
AU - Lan, Shiwei
AU - Zhou, Bo
AU - Shahbaba, Babak
N1 - Publisher Copyright:
Copyright © (2014) by the International Machine Learning Society (IMLS) All rights reserved.
PY - 2014
Y1 - 2014
N2 - Statistical models with constrained probability distributions are abundant in machine learning. Some examples include regression models with norm constraints (e.g., Lasso), probit models, many copula models, and Latent Dirichlet Allocation (LDA) models. Bayesian inference involving probability distributions confined to constrained domains could be quite challenging for commonly used sampling algorithms. For such problems, we propose a novel Markov Chain Monte Carlo (MCMC) method that provides a general and computationally efficient framework for handling boundary conditions. Our method first maps the -D-dimensional constrained domain of parameters to the unit ball BD0(1), then augments it to a D-dimensional sphere SD such that the original boundary corresponds to the equator of SD. This way, our method handles the constraints implicitly by moving freely on the sphere generating proposals that remain within boundaries when mapped back to the original space.
AB - Statistical models with constrained probability distributions are abundant in machine learning. Some examples include regression models with norm constraints (e.g., Lasso), probit models, many copula models, and Latent Dirichlet Allocation (LDA) models. Bayesian inference involving probability distributions confined to constrained domains could be quite challenging for commonly used sampling algorithms. For such problems, we propose a novel Markov Chain Monte Carlo (MCMC) method that provides a general and computationally efficient framework for handling boundary conditions. Our method first maps the -D-dimensional constrained domain of parameters to the unit ball BD0(1), then augments it to a D-dimensional sphere SD such that the original boundary corresponds to the equator of SD. This way, our method handles the constraints implicitly by moving freely on the sphere generating proposals that remain within boundaries when mapped back to the original space.
UR - http://www.scopus.com/inward/record.url?scp=84919883805&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84919883805&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:84919883805
T3 - 31st International Conference on Machine Learning, ICML 2014
SP - 960
EP - 968
BT - 31st International Conference on Machine Learning, ICML 2014
PB - International Machine Learning Society (IMLS)
T2 - 31st International Conference on Machine Learning, ICML 2014
Y2 - 21 June 2014 through 26 June 2014
ER -