An Introduction to Hamiltonian Monte Carlo Method for Sampling
Data Structures and Algorithms
2021-08-30 v1 Machine Learning
Probability
Computation
Machine Learning
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 . 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 is strongly convex and smooth.
Keywords
Cite
@article{arxiv.2108.12107,
title = {An Introduction to Hamiltonian Monte Carlo Method for Sampling},
author = {Nisheeth K. Vishnoi},
journal= {arXiv preprint arXiv:2108.12107},
year = {2021}
}
Comments
This exposition is to supplement the talk by the author at the Bootcamp in the semester on Geometric Methods for Optimization and Sampling at the Simons Institute for the Theory of Computing