Couplings for Multinomial Hamiltonian Monte Carlo
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). First posted on arXiv 11 Apr 2021.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 1; 2023: 0; 2024: 1; 2025: 1.
5 papers.
- 2024GIST: Gibbs self-tuning for locally adaptive Hamiltonian Monte Carlocited by 9
- 2022Many processors, little time: MCMC for partitions via optimal transport couplingscited by 6
- 2021Entropy-based adaptive Hamiltonian Monte Carlocited by 5
- 2021Bounding Wasserstein distance with couplingscited by 5
- 2025The Within-Orbit Adaptive Leapfrog No-U-Turn Samplercited by 2
- 2025The Within-Orbit Adaptive Leapfrog No-U-Turn Sampler23 Jun 2025
- 2024GIST: Gibbs self-tuning for locally adaptive Hamiltonian Monte Carlo23 Apr 2024
- 2022Many processors, little time: MCMC for partitions via optimal transport couplings23 Feb 2022
- 2021Bounding Wasserstein distance with couplings6 Dec 2021
- 2021Entropy-based adaptive Hamiltonian Monte Carlo27 Oct 2021