Accelerating MCMC Algorithms
arXiv:1804.02719
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 towards 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-Blackwellisation and scalable methods).
arXiv commentThis is a survey paper, submitted WIREs Computational Statistics, to with 6 figures
References in corpus (11)
- Simulated Tempering: A New Monte Carlo Scheme
- Determining the density of states for classical statistical models: A random walk algorithm to produce a flat histogram
- Parallelizing MCMC via Weierstrass Sampler
- Randomized Hamiltonian Monte Carlo
- Non-asymptotic convergence analysis for the Unadjusted Langevin Algorithm
- Orthogonal parallel MCMC methods for sampling and optimization
- On the ergodicity of the adaptive Metropolis algorithm on unbounded domains
- A review of homomorphic encryption and software tools for encrypted statistical machine learning
- Piecewise Deterministic Markov Processes for Scalable Monte Carlo on Restricted Domains
- Parallelizing MCMC with Random Partition Trees
- Improving the Asymptotic Performance of Markov Chain Monte-Carlo by Inserting Vortices