Optimal Convergence Rate of Hamiltonian Monte Carlo for Strongly Logconcave Distributions

05/07/2019
∙
by   Zongchen Chen, et al.
∙
0
∙

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

READ FULL TEXT

Please sign up or login with your details

Continue with:
Or login with email
Enter Password
Re-enter Password

Forgot password? Click here to reset
Success!
Error Icon An error occurred

Sign in with Google

×

Use your Google Account to sign in to DeepAI

×
Pro

Consider DeepAI Pro

Subscribe to DeepAI Pro
DeepAI Pro
Provides a limited generation allowance each month. When exceeded, you are charged overage rates available at deepai.org/pricing. Also includes an ad-free experience and API access. Renews automatically until canceled. Non-refundable.
Subtotal
Total due today

Payment

Add DeepAI credits
DeepAI credits
One-time purchase. Credits are added to your wallet after payment.
Subtotal
Total due today

Payment