hamiltonian monte carlo (hmc)
**Hamiltonian Monte Carlo (HMC)** is an advanced MCMC algorithm that exploits Hamiltonian dynamics from classical mechanics to generate distant, low-correlation proposals for efficient exploration of continuous probability distributions. By augmenting the parameter space with auxiliary "momentum" variables and simulating the resulting Hamiltonian system, HMC proposes large moves through parameter space that follow the geometry of the target distribution, dramatically reducing the random-walk behavior that plagues simpler MCMC methods.
**Why HMC Matters in AI/ML:**
HMC provides **orders-of-magnitude more efficient sampling** than random-walk Metropolis-Hastings for continuous distributions, making it the method of choice for Bayesian inference in high-dimensional parameter spaces where naive MCMC is impractically slow.
• **Hamiltonian dynamics** — HMC treats the negative log-posterior as a "potential energy" U(θ) = -log p(θ|D) and introduces momentum variables p with "kinetic energy" K(p) = p²/2M; the total Hamiltonian H(θ,p) = U(θ) + K(p) defines trajectories that explore the distribution efficiently
• **Leapfrog integration** — Hamilton's equations are numerically integrated using the symplectic leapfrog integrator with step size ε for L steps: p ← p - (ε/2)∇U(θ), θ ← θ + εM⁻¹p, p ← p - (ε/2)∇U(θ); symplecticity preserves phase-space volume, ensuring high acceptance rates
• **Gradient-informed proposals** — Unlike random-walk MH, HMC uses gradient information (∇U(θ) = -∇log p(θ|D)) to guide proposals along the posterior's contours, enabling large steps that remain in high-probability regions
• **Suppressed random walk** — The coherent trajectory through parameter space suppresses the diffusive random-walk behavior of MH; while MH explores at rate √N in N steps, HMC explores at rate N, providing quadratically better mixing
• **Tuning challenges** — HMC requires careful tuning of step size ε (too large → rejection, too small → slow exploration) and trajectory length L (too short → random walk, too long → U-turns waste computation); NUTS automates this tuning
| Parameter | Role | Typical Range | Effect of Mistuning |
|-----------|------|---------------|-------------------|
| Step Size (ε) | Leapfrog integration step | 0.01-0.5 | Too large: rejections; too small: slow |
| Trajectory Length (L) | Number of leapfrog steps | 10-1000 | Too short: random walk; too long: U-turns |
| Mass Matrix (M) | Preconditioning | Diagonal or dense | Mismatched: poor exploration |
| Acceptance Target | MH correction threshold | 65-80% | Too low: wasted computation |
| Warm-up | Adaptation period | 500-2000 iterations | Insufficient: poor tuning |
**Hamiltonian Monte Carlo transforms Bayesian sampling from a random-walk exploration into a physics-inspired directed traversal of the posterior landscape, using gradient information and Hamiltonian dynamics to generate distant, high-quality proposals that explore complex, high-dimensional distributions orders of magnitude more efficiently than traditional MCMC methods.**