Handbook of Markov Chain Monte Carlo

From MaRDI portal
Publication:3566744

DOI10.1201/B10905zbMATH Open1218.65001arXiv1206.1901OpenAlexW621546036MaRDI QIDQ3566744FDOQ3566744


Authors:


Publication date: 9 June 2010

Abstract: Hamiltonian dynamics can be used to produce distant proposals for the Metropolis algorithm, thereby avoiding the slow exploration of the state space that results from the diffusive behaviour of simple random-walk proposals. Though originating in physics, Hamiltonian dynamics can be applied to most problems with continuous state spaces by simply introducing fictitious "momentum" variables. A key to its usefulness is that Hamiltonian dynamics preserves volume, and its trajectories can thus be used to define complex mappings without the need to account for a hard-to-compute Jacobian factor - a property that can be exactly maintained even when the dynamics is approximated by discretizing time. In this review, I discuss theoretical and practical aspects of Hamiltonian Monte Carlo, and present some of its variations, including using windows of states for deciding on acceptance or rejection, computing trajectories using fast approximations, tempering during the course of a trajectory to handle isolated modes, and short-cut methods that prevent useless trajectories from taking much computation time.


Full work available at URL: https://arxiv.org/abs/1206.1901







Cited In (only showing first 100 items - show all)





This page was built for publication: Handbook of Markov Chain Monte Carlo

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3566744)