# An Introduction to Hamiltonian Monte Carlo Method for Sampling

Source: [An Introduction to Hamiltonian Monte Carlo Method for Sampling](<https://www.sota2.com/research/paper/68fa58621e209131ce9add4d>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-25T15:18:34.237Z

Authors: Nisheeth K. Vishnoi

Published: 2021-08-27T03:28:20.000Z

## 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 $\\pi(x) \\propto e^{-f(x)}$. We focus on the "idealized" case, where one can compute continuous trajectories exactly. We show that idealized HMC preserves $\\pi$ and we establish its convergence when $f$ is strongly convex and smooth.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/2108.12107>)

[PDF](<https://arxiv.org/pdf/2108.12107.pdf>)
