On the stability and ergodicity of adaptive scaling Metropolis algorithms
AbstractThe stability and ergodicity properties of two adaptive random walk Metropolis algorithms are considered. Both algorithms adjust the scaling of the proposal distribution continuously based on the observed acceptance probability. Unlike the previously proposed forms of the algorithms, the adapted scaling parameter is not constrained within a predefined compact interval. The first algorithm is based on scale adaptation only, while the second one also incorporates covariance adaptation. A strong law of large numbers is shown to hold assuming that the target density is smooth enough and has either compact support or super-exponentially decaying tails.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoArticle provided by Elsevier in its journal Stochastic Processes and their Applications.
Volume (Year): 121 (2011)
Issue (Month): 12 ()
Contact details of provider:
Web page: http://www.elsevier.com/wps/find/journaldescription.cws_home/505572/description#description
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Jarner, Søren Fiig & Hansen, Ernst, 2000. "Geometric ergodicity of Metropolis algorithms," Stochastic Processes and their Applications, Elsevier, vol. 85(2), pages 341-361, February.
If references are entirely missing, you can add them using this form.