Conditions for rapid mixing of parallel and simulated tempering on multimodal distributions

DOI10.1214/08-AAP555zbMATH Open1171.65008arXiv0906.2341OpenAlexW2001464954MaRDI QIDQ1024896FDOQ1024896

Scott C. Schmidler, D. B. Woodard, Mark Huber

Publication date: 17 June 2009

Published in: The Annals of Applied Probability (Search for Journal in Brave)

Abstract: We give conditions under which a Markov chain constructed via parallel or simulated tempering is guaranteed to be rapidly mixing, which are applicable to a wide range of multimodal distributions arising in Bayesian statistical inference and statistical mechanics. We provide lower bounds on the spectral gaps of parallel and simulated tempering. These bounds imply a single set of sufficient conditions for rapid mixing of both techniques. A direct consequence of our results is rapid mixing of parallel and simulated tempering for several normal mixture models, and for the mean-field Ising model.

Full work available at URL: https://arxiv.org/abs/0906.2341

zbMATH Keywords

Markov chain Monte Carlo methodspectral gaptemperingMetropolis-coupled algorithmrapidly mixing Markov chains

Mathematics Subject Classification ID

Computational methods in Markov chains (60J22) Monte Carlo methods (65C05) Numerical analysis or methods applied to Markov chains (65C40)

Cites Work

• Markov chains for exploring posterior distributions. (With discussion)
• Title not available (Why is that?)
• Title not available (Why is that?)
• General state space Markov chains and MCMC algorithms
• Geometric ergodicity and hybrid Markov chains
• Annealing Markov Chain Monte Carlo with Applications to Ancestral Inference
• Title not available (Why is that?)
• Geometric bounds for eigenvalues of Markov chains
• Markov chain decomposition for convergence rate analysis
• Geometric L² and ^{L1 convergence are equivalent for reversible Markov chains}
• Importance sampling for families of distributions
• Logarithmic Sobolev inequalities for finite Markov chains
• Comparison theorems for reversible Markov chains
• Sufficient conditions for torpid mixing of parallel and simulated tempering
• Bounds on the L 2 Spectrum for Markov Chains and Markov Processes: A Generalization of Cheeger's Inequality
• Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow
• On the swapping algorithm
• Title not available (Why is that?)
• Monte Carlo simulation in statistical physics. An introduction.
• On swapping and simulated tempering algorithms.
• Rates of convergence for Gibbs sampling for variance component models

Cited In (30)

• Finite-sample complexity of sequential Monte Carlo estimators
• Simple conditions for metastability of continuous Markov chains
• Efficient Multimodal Sampling via Tempered Distribution Flow
• On the convergence rates of some adaptive Markov chain Monte Carlo algorithms
• Accelerating parallel tempering: Quantile tempering algorithm (QuanTA)
• The use of a single pseudo-sample in approximate Bayesian computation
• Mixing times for the swapping algorithm on the Blume-Emery-Griffiths model
• Explaining transmission rate variations and forecasting epidemic spread in multiple regions with a semiparametric mixed effects SIR model
• Parallel hierarchical sampling: a general-purpose interacting Markov chains Monte Carlo algorithm
• Optimal scaling of random-walk Metropolis algorithms on general target distributions
• On the swapping algorithm
• Title not available (Why is that?)
• Weight-preserving simulated tempering
• Approximate Spectral Gaps for Markov Chain Mixing Times in High Dimensions
• Spectral gap of replica exchange Langevin diffusion on mixture distributions
• Complexity bounds for Markov chain Monte Carlo algorithms via diffusion limits
• Simulated tempering and swapping on mean-field models
• Generalized parallel tempering on Bayesian inverse problems
• A bound for the convergence rate of parallel tempering for sampling restricted Boltzmann machines
• Convergence rate of Markov chain methods for genomic motif discovery
• On swapping and simulated tempering algorithms.
• Complexity results for MCMC derived from quantitative bounds
• Mixing and hitting times for Gibbs samplers and other non-Feller processes
• State-dependent swap strategies and automatic reduction of number of temperatures in adaptive parallel tempering algorithm
• Towards optimal scaling of Metropolis-coupled Markov chain Monte Carlo
• Accelerating MCMC algorithms
• Random Construction of Interpolating Sets for High-Dimensional Integration
• Reflections on Bayesian inference and Markov chain Monte Carlo
• Error bounds for sequential Monte Carlo samplers for multimodal distributions
• Finite sample complexity of sequential Monte Carlo estimators on multimodal target distributions

   Recommendations

• Sufficient conditions for torpid mixing of parallel and simulated tempering 👍 👎
• Simulated tempering and swapping on mean-field models 👍 👎
• Title not available (Why is that?) 👍 👎
• Accelerating parallel tempering: Quantile tempering algorithm (QuanTA) 👍 👎
• Small-world MCMC and convergence to multi-modal distributions: from slow mixing to fast mixing 👍 👎

This page was built for publication: Conditions for rapid mixing of parallel and simulated tempering on multimodal distributions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1024896)