期刊
BERNOULLI
卷 11, 期 5, 页码 815-828出版社
INT STATISTICAL INST
DOI: 10.3150/bj/1130077595
关键词
adaptive Markov chain Monte Carlo; metropolis algorithm; mixingales; parameter tuning; Robbins-Monro algorithm
We look at adaptive Markov chain Monte Carlo algorithms that generate stochastic processes based on sequences of transition kernels, where each transition kernel is allowed to depend on the history of the process. We show under certain conditions that the stochastic process generated is ergodic, with appropriate stationary distribution. We use this result to analyse an adaptive version of the random walk Metropolis algorithm where the scale parameter sigma is sequentially adapted using a Robbins-Monro type algorithm in order to find the optimal scale parameter sigma(opt). We close with a simulation example.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据