An adaptive version for the Metropolis Adjusted Langevin algorithm with a truncated drift

被引:80
作者
Atchade, Yves F. [1 ]
机构
[1] Univ Ottawa, Dept Math & Stat, Ottawa, ON K1N 6N5, Canada
基金
加拿大自然科学与工程研究理事会;
关键词
adaptive Markov Chain Monte Carlo; Langevin algorithms; Metropolis-Hastings algorithms; stochastic approximation algorithms;
D O I
10.1007/s11009-006-8550-0
中图分类号
O21 [概率论与数理统计]; C8 [统计学];
学科分类号
020208 ; 070103 ; 0714 ;
摘要
This paper extends some adaptive schemes that have been developed for the Random Walk Metropolis algorithm to more general versions of the Metropolis-Hastings (MH) algorithm, particularly to the Metropolis Adjusted Langevin algorithm of Roberts and Tweedie (1996). Our simulations show that the adaptation drastically improves the performance of such MH algorithms. We study the convergence of the algorithm. Our proves are based on a new approach to the analysis of stochastic approximation algorithms based on mixingales theory.
引用
收藏
页码:235 / 254
页数:20
相关论文
共 20 条