Rapid Mixing of Hamiltonian Monte Carlo on Strongly Log-Concave Distributions
Not on the map. Why?
Abstract (arXiv)
We obtain several quantitative bounds on the mixing properties of the Hamiltonian Monte Carlo (HMC) algorithm for a strongly log-concave target distribution π on ℝd, showing that HMC mixes quickly in this setting. One of our main results is a dimension-free bound on the mixing of an "ideal" HMC chain, which is used to show that the usual leapfrog implementation of HMC can sample from π using only O(d^frac14) gradient evaluations. This dependence on dimension is sharp, and our results significantly extend and improve previous quantitative bounds on the mixing of HMC.
Key facts. Cited by 12 papers in the map (data through 7 Oct 2026). First posted on arXiv 23 Aug 2017.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 6; 2022: 2; 2023: 1; 2024: 3.
12 papers.
- 2021Mixing Time Guarantees for Unadjusted Hamiltonian Monte Carlocited by 18
- 2021When is the Convergence Time of Langevin Algorithms Dimension Independent? A Composite Optimization Viewpointcited by 12
- 2023When does Metropolized Hamiltonian Monte Carlo provably outperform Metropolis-adjusted Langevin algorithm?cited by 12
- 2021Asymptotic bias of inexact Markov Chain Monte Carlo methods in high dimensioncited by 11
- 2024Accelerating Approximate Thompson Sampling with Underdamped Langevin Monte Carlocited by 10
- 2021An Introduction to Hamiltonian Monte Carlo Method for Samplingcited by 8
- 2022Transport Score Climbing: Variational Inference Using Forward KL and Adaptive Neural Transportcited by 8
- 2021Entropy-based adaptive Hamiltonian Monte Carlocited by 5
- 2024Faster Sampling via Stochastic Gradient Proximal Samplercited by 5
- 2024Ensemble-Based Annealed Importance Samplingcited by 4
- 2022Hamiltonian Adaptive Importance Samplingcited by 2
- 2021Hamiltonian Monte Carlo with Asymmetrical Momentum Distributionscited by 1
- 2024Faster Sampling via Stochastic Gradient Proximal Sampler27 May 2024
- 2024Ensemble-Based Annealed Importance Sampling28 Jan 2024
- 2024Accelerating Approximate Thompson Sampling with Underdamped Langevin Monte Carlo22 Jan 2024
- 2023When does Metropolized Hamiltonian Monte Carlo provably outperform Metropolis-adjusted Langevin algorithm?10 Apr 2023
- 2022Hamiltonian Adaptive Importance Sampling27 Sep 2022
- 2022Transport Score Climbing: Variational Inference Using Forward KL and Adaptive Neural Transport3 Feb 2022
- 2021Entropy-based adaptive Hamiltonian Monte Carlo27 Oct 2021
- 2021Hamiltonian Monte Carlo with Asymmetrical Momentum Distributions21 Oct 2021
- 2021When is the Convergence Time of Langevin Algorithms Dimension Independent? A Composite Optimization Viewpoint5 Oct 2021
- 2021An Introduction to Hamiltonian Monte Carlo Method for Sampling27 Aug 2021
- 2021Asymptotic bias of inexact Markov Chain Monte Carlo methods in high dimension2 Aug 2021
- 2021Mixing Time Guarantees for Unadjusted Hamiltonian Monte Carlo3 May 2021