Hamiltonian Monte Carlo (HMC) has emerged as a powerful Markov Chain Monte Carlo (MCMC) method to sample from complex continuous distributions. However, a fundamental limitation of HMC is that it can not be applied to distributions with mixed discrete and continuous variables. In this paper, we propose mixed HMC (M-HMC) as a general framework to address this limitation. M-HMC is a novel family of MCMC algorithms that evolves the discrete and continuous variables in tandem, allowing more frequent updates of discrete variables while maintaining HMC's ability to suppress random-walk behavior. We establish M-HMC's theoretical properties, and present an efficient implementation with Laplace momentum that introduces minimal overhead compared to existing HMC methods. The superior performances of M-HMC over existing methods are demonstrated with numerical experiments on Gaussian mixture models (GMMs), variable selection in Bayesian logistic regression (BLR), and correlated topic models (CTMs).
翻译:汉密尔顿·蒙特卡洛(HMC)是一个强大的Markov链条蒙特卡洛(MCMC)方法,从复杂的连续分布中提取样本,但HMC的一个根本限制是,它不能适用于混合离散和连续变量的分布;在本文件中,我们建议混合HMC(M-HMC)作为解决这一限制的一般框架;M-HMC是MMC算法的新式组合,它同步演变离散和连续变量,允许更经常地更新离散变量,同时保持HMC抑制随机行走行为的能力。我们建立了M-HMC的理论特性,并展示了与现有的HMC方法相比引入最低管理费的Laplace动力的高效实施。M-HMC优于现有方法的表现表现表现在高斯混合模型(GOMS)的数字实验、巴伊西亚物流回归(BLR)的变量选择和相关的专题模型(CTMS)中。