Conditions for Rapid Mixing of Parallel and Simulated Tempering on Multimodal Distributions

Loading...
Thumbnail Image

Date

2009

Journal Title

Journal ISSN

Volume Title

Repository Usage Stats

255
views
145
downloads

Citation Stats

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.

Department

Description

Provenance

Citation

Woodard,Dawn B.;Schmidler,Scott C.;Huber,Mark. 2009. Conditions for Rapid Mixing of Parallel and Simulated Tempering on Multimodal Distributions. Annals of Applied Probability 19(2): 617-640.

Published Version (Please cite this version)

10.1214/08-AAP555

Scholars@Duke

Schmidler

Scott C. Schmidler

Associate Professor of Statistical Science

Research Interests:

  • Monte Carlo methods; high-dimensional sampling algorithms; Mixing times of Markov chains; MCMC; Sequential Monte Carlo; Bayesian computation.
  • Computational biology; Protein structure and folding; computational immunology; computational biophysics; statistical physics; computational statistical mechanics; molecular evolution.

Unless otherwise indicated, scholarly articles published by Duke faculty members are made available here with a CC-BY-NC (Creative Commons Attribution Non-Commercial) license, as enabled by the Duke Open Access Policy. If you wish to use the materials in ways not already permitted under CC-BY-NC, please consult the copyright owner. Other materials are made available here through the author’s grant of a non-exclusive license to make their work openly accessible.