Minimising MCMC variance via diffusion limits, with an application to simulated tempering
arXiv:1401.3559 · doi:10.1214/12-AAP918
Abstract
We derive new results comparing the asymptotic variance of diffusions by writing them as appropriate limits of discrete-time birth-death chains which themselves satisfy Peskun orderings. We then apply our results to simulated tempering algorithms to establish which choice of inverse temperatures minimises the asymptotic variance of all functionals and thus leads to the most efficient MCMC algorithm.
arXiv commentPublished in at http://dx.doi.org/10.1214/12-AAP918 the Annals of Applied Probability (http://www.imstat.org/aap/) by the Institute of Mathematical Statistics (http://www.imstat.org)
References in corpus (6)
- MCMC using Hamiltonian dynamics
- Simulated Tempering: A New Monte Carlo Scheme
- Optimal scalings for local Metropolis--Hastings chains on nonproduct targets in high dimensions
- The incomplete beta function law for parallel tempering sampling of classical canonical systems
- Convergence of adaptive and interacting Markov chain Monte Carlo algorithms
- Weak convergence of Metropolis algorithms for non-i.i.d. target distributions
Cited by in corpus (5)
- On the efficiency of pseudo-marginal random walk Metropolis algorithms
- Non-Reversible Parallel Tempering: a Scalable Highly Parallel MCMC Scheme
- Simulated Tempering Method in the Infinite Switch Limit with Adaptive Weight Learning
- Jump Markov Chains and Rejection-Free Metropolis Algorithms
- Accelerating Parallel Tempering: Quantile Tempering Algorithm (QuanTA)