pith. sign in

arxiv: 1905.02313 · v1 · pith:CDBJ6PA6new · submitted 2019-05-07 · 💻 cs.DS · cs.LG· stat.ML

Optimal Convergence Rate of Hamiltonian Monte Carlo for Strongly Logconcave Distributions

classification 💻 cs.DS cs.LGstat.ML
keywords kappastronglytimevarepsiloncarlohamiltonianlogconcavemathbb
0
0 comments X
read the original abstract

We study Hamiltonian Monte Carlo (HMC) for sampling from a strongly logconcave density proportional to $e^{-f}$ where $f:\mathbb{R}^d \to \mathbb{R}$ is $\mu$-strongly convex and $L$-smooth (the condition number is $\kappa = L/\mu$). We show that the relaxation time (inverse of the spectral gap) of ideal HMC is $O(\kappa)$, improving on the previous best bound of $O(\kappa^{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 $\widetilde{O}((\kappa d)^{0.5} \varepsilon^{-1})$ gradient evaluations per step and $\widetilde{O}((\kappa d)^{1.5}\varepsilon^{-1})$ total time.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.