An Introduction to Hamiltonian Monte Carlo Method for Sampling

08/27/2021
by   Nisheeth K. Vishnoi, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/20/2022

Metropolis Augmented Hamiltonian Monte Carlo

Hamiltonian Monte Carlo (HMC) is a powerful Markov Chain Monte Carlo (MC...
research
05/07/2019

Optimal Convergence Rate of Hamiltonian Monte Carlo for Strongly Logconcave Distributions

We study Hamiltonian Monte Carlo (HMC) for sampling from a strongly logc...
research
06/09/2022

Randomized Time Riemannian Manifold Hamiltonian Monte Carlo

Hamiltonian Monte Carlo (HMC) algorithms which combine numerical approxi...
research
09/26/2022

Hamiltonian Monte Carlo for efficient Gaussian sampling: long and random steps

Hamiltonian Monte Carlo (HMC) is a Markov chain algorithm for sampling f...
research
10/21/2022

Barrier Hamiltonian Monte Carlo

In this paper, we propose Barrier Hamiltonian Monte Carlo (BHMC), a vers...
research
05/23/2019

A Condition Number for Hamiltonian Monte Carlo

Hamiltonian Monte Carlo is a popular sampling technique for smooth targe...
research
11/29/2022

Penalized Langevin and Hamiltonian Monte Carlo Algorithms for Constrained Sampling

We consider the constrained sampling problem where the goal is to sample...

Please sign up or login with your details

Forgot password? Click here to reset