An adaptive version for the Metropolis adjusted Langevin algorithm with a truncated drift
type: Item
instance of: scholarly article
title: An adaptive version for the Metropolis adjusted Langevin algorithm with a truncated drift
zbMATH Open document ID: 1104.65004
author: Yves F. Atchadé
published in: Methodology and Computing in Applied Probability
publication date: 2006-10-27T00:00:00Z
review text: Let \(\chi\) be an open subset of the \(d\)-dimensional Euclidean space \({\mathbb R}^{d}\) equipped with its Borel subsets and \(\pi\) is a positive and continuously differentiable density with respect to the Lebesgue measure on \(\chi.\) The bounded function \(D:\chi \to \chi\) is a drift function. The essence of the Metropolis-Hastings (MH) algorithm with a drift function \(D\) and a proposed density for the generating Markov chain \((X_{n})\) with invariant distribution \(\pi\) is reminded. In section 2 some adaptive schemes for the random walk Metropolis algorithm are extended to more general versions of the MH algorithm, particularly to the Metropolis adjusted Langevin algorithm with a truncated drift. The computing scheme of an adaptive version of the MH algorithm with bounded drift is presented in algorithm 2.1 which is exposed in section 2.1. The ergodicity of the adaptive MH algorithm is studied in section 2.2. Three assumptions are introduced and essentially used to prove the main results. Theorem 2.1 states an order \({\mathcal O}\left( \log n \over n^{\lambda}\right)\) \(({1 \over 2} < \lambda \leq 1)\) of the rate of convergence in \(V\)-norm of the distribution \({\mathcal L}(X_{n})\) of the stochastic process \((X_{n})\) generated by the algorithm 2.1 to the density \(\pi.\) It is shown that for any measurable function \(f\) the quasi-Monte Carlo algorithm for the function \(f\) on the set \((X_{n})\) converges to \(\pi(f)\) as \(n \to \infty.\) In section 2.3 the geometric ergodisity of the MH algorithm is studied. The algorithm 2.1 is illustrated by two simulation examples which are given in section 3. The first example is an illustration of sampling from a 20-dimensional Gaussian distribution. The second example models the failure of pumps at a nuclear plant. In section 4 the convergence of stochastic approximation algorithms is shown. A new approach to analyse stochastic approximation algorithms with Markovian dynamics is developed. The adaptive …
reviewed by: Vassil Grozdanov
Mathematics Subject Classification ID: 65C05
Mathematics Subject Classification ID: 65C40
Mathematics Subject Classification ID: 60J27
Mathematics Subject Classification ID: 60J35
Mathematics Subject Classification ID: 60J22
zbMATH DE Number: 5068162
zbMATH Keywords: Adaptive Markov chain Monte Carlo
zbMATH Keywords: Metropolis-Hastings algorithm
zbMATH Keywords: Stochastic approximation algorithm
zbMATH Keywords: Langevin algorithms
zbMATH Keywords: numerical examples
zbMATH Keywords: convergence
zbMATH Keywords: quasi-Monte Carlo algorithm
MaRDI profile type: Publication
full work available at URL: s11009-006-8550-0
OpenAlex ID: W2075954168
cites work: On the efficiency of adaptive MCMC algorithms
cites work: On the ergodicity properties of some adaptive MCMC algorithms
cites work: On adaptive Markov chain Monte Carlo algorithms
cites work: Renewal theory and computable convergence rates for geometrically erdgodic Markov chains
cites work: Q3997575
cites work: Optimal scaling of MaLa for nonlinear regression.
cites work: Strong laws of large numbers for dependent heterogeneous processes: a synthesis of recent and new results
cites work: Adaptive Markov Chain Monte Carlo through Regeneration
cites work: An adaptive Metropolis algorithm
cites work: Q3911791
cites work: Geometric ergodicity of Metropolis algorithms
cites work: Q4421713
cites work: Applications of a Kushner and Clark lemma to general classes of stochastic algorithms
cites work: On the almost sure asymptotic behaviour of stochastic algorithm
cites work: Q4828566
cites work: Optimal scaling for various Metropolis-Hastings algorithms.
cites work: Exponential convergence of Langevin distributions and their discrete approximations
cites work: Langevin-type models II: Self-targeting candidates for MCMC algorithms
cites work: Markov chains for exploring posterior distributions. (With discussion)
DOI: 10.1007/S11009-006-8550-0
description: scientific article