Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
157 tokens/sec
GPT-4o
43 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Optimal Convergence Rate of Hamiltonian Monte Carlo for Strongly Logconcave Distributions (1905.02313v1)

Published 7 May 2019 in cs.DS, cs.LG, and stat.ML

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.

Citations (64)

Summary

We haven't generated a summary for this paper yet.

X Twitter Logo Streamline Icon: https://streamlinehq.com