IDEAS home Printed from https://ideas.repec.org/a/oup/biomet/v111y2024i1p273-289..html
   My bibliography  Save this article

On geometric convergence for the Metropolis-adjusted Langevin algorithm under simple conditions

Author

Listed:
  • Alain Oliviero-Durmus
  • Éric Moulines

Abstract

SummaryWhile the Metropolis-adjusted Langevin algorithm is a popular and widely used Markov chain Monte Carlo method, very few papers derive conditions that ensure its convergence. In particular, to the authors’ knowledge, assumptions that are both easy to verify and guarantee geometric convergence, are still missing. In this work, we establish V-uniformly geometric convergence for the Metropolis-adjusted Langevin algorithm under mild assumptions about the target distribution. Unlike previous work, we only consider tail and smoothness conditions for the potential associated with the target distribution. These conditions are quite common in the Markov chain Monte Carlo literature. Finally, we pay special attention to the dependence of the bounds we derive on the step size of the Euler–Maruyama discretization, which corresponds to the proposed Markov kernel of the Metropolis-adjusted Langevin algorithm.

Suggested Citation

  • Alain Oliviero-Durmus & Éric Moulines, 2024. "On geometric convergence for the Metropolis-adjusted Langevin algorithm under simple conditions," Biometrika, Biometrika Trust, vol. 111(1), pages 273-289.
  • Handle: RePEc:oup:biomet:v:111:y:2024:i:1:p:273-289.
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1093/biomet/asad060
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:oup:biomet:v:111:y:2024:i:1:p:273-289.. 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: Oxford University Press (email available below). General contact details of provider: https://academic.oup.com/biomet .

    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.