Accelerating MCMC algorithms
Open Access
- 13 June 2018
- journal article
- review article
- Published by Wiley in WIREs Computational Statistics
- Vol. 10 (5) , e1435
Abstract
Markov chain Monte Carlo algorithms are used to simulate from complex statistical distributions by way of a local exploration of these distributions. This local feature avoids heavy requests on understanding the nature of the target, but it also potentially induces a lengthy exploration of this target, with a requirement on the number of simulations that grows with the dimension of the problem and with the complexity of the data behind it. Several techniques are available toward accelerating the convergence of these Monte Carlo algorithms, either at the exploration level (as in tempering, Hamiltonian Monte Carlo and partly deterministic methods) or at the exploitation level (with Rao–Blackwellization and scalable methods).This article is categorized under: Statistical and Graphical Methods of Data Analysis > Markov Chain Monte Carlo (MCMC) Algorithms and Computational Methods > Algorithms Statistical and Graphical Methods of Data Analysis > Monte Carlo MethodsKeywords
All Related Versions
Funding Information
- Engineering and Physical Sciences Research Council (EP/K014463/1)
- Research Executive Agency (PCOFUND‐GA‐2013‐609102)
- Agence Nationale de la Recherche (ANR‐17‐CE40‐0031‐01)
- Institut Universitaire de France (2016–2021)
This publication has 65 references indexed in Scilit:
- History matching on the Imperial College fault model using parallel temperingComputational Geosciences, 2012
- Scaling analysis of multiple-try MCMC methodsStochastic Processes and their Applications, 2012
- Population MCMC methods for history matching and uncertainty quantificationComputational Geosciences, 2011
- Parallel tempering Monte Carlo simulations of lysozyme orientation on charged surfacesThe Journal of Chemical Physics, 2010
- The pseudo-marginal approach for efficient Monte Carlo computationsThe Annals of Statistics, 2009
- The Multiple-Try Method and Local Optimization in Metropolis SamplingJournal of the American Statistical Association, 2000
- Regeneration in Markov Chain SamplersJournal of the American Statistical Association, 1995
- Covariance structure of the Gibbs sampler with applications to the comparisons of estimators and augmentation schemesBiometrika, 1994
- Sampling-Based Approaches to Calculating Marginal DensitiesJournal of the American Statistical Association, 1990
- Hybrid Monte CarloPhysics Letters B, 1987