Papers
Topics
Authors
Recent
Search
2000 character limit reached

Optimal Convergence Rate of Hamiltonian Monte Carlo for Strongly Logconcave Distributions

Published 7 May 2019 in cs.DS, cs.LG, and stat.ML | (1905.02313v1)

Abstract: We study Hamiltonian Monte Carlo (HMC) for sampling from a strongly logconcave density proportional to e<sup>−fe<sup>{-f} where f:R<sup>d</sup>→Rf:\mathbb{R}<sup>d</sup> \to \mathbb{R} is μ\mu-strongly convex and LL-smooth (the condition number is κ=L/μ\kappa = L/\mu). We show that the relaxation time (inverse of the spectral gap) of ideal HMC is O(κ)O(\kappa), improving on the previous best bound of O(κ<sup>1.5)O(\kappa<sup>{1.5}); we complement this with an example where the relaxation time is Ω(κ)\Omega(\kappa). When implemented using a nearly optimal ODE solver, HMC returns an ε\varepsilon-approximate point in $2$-Wasserstein distance using O~((κd)<sup>0.5</sup>ε<sup>−1)\widetilde{O}((\kappa d)<sup>{0.5}</sup> \varepsilon<sup>{-1}) gradient evaluations per step and O~((κd)<sup>1.5ε<sup>−1)\widetilde{O}((\kappa d)<sup>{1.5}\varepsilon<sup>{-1}) total time.

Citations (64)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Tweets

Sign up for free to view the 1 tweet with 1 like about this paper.