Adaptive Gibbs samplers and related MCMC methods
Adaptive Gibbs samplers and related MCMC methods
复制标题
DOI:
10.1214/11-aap806
复制
发表时间:
2011-01
影响因子:
1.8
通讯作者:
K. Latuszy'nski;G. Roberts;J. Rosenthal
中科院分区:
文献类型:
--
作者:
K. Latuszy'nski;G. Roberts;J. Rosenthal
We consider various versions of adaptive Gibbs and Metropolis- within-Gibbs samplers, which update their selection probabilities (and per- haps also their proposal distributions) on the y during a run, by learning as they go in an attempt to optimise the algorithm. We present a cautionary example of how even a simple-seeming adaptive Gibbs sampler may fail to converge. We then present various positive results guaranteeing convergence of adaptive Gibbs samplers under certain conditions. AMS 2000 subject classications: Primary 60J05, 65C05; secondary 62F15.