Date: 08 Aug 2006

An Adaptive Version for the Metropolis Adjusted Langevin Algorithm with a Truncated Drift

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


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.