Sufficient Conditions for Torpid Mixing of Parallel and Simulated Tempering

被引:32
作者
Woodard, Dawn B. [1 ]
Schmidler, Scott C. [2 ]
Huber, Mark [3 ]
机构
[1] Cornell Univ, Sch Operat Res & Informat Engn, Ithaca, NY 14853 USA
[2] Duke Univ, Dept Stat Sci, Durham, NC 27708 USA
[3] Duke Univ, Dept Math, Durham, NC 27708 USA
来源
ELECTRONIC JOURNAL OF PROBABILITY | 2009年 / 14卷
基金
美国国家科学基金会;
关键词
Markov chain; rapid mixing; spectral gap; Metropolis algorithm; MARKOV-CHAIN; MONTE-CARLO; DISTRIBUTIONS;
D O I
10.1214/EJP.v14-638
中图分类号
O21 [概率论与数理统计]; C8 [统计学];
学科分类号
020208 ; 070103 ; 0714 ;
摘要
We obtain upper bounds on the spectral gap of Markov chains constructed by parallel and simulated tempering, and provide a set of sufficient conditions for torpid mixing of both techniques. Combined with the results of [22], these results yield a two-sided bound on the spectral gap of these algorithms. We identify a persistence property of the target distribution, and show that it can lead unexpectedly to slow mixing that commonly used convergence diagnostics will fail to detect. For a multimodal distribution, the persistence is a measure of how "spiky", or tall and narrow, one peak is relative to the other peaks of the distribution. We show that this persistence phenomenon can be used to explain the torpid mixing of parallel and simulated tempering on the ferromagnetic mean-field Potts model shown previously. We also illustrate how it causes torpid mixing of tempering on a mixture of normal distributions with unequal covariances in R-M, a previously unknown result with relevance to statistical inference problems. More generally, any-time a multimodal distribution includes both very narrow and very wide peaks of comparable probability mass, parallel and simulated tempering are shown to mix slowly.
引用
收藏
页码:780 / 804
页数:25
相关论文
共 24 条
[1]  
[Anonymous], COMP SCI STAT
[2]  
Banerjee S., 2004, Hierarchical Modeling and Analysis for Spatial Data, V2nd
[3]  
Bhatnagar Nayantara., 2004, P 15 ACMSIAM S DISCR, P478
[4]   STOCHASTIC RELAXATION, GIBBS DISTRIBUTIONS, AND THE BAYESIAN RESTORATION OF IMAGES [J].
GEMAN, S ;
GEMAN, D .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1984, 6 (06) :721-741
[5]   ANNEALING MARKOV-CHAIN MONTE-CARLO WITH APPLICATIONS TO ANCESTRAL INFERENCE [J].
GEYER, CJ ;
THOMPSON, EA .
JOURNAL OF THE AMERICAN STATISTICAL ASSOCIATION, 1995, 90 (431) :909-920
[6]   The Swendsen-Wang process does not always mix rapidly [J].
Gore, VK ;
Jerrum, MR .
JOURNAL OF STATISTICAL PHYSICS, 1999, 97 (1-2) :67-86
[7]   Hidden Markov models and disease mapping [J].
Green, PJ ;
Richardson, S .
JOURNAL OF THE AMERICAN STATISTICAL ASSOCIATION, 2002, 97 (460) :1055-1070
[8]   Sampling according to the multivariate normal density [J].
Kannan, R ;
Li, GX .
37TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 1996, :204-212
[9]   BOUNDS ON THE L2 SPECTRUM FOR MARKOV-CHAINS AND MARKOV-PROCESSES - A GENERALIZATION OF CHEEGER-INEQUALITY [J].
LAWLER, GF ;
SOKAL, AD .
TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY, 1988, 309 (02) :557-580
[10]   On the swapping algorithm [J].
Madras, N ;
Zheng, ZR .
RANDOM STRUCTURES & ALGORITHMS, 2003, 22 (01) :66-97