An Introduction to Hamiltonian Monte Carlo Method for Sampling
Abstract
The goal of this article is to introduce the Hamiltonian Monte Carlo (HMC) method -- a Hamiltonian dynamics-inspired algorithm for sampling from a Gibbs density π(x) e-f(x). We focus on the "idealized" case, where one can compute continuous trajectories exactly. We show that idealized HMC preserves π and we establish its convergence when f is strongly convex and smooth.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.