期刊
BIOMETRIKA
卷 88, 期 4, 页码 1035-1053出版社
BIOMETRIKA TRUST
DOI: 10.1093/biomet/88.4.1035
关键词
adaptive; changepoint; efficiency of Markov chain Monte Carlo estimation; integrated autocorrelation time; Peskun ordering
In a Metropolis-Hastings algorithm, rejection of proposed moves is an intrinsic part of ensuring that the chain converges to the intended target distribution. However, persistent rejection, perhaps in particular parts of the state space, may indicate that locally the proposal distribution is badly calibrated to the target. As an alternative to careful off-line tuning of state-dependent proposals, the basic algorithm can be modified so that, on rejection, a second attempt to move is made. A different proposal can be generated from a new distribution that is allowed to depend on the previously rejected proposal. We generalise this idea of delaying the rejection and adapting the proposal distribution, due to Tierney & Mira (1999), to generate a more flexible class of methods that applies in particular to a variable-dimension setting. The approach is illustrated by two pedagogical examples and a more realistic application to a changepoints analysis for point processes.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据