The DOI matches its Crossref record; 40 of the 40 references it cites were found in a registry or an index.
Handbook of Markov Chain Monte Carlo
Open accessAbstract
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Monte Carlo sampling methods using Markov chains and their applications.
Hastings, W. K. (1970) · Biometrika · doi:10.1093/biomet/57.1.97 · Cited by 15,195
Bayesian Learning for Neural Networks
Neal, R. M. (1996) · Lecture Notes in Statistics · doi:10.1007/978-1-4612-0745-0 · Cited by 4,276
Studies in Molecular Dynamics. I. General Method
Alder, B. J., & Wainwright, T. E. (1959) · The Journal of Chemical Physics · doi:10.1063/1.1730376 · Cited by 2,524
Understanding Molecular Simulation
(2002) · doi:10.1016/b978-0-12-267351-1.x5000-7 · Cited by 2,042
Simulated Tempering: A New Monte Carlo Scheme
Marinari, E., & Parisi, G. (1992) · Europhysics Letters (EPL) · doi:10.1209/0295-5075/19/6/002 · Cited by 1,818
Equation of state calculations by fast computing machines
Metropolis, N., Rosenbluth, A. W., Rosenbluth, M. N., Teller, A. H., & Teller, E. (1953) · doi:10.2172/4390578 · Cited by 1,701
Weak convergence and optimal scaling of random walk Metropolis algorithms
Roberts, G. O., Gelman, A., & Gilks, W. R. (1997) · The Annals of Applied Probability · doi:10.1214/aoap/1034625254 · Cited by 1,693
Self-citationMonte Carlo Sampling Methods Using Markov Chains and Their Applications
Hastings, W. K. (1970) · Biometrika · doi:10.2307/2334940 · Cited by 1,443
Monte Carlo Strategies in Scientific Computing
Hesterberg, T. (2002) · Technometrics · doi:10.1198/tech.2002.s85 · Cited by 1,409
Simulating Hamiltonian Dynamics
Leimkuhler, B., & Reich, S. (2005) · Cambridge University Press eBooks · doi:10.1017/cbo9780511614118 · Cited by 1,130
(1991) · University of Minnesota Digital Conservancy (University of Minnesota) · Cited by 1,077
Probabilistic Inference Using Markov Chain Monte Carlo Methods
Neal, R. M. (2011) · Cited by 1,040
Parallel Tempering: Theory, Applications, and New PerspectivesPreprint
Earl, D. J., & Deem, M. W. (2008) · Cited by 1,037
Exponential Convergence of Langevin Distributions and Their Discrete Approximations
Roberts, G. O., & Tweedie, R. L. (1996) · Bernoulli · doi:10.2307/3318418 · Cited by 998
Mathematical methods of classical mechanics
Rota, G. (1990) · Advances in Mathematics · doi:10.1016/0001-8708(90)90022-f · Cited by 933
Andrieu, C., & Thoms, J. (2008) · Statistics and Computing · doi:10.1007/s11222-008-9110-y · Cited by 903
Optimal Scaling of Discrete Approximations to Langevin Diffusions
Roberts, G. O., & Rosenthal, J. S. (1998) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/1467-9868.00123 · Cited by 632
Representations of Knowledge in Complex Systems
Grenander, U., & Miller, M. I. (1994) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1994.tb02000.x · Cited by 603
Brownian dynamics as smart Monte Carlo simulation
Rossky, P. J., Doll, J. D., & Friedman, H. L. (1978) · The Journal of Chemical Physics · doi:10.1063/1.436415 · Cited by 509
The accuracy of symplectic integrators
McLachlan, R. I., & Atela, P. (1992) · Nonlinearity · doi:10.1088/0951-7715/5/2/011 · Cited by 380
Sampling from multimodal distributions using tempered transitions
Neal, R. M. (1996) · Statistics and Computing · doi:10.1007/bf00143556 · Cited by 343
A generalized guided Monte Carlo algorithm
Horowitz, A. M. (1991) · Physics Letters B · doi:10.1016/0370-2693(91)90812-5 · Cited by 282
An Improved Acceptance Procedure for the Hybrid Monte Carlo Algorithm
Neal, R. M. (1994) · Journal of Computational Physics · doi:10.1006/jcph.1994.1054 · Cited by 178
Higher-order hybrid Monte Carlo algorithms
Creutz, M. J., & Gocksch, A. (1989) · Physical Review Letters · doi:10.1103/physrevlett.63.9 · Cited by 168
Gaussian Processes to Speed up Hybrid Monte Carlo for Expensive Bayesian Integrals
Rasmussen, C. E. (2003) · doi:10.1093/oso/9780198526155.003.0045 · Cited by 167
Global Monte Carlo algorithms for many-fermion systems
Creutz, M. J. (1988) · Physical review. D. Particles, fields, gravitation, and cosmology/Physical review. D. Particles and fields · doi:10.1103/physrevd.38.1228 · Cited by 150
Shadow hybrid Monte Carlo: an efficient propagator in phase space of macromolecules
Izaguirre, J. A., & Hampton, S. S. (2004) · Journal of Computational Physics · doi:10.1016/j.jcp.2004.04.016 · Cited by 134
Mass tensor molecular dynamics
Bennett, C. H. (1975) · Journal of Computational Physics · doi:10.1016/0021-9991(75)90077-7 · Cited by 130
Annealed Importance SamplingPreprint
Neal, R. M. (1998) · arXiv (Cornell University) · doi:10.48550/arxiv.physics/9803008 · Cited by 108
The acceptance probability in the hybrid Monte Carlo method
Sourendu Gupta, A., Irbäc, A., Karsch, F., et al. (1990) · Physics Letters B · doi:10.1016/0370-2693(90)91790-i · Cited by 103
An improved hybrid Monte Carlo method
Mackenze, P. B. (1989) · Physics Letters B · doi:10.1016/0370-2693(89)91212-4 · Cited by 99
Acceptances and autocorrelations in hybrid Monte Carlo
Kennedy, A. D., & Pendleton, B. J. (1991) · Nuclear Physics B - Proceedings Supplements · doi:10.1016/0920-5632(91)90893-j · Cited by 61
Playing Billiards in Version Space
Ruján, P. (1997) · Neural Computation · doi:10.1162/neco.1997.9.1.99 · Cited by 55
Multipoint Metropolis Method with Application to Hybrid Monte Carlo
Qin, Z. S., & Liu, J. S. (2001) · Journal of Computational Physics · doi:10.1006/jcph.2001.6860 · Cited by 37
Riemannian Manifold Hamiltonian Monte CarloPreprint
Girolami, M., Calderhead, B., & Chin, S. (2009) · Cambridge University Engineering Department Publications Database · doi:10.48550/arxiv.0907.1100 · Cited by 33
Function factorization using warped Gaussian processes
Schmidt, M. N. (2009) · International Conference on Machine Learning · doi:10.1145/1553374.1553492 · Cited by 29
The Theory of Hybrid Stochastic Algorithms
Kennedy, A. D. (1990) · NATO ASI series. Series B : Physics · doi:10.1007/978-1-4615-3784-7_14 · Cited by 25
A general limitation on Monte Carlo algorithms of the Metropolis type
Caracciolo, S., Pelissetto, A., & Sokal, A. D. (1994) · Physical Review Letters · doi:10.1103/physrevlett.72.179 · Cited by 22
The Short-Cut Metropolis MethodPreprint
Neal, R. M. (2005) · arXiv (Cornell University) · doi:10.48550/arxiv.math/0508060 · Cited by 15
Learning hyperparameters for neural network models using Hamiltonian dynamics
Choo, K. (2000) · Library and Archives Canada (Government of Canada) · Cited by 8
Cited by
dynesty: a dynamic nested sampling package for estimating Bayesian posteriors and evidences
Speagle, J. S. (2020) · Monthly Notices of the Royal Astronomical Society · doi:10.1093/mnras/staa278 · Cited by 2,230
Probabilistic machine learning and artificial intelligence
Ghahramani, Z. (2015) · Nature · doi:10.1038/nature14541 · Cited by 1,995
Riemann manifold langevin and hamiltonian monte carlo methods
Girolami, M., & Calderhead, B. (2011) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.1467-9868.2010.00765.x · Cited by 1,473
Bayesian estimation supersedes the t-test
Kruschke, J. K. (2013) · Journal of Experimental Psychology: General · doi:10.1037/a0029146 · Cited by 1,530
Vrugt, J. A. (2016) · Environmental Modelling & Software · doi:10.1016/j.envsoft.2015.08.013 · Cited by 851
Metadata
- Authors
- Brooks, S., Gelman, A., Jones, G., & Meng, X.-L.
- Venue
- Chapman & Hall/CRC eBooks
- Publisher
- Chapman and Hall/CRC
- Published
- 2011-05-10
- OpenAlex
- W621546036
- Cited by
- 2,993
- References
- 40
- FWCI
- 28.58
- Type
- book
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.