IDEAS home Printed from
   My bibliography  Save this paper

An Adaptive Version for the Metropolis Adjusted Langevin Algorithm with a Truncated Drift


  • Yves Atchade

    () (Department of Mathematics and Statistics, University of Ottawa and LRSP)


This paper proposes an adaptive version for the Metropolis adjusted Langevin algorithm with a truncated drift (T-MALA). The scale parameter and the covariance matrix of the proposal kernel of the algorithm are simultaneously and recursively updated in order to reach the optimal acceptance rate of 0:574 (see Roberts and Rosenthal (2001)) and to estimate and use the correlation structure of the target distribution. We develop some convergence results for the algorithm. A simulation example is presented.

Suggested Citation

  • Yves Atchade, 2005. "An Adaptive Version for the Metropolis Adjusted Langevin Algorithm with a Truncated Drift," RePAd Working Paper Series LRSP-WP1, Département des sciences administratives, UQO.
  • Handle: RePEc:pqs:wpaper:0272005

    Download full text from publisher

    File URL:
    File Function: First version, 2005
    Download Restriction: no

    References listed on IDEAS

    1. 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.
    2. James Davidson & Robert de Jong, 1997. "Strong laws of large numbers for dependent heterogeneous processes: a synthesis of recent and new results," Econometric Reviews, Taylor & Francis Journals, vol. 16(3), pages 251-279.
    Full references (including those not matched with items on IDEAS)


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

    Cited by:

    1. Param Vir Singh & Nachiketa Sahoo & Tridas Mukhopadhyay, 2014. "How to Attract and Retain Readers in Enterprise Blogging?," Information Systems Research, INFORMS, vol. 25(1), pages 35-52, March.
    2. Yingda Lu & Kinshuk Jerath & Param Vir Singh, 2013. "The Emergence of Opinion Leaders in a Networked Online Community: A Dyadic Model with Time Dynamics and a Heuristic for Fast Estimation," Management Science, INFORMS, vol. 59(8), pages 1783-1799, August.
    3. Tridas Mukhopadhyay & ParamVir Singh & Seung Hyun Kim, 2011. "Learning Curves of Agents with Diverse Skills in Information Technology-Enabled Physician Referral Systems," Information Systems Research, INFORMS, vol. 22(3), pages 586-605, September.
    4. Param Vir Singh & Corey Phelps, 2013. "Networks, Social Influence, and the Choice Among Competing Innovations: Insights from Open Source Software Licenses," Information Systems Research, INFORMS, vol. 24(3), pages 539-560, September.

    More about this item


    Markov Chain Monte Carlo; Stochastic approximation algorithms; Metropolis Adjusted Langevin algorithm; geometric rate of convergence.;

    JEL classification:

    • C10 - Mathematical and Quantitative Methods - - Econometric and Statistical Methods and Methodology: General - - - General
    • C40 - Mathematical and Quantitative Methods - - Econometric and Statistical Methods: Special Topics - - - General

    NEP fields

    This paper has been announced in the following NEP Reports:


    Access and download statistics


    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:pqs:wpaper:0272005. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Christian Calmes). General contact details of provider: .

    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.

    If CitEc recognized a reference but did not link an item in RePEc to it, you can help with 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.

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

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.