Adaptive proposal distribution for random walk Metropolis algorithm
type: Item
instance of: scholarly article
published in: Computational Statistics
volume: 14
issue: 3
page(s): 375-395
publication date: 1999-09-01T00:00:00Z
publication date: 2000-05-24T00:00:00Z
author: Heikki Haario
author: Eero Saksman
author: Johanna Tamminen
title: Adaptive proposal distribution for random walk Metropolis algorithm
zbMATH Open document ID: 0941.62036
review text: Here, a new adaptive Markov Chain Monte Carlo method (MCMC) is introduced that yields a quick and flexible tool for estimating e.g. posteriori distributions in parameter estimation problems. Basically the method consists of the well-known Metropolis algorithm [see \textit{W.K. Hastings}, Biometrika 57, 97-109 (1970; Zbl 0219.65008)], where, however, the proposal distribution is tuned along the search according to the covariance calculated from a fixed number of previous states. This procedure makes sure that the MCMC process adapts to the target distribution, at least locally, and thus keeps the search effective all the time. The authors call this method Adaptive Proposal (AP). This paper is devoted to investigate the properties and practical usefulness of the AP algorithm. Although the stationary distribution of the AP algorithm is slightly biased, it appears to provide an efficient tool for, e.g., reasonable low-dimensional problems, as typically encountered in nonlinear regression problems in natural sciences. The AP algorithm is also applied in more realistic inverse problems applications. This problem arises in data processing of the Global Ozone Monitoring by Occultation of Stars satellite instruments. In this interesting application each analysis requires about 50 inversions. Moreover, when applying the Metropolis-Hastings method each inversion requires a quite individual proposal distribution. It appears that AP provides a valuable tool for this kind of applications.
Mathematics Subject Classification ID: 62F99
Mathematics Subject Classification ID: 62P12
Mathematics Subject Classification ID: 65C40
zbMATH DE Number: 1452444
zbMATH Keywords: Markov chain Monte Carlo (MCMC)
zbMATH Keywords: adaptive MCMC
zbMATH Keywords: Metropolis-Hastings algorithm
zbMATH Keywords: convergence
Wikidata QID: Q59866703
MaRDI profile type: Publication
full work available at URL: s001800050022
OpenAlex ID: W3124691892
cites work: Sampling-Based Approaches to Calculating Marginal Densities
cites work: Adaptive Rejection Metropolis Sampling within Gibbs Sampling
cites work: Q4865933
cites work: Adaptive Markov Chain Monte Carlo through Regeneration
cites work: Adaptive Rejection Sampling for Gibbs Sampling
cites work: An adaptive Metropolis algorithm
cites work: Monte Carlo sampling methods using Markov chains and their applications
cites work: Equation of State Calculations by Fast Computing Machines
cites work: Q5289009
cites work: Weak convergence and optimal scaling of random walk Metropolis algorithms
cites work: Self-regenerative Markov chain Monte Carlo with adaptation
DBLP publication ID: journals/cstat/HaarioST99
DOI: 10.1007/S001800050022
description: scientific article; zbMATH DE number 1452444