IDEAS home Printed from https://ideas.repec.org/p/pqs/wpaper/0272005.html
   My bibliography  Save this paper

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

Author

Listed:
  • Yves Atchade

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

Abstract

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
    as

    Download full text from publisher

    File URL: http://www.repad.org/ca/on/lrsp/csa2.pdf
    File Function: First version, 2005
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    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

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


    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.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Yves F. Atchadé, 2006. "An Adaptive Version for the Metropolis Adjusted Langevin Algorithm with a Truncated Drift," Methodology and Computing in Applied Probability, Springer, vol. 8(2), pages 235-254, June.
    2. Fort, G. & Moulines, E., 2003. "Polynomial ergodicity of Markov transition kernels," Stochastic Processes and their Applications, Elsevier, vol. 103(1), pages 57-99, January.
    3. Chris Sherlock & Anthony Lee, 2022. "Variance Bounding of Delayed-Acceptance Kernels," Methodology and Computing in Applied Probability, Springer, vol. 24(3), pages 2237-2260, September.
    4. Dalalyan, Arnak S. & Karagulyan, Avetik, 2019. "User-friendly guarantees for the Langevin Monte Carlo with inaccurate gradient," Stochastic Processes and their Applications, Elsevier, vol. 129(12), pages 5278-5311.
    5. Arnak S. Dalalyan, 2017. "Theoretical guarantees for approximate sampling from smooth and log-concave densities," Journal of the Royal Statistical Society Series B, Royal Statistical Society, vol. 79(3), pages 651-676, June.
    6. Kanaya, Shin, 2017. "Convergence Rates Of Sums Of Α-Mixing Triangular Arrays: With An Application To Nonparametric Drift Function Estimation Of Continuous-Time Processes," Econometric Theory, Cambridge University Press, vol. 33(5), pages 1121-1153, October.
    7. Allassonnière, Stéphanie & Kuhn, Estelle, 2015. "Convergent stochastic Expectation Maximization algorithm with efficient sampling in high dimension. Application to deformable template model estimation," Computational Statistics & Data Analysis, Elsevier, vol. 91(C), pages 4-19.
    8. Lacour, Claire, 2008. "Nonparametric estimation of the stationary density and the transition density of a Markov chain," Stochastic Processes and their Applications, Elsevier, vol. 118(2), pages 232-260, February.
    9. Giovanni Cerulli, 2012. "Are R&D Subsidies Provided Optimally? Evidence from a Simulated Agency-Firm Stochastic Dynamic Game," Journal of Artificial Societies and Social Simulation, Journal of Artificial Societies and Social Simulation, vol. 15(1), pages 1-7.
    10. Fort, Gersende & Moulines, Eric, 2000. "V-Subgeometric ergodicity for a Hastings-Metropolis algorithm," Statistics & Probability Letters, Elsevier, vol. 49(4), pages 401-410, October.
    11. David A. Spade, 2020. "Geometric ergodicity of a Metropolis-Hastings algorithm for Bayesian inference of phylogenetic branch lengths," Computational Statistics, Springer, vol. 35(4), pages 2043-2076, December.
    12. Samuel Livingstone & Giacomo Zanella, 2022. "The Barker proposal: Combining robustness and efficiency in gradient‐based MCMC," Journal of the Royal Statistical Society Series B, Royal Statistical Society, vol. 84(2), pages 496-523, April.
    13. Kamatani, Kengo, 2020. "Random walk Metropolis algorithm in high dimension with non-Gaussian target distributions," Stochastic Processes and their Applications, Elsevier, vol. 130(1), pages 297-327.
    14. Cizek, P., 2004. "Asymptotics of Least Trimmed Squares Regression," Other publications TiSEM dab5d551-aca6-40bf-b92e-c, Tilburg University, School of Economics and Management.
    15. Kanaya, Shin, 2017. "Convergence Rates Of Sums Of Α-Mixing Triangular Arrays: With An Application To Nonparametric Drift Function Estimation Of Continuous-Time Processes," Econometric Theory, Cambridge University Press, vol. 33(5), pages 1121-1153, October.
    16. O. F. Christensen & J. Møller & R. P. Waagepetersen, 2001. "Geometric Ergodicity of Metropolis-Hastings Algorithms for Conditional Simulation in Generalized Linear Mixed Models," Methodology and Computing in Applied Probability, Springer, vol. 3(3), pages 309-327, September.
    17. J. Isaac Miller, 2010. "Cointegrating regressions with messy regressors and an application to mixed‐frequency series," Journal of Time Series Analysis, Wiley Blackwell, vol. 31(4), pages 255-277, July.
    18. Denis Belomestny & Leonid Iosipoi, 2019. "Fourier transform MCMC, heavy tailed distributions and geometric ergodicity," Papers 1909.00698, arXiv.org, revised Dec 2019.
    19. Belomestny, Denis & Iosipoi, Leonid, 2021. "Fourier transform MCMC, heavy-tailed distributions, and geometric ergodicity," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 181(C), pages 351-363.
    20. Medina-Aguayo, Felipe & Rudolf, Daniel & Schweizer, Nikolaus, 2020. "Perturbation bounds for Monte Carlo within Metropolis via restricted approximations," Stochastic Processes and their Applications, Elsevier, vol. 130(4), pages 2200-2227.

    More about this item

    Keywords

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

    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:

    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:pqs:wpaper:0272005. 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.

    If CitEc recognized a bibliographic 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.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Christian Calmes (email available below). General contact details of provider: https://edirc.repec.org/data/dsuqoca.html .

    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.