Generalized parallel tempering on Bayesian inverse problems
Open Access
- 30 August 2021
- journal article
- research article
- Published by Springer Nature in Statistics and Computing
- Vol. 31 (5) , 1-26
Abstract
In the current work we present two generalizations of the Parallel Tempering algorithm in the context of discrete-time Markov chain Monte Carlo methods for Bayesian inverse problems. These generalizations use state-dependent swapping rates, inspired by the so-called continuous time Infinite Swapping algorithm presented in Plattner et al. (J Chem Phys 135(13):134111, 2011). We analyze the reversibility and ergodicity properties of our generalized PT algorithms. Numerical results on sampling from different target distributions, show that the proposed methods significantly improve sampling efficiency over more traditional sampling algorithms such as Random Walk Metropolis, preconditioned Crank–Nicolson, and (standard) Parallel Tempering.Keywords
All Related Versions
Funding Information
- King Abdullah University of Science and Technology (URF/1/2281-01-01, URF/1/2584-01-01)
- Alexander von Humboldt-Stiftung
- Graduate School, Technische Universität München (10.02 BAYES)
- Swiss Data Science Center (p18-09)
This publication has 41 references indexed in Scilit:
- MCMC Methods for Functions: Modifying Old Algorithms to Make Them FasterStatistical Science, 2013
- The pseudo-marginal approach for efficient Monte Carlo computationsThe Annals of Statistics, 2009
- Conditions for rapid mixing of parallel and simulated tempering on multimodal distributionsThe Annals of Applied Probability, 2009
- Accelerating Markov Chain Monte Carlo Simulation by Differential Evolution with Self-Adaptive Randomized Subspace SamplingInternational Journal of Nonlinear Sciences and Numerical Simulation, 2009
- Parameter estimation of spinning binary inspirals using Markov chain Monte CarloClassical and Quantum Gravity, 2008
- Markov chain decomposition for convergence rate analysisThe Annals of Applied Probability, 2002
- An Adaptive Metropolis AlgorithmBernoulli, 2001
- Markov Chains and Stochastic StabilityJournal of the American Statistical Association, 1997
- Simulated Tempering: A New Monte Carlo SchemeEurophysics Letters, 1992
- Monte Carlo sampling methods using Markov chains and their applicationsBiometrika, 1970