Randomized Hamiltonian Monte Carlo

79Citations
Citations of this article
29Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Tuning the durations of the Hamiltonian flow in Hamiltonian Monte Carlo (also called Hybrid Monte Carlo) (HMC) involves a tradeoff between computational cost and sampling quality, which is typically challenging to resolve in a satisfactory way. In this article, we present and analyze a randomized HMC method (RHMC), in which these durations are i.i.d. exponential random variables whose mean is a free parameter. We focus on the small time step size limit, where the algorithm is rejection-free and the computational cost is proportional to the mean duration. In this limit, we prove that RHMC is geometrically ergodic under the same conditions that imply geometric ergodicity of the solution to underdamped Langevin equations.Moreover, in the context of a multidimensional Gaussian distribution, we prove that the sampling efficiency of RHMC, unlike that of constant duration HMC, behaves in a regular way. This regularity is also verified numerically in non-Gaussian target distributions. Finally, we suggest variants of RHMC for which the time step size is not required to be small.

Cite

CITATION STYLE

APA

Bou-Rabee, N., & Sanz-Serna, J. M. (2017). Randomized Hamiltonian Monte Carlo. Annals of Applied Probability, 27(4), 2159–2194. https://doi.org/10.1214/16-AAP1255

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free