mlsanityData to 7 Oct 2026

Rapid Mixing of Hamiltonian Monte Carlo on Strongly Log-Concave Distributions

arXiv 1708.07114 ↗First posted 23 Aug 2017math.PR stat.CO stat.MEcited by 12

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

Cited by year

Citing papers per year: 2021: 6; 2022: 2; 2023: 1; 2024: 3.

12 papers.