IDEAS home Printed from https://ideas.repec.org/a/bla/scjsta/v29y2002i1p13-29.html
   My bibliography  Save this article

Improving Convergence of the Hastings–Metropolis Algorithm with an Adaptive Proposal

Author

Listed:
  • DIDIER CHAUVEAU
  • PIERRE VANDEKERKHOVE

Abstract

The Hastings–Metropolis algorithm is a general MCMC method for sampling from a density known up to a constant. Geometric convergence of this algorithm has been proved under conditions relative to the instrumental (or proposal) distribution. We present an inhomogeneous Hastings–Metropolis algorithm for which the proposal density approximates the target density, as the number of iterations increases. The proposal density at the nth step is a non‐parametric estimate of the density of the algorithm, and uses an increasing number of i.i.d. copies of the Markov chain. The resulting algorithm converges (in n) geometrically faster than a Hastings–Metropolis algorithm with any fixed proposal distribution. The case of a strictly positive density with compact support is presented first, then an extension to more general densities is given. We conclude by proposing a practical way of implementation for the algorithm, and illustrate it over simulated examples.

Suggested Citation

  • Didier Chauveau & Pierre Vandekerkhove, 2002. "Improving Convergence of the Hastings–Metropolis Algorithm with an Adaptive Proposal," Scandinavian Journal of Statistics, Danish Society for Theoretical Statistics;Finnish Statistical Society;Norwegian Statistical Association;Swedish Statistical Association, vol. 29(1), pages 13-29, March.
    • Handle: RePEc:bla:scjsta:v:29:y:2002:i:1:p:13-29
    DOI: 10.1111/1467-9469.00064
    as

    Download full text from publisher

    File URL: https://doi.org/10.1111/1467-9469.00064
    Download Restriction: no
    File URL: https://libkey.io/10.1111/1467-9469.00064?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Campillo, Fabien & Rakotozafy, Rivo & Rossi, Vivien, 2009. "Parallel and interacting Markov chain Monte Carlo algorithm," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 79(12), pages 3424-3433.
    2. Tani, Massimiliano & Manuguerra, Maurizio, 2013. "The Effect of Migration and Spatial Connectivity on Regional Skill Endowments across Europe: 1988-2010," IZA Discussion Papers 7292, Institute of Labor Economics (IZA).
    3. C. Berrett & B. Gurney & D. Arthur & T. Moon & G. P. Williams, 2023. "A Bayesian change point modeling approach to identify local temperature changes related to urbanization," Environmetrics, John Wiley & Sons, Ltd., vol. 34(3), May.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:bla:scjsta:v:29:y:2002:i:1:p:13-29. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wiley Content Delivery (email available below). General contact details of provider: http://www.blackwellpublishing.com/journal.asp?ref=0303-6898 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.