The Convergence of Markov Chain Monte Carlo Methods: From the Metropolis Method to Hamiltonian Monte Carlo
From MaRDI portal
Publication:6059636
DOI10.1002/ANDP.201700214arXiv1706.01520OpenAlexW2962721303MaRDI QIDQ6059636FDOQ6059636
Authors: Michael Betancourt
Publication date: 2 November 2023
Published in: Annalen der Physik (Search for Journal in Brave)
Abstract: From its inception in the 1950s to the modern frontiers of applied statistics, Markov chain Monte Carlo has been one of the most ubiquitous and successful methods in statistical computing. In that time its development has been fueled by increasingly difficult problems and novel techniques from physics. In this article I will review the history of Markov chain Monte Carlo from its inception with the Metropolis method to today's state-of-the-art in Hamiltonian Monte Carlo. Along the way I will focus on the evolving interplay between the statistical and physical perspectives of the method.
Full work available at URL: https://arxiv.org/abs/1706.01520
Cites Work
- AD Model Builder: using automatic differentiation for statistical inference of highly parameterized complex nonlinear models
- The no-U-turn sampler: adaptively setting path lengths in Hamiltonian Monte Carlo
- Inference from iterative simulation using multiple sequences
- Graphical models, exponential families, and variational inference
- Optimization by simulated annealing
- Exponential convergence of Langevin distributions and their discrete approximations
- Weak convergence and optimal scaling of random walk Metropolis algorithms
- Sampling-Based Approaches to Calculating Marginal Densities
- Handbook of Markov Chain Monte Carlo
- Title not available (Why is that?)
- Monte Carlo sampling methods using Markov chains and their applications
- Equation of state calculations by fast computing machines
- Markov chains and stochastic stability
- Geometric Numerical Integration
- The Monte Carlo Method
- Time-Dependent Statistics of the Ising Model
- Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
- Title not available (Why is that?)
- A short history of Markov chain Monte Carlo: Subjective recollections from incomplete data
- The geometric foundations of Hamiltonian Monte Carlo
- Automatic differentiation: Applications, theory, and implementations. Selected papers based on the presentation at the 4th international conference on automatic differentiation (AD), Chicago, IL, USA, July 20--23, 2004
- Combining Historical and Randomized Controls for Assessing Trends in Proportions
Cited In (8)
- On the accept-reject mechanism for Metropolis-Hastings algorithms
- Comparison of methodologies to assess the convergence of Markov chain Monte Carlo methods
- Information Theory for Fields
- Trust-region based stochastic variational inference for distributed and asynchronous networks
- Fast and credible likelihood-free cosmology with truncated marginal neural ratio estimation
- Mixing rates for Hamiltonian Monte Carlo algorithms in finite and infinite dimensions
- Coupled simulations and parameter inversion for neural system and electrophysiological muscle models
- Stochastic gradient descent and fast relaxation to thermodynamic equilibrium: a stochastic control approach
This page was built for publication: The Convergence of Markov Chain Monte Carlo Methods: From the Metropolis Method to Hamiltonian Monte Carlo
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6059636)