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 where is -strongly convex and -smooth (the condition number is ). We show that the relaxation time (inverse of the spectral gap) of ideal HMC is , improving on the previous best bound of ; 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 gradient evaluations per step and total time.
Paper Prompts
Sign up for free to create and run prompts on this paper.