Hamiltonian Monte Carlo (HMC) is a popular sampling method in Bayesian inference. Recently, Heng & Jacob (2019) studied Metropolis HMC with couplings for unbiased Monte Carlo estimation, establishing a generic parallelizable scheme for HMC. However, in practice a different HMC method, multinomial HMC, is considered as the go-to method, e.g. as part of the no-U-turn sampler. In multinomial HMC, proposed states are not limited to end-points as in Metropolis HMC; instead points along the entire trajectory can be proposed. In this paper, we establish couplings for multinomial HMC, based on optimal transport for multinomial sampling in its transition. We prove an upper bound for the meeting time - the time it takes for the coupled chains to meet - based on the notion of local contractivity. We evaluate our methods using three targets: 1,000 dimensional Gaussians, logistic regression and log-Gaussian Cox point processes. Compared to Heng & Jacob (2019), coupled multinomial HMC generally attains a smaller meeting time, and is more robust to choices of step sizes and trajectory lengths, which allows re-use of existing adaptation methods for HMC. These improvements together paves the way for a wider and more practical use of coupled HMC methods.
翻译:汉密尔顿·蒙特卡洛(HMC)是巴伊西亚州测谎中流行的采样方法。最近,亨加雅各布(2019年)研究大都市HMC,同时研究无偏见的蒙特卡洛估算,为HMC建立一个通用的平行计划。然而,在实践中,不同的HMC方法,即多名HMC,被认为是“向上”方法,例如作为无Uturn取样器的一部分。在多名HMC中,提议的国家不限于大都市HMC的终点;相反,可以提出整个轨迹的各个点。在本文件中,我们根据过渡期间多名抽样的最佳运输方法,为多名HMC建立了多名HMC的结合。我们证明,在会议时间上,即多名HMC的多名制式方法----即作为无Uturt取样器的一部分,被认为是“向上进”的方法。我们用三种目标评估了我们的方法:1,000个维计、物流回归和log-Gaussian Cox点进程。与Hng & Jaco(2019年)相比,我们为多名的多名HMC的跨式选择是更牢固的一步,通常的HMC方法,使HMC的走向更接近于更牢固的走向更小的走向。