An Adaptive Version for the Metropolis Adjusted Langevin Algorithm with a Truncated Drift
Author
Abstract
Suggested Citation
DOI: 10.1007/s11009-006-8550-0
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- O. Stramer & R. L. Tweedie, 1999. "Langevin-Type Models II: Self-Targeting Candidates for MCMC Algorithms," Methodology and Computing in Applied Probability, Springer, vol. 1(3), pages 307-328, October.
- 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.
- 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.
- Pelletier, Mariane, 1998. "On the almost sure asymptotic behaviour of stochastic algorithms," Stochastic Processes and their Applications, Elsevier, vol. 78(2), pages 217-244, November.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Pierrette Chagneau & Frédéric Mortier & Nicolas Picard & Jean-Noël Bacro, 2011. "A Hierarchical Bayesian Model for Spatial Prediction of Multivariate Non-Gaussian Random Fields," Biometrics, The International Biometric Society, vol. 67(1), pages 97-105, March.
- Julio López & Sebastián Maldonado & Ricardo Montoya, 2017. "Simultaneous preference estimation and heterogeneity control for choice-based conjoint via support vector machines," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(11), pages 1323-1334, November.
- 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.
- 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.
- 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.
- 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.
- 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.
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.- 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.
- Arnak Dalalyan & Avetik Karagulyan, 2017. "User-friendly guarantees for the Langevin Monte Carlo with inaccurate gradient," Working Papers 2017-20, Center for Research in Economics and Statistics.
- 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.
- 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.
- 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.
- Pelletier, Mariane, 1999. "An Almost Sure Central Limit Theorem for Stochastic Approximation Algorithms," Journal of Multivariate Analysis, Elsevier, vol. 71(1), pages 76-93, October.
- Junming Li & Xiulan Han & Xiao Li & Jianping Yang & Xuejiao Li, 2018. "Spatiotemporal Patterns of Ground Monitored PM 2.5 Concentrations in China in Recent Years," IJERPH, MDPI, vol. 15(1), pages 1-15, January.
- Fort, G. & Moulines, E., 2003. "Polynomial ergodicity of Markov transition kernels," Stochastic Processes and their Applications, Elsevier, vol. 103(1), pages 57-99, January.
- 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.
- Costa, Manon & Gadat, Sébastien & Bercu, Bernard, 2020. "Stochastic approximation algorithms for superquantiles estimation," TSE Working Papers 20-1142, Toulouse School of Economics (TSE).
- 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.
- Arnak S. Dalalyan, 2014. "Theoretical guarantees for approximate sampling from smooth and log-concave densities," Working Papers 2014-45, Center for Research in Economics and Statistics.
- 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.
- Kanaya, Shin, 2016. "Convergence rates of sums of α-mixing triangular arrays : with an application to non-parametric drift function estimation of continuous-time processes," Discussion Paper Series 646, Institute of Economic Research, Hitotsubashi University.
- Shin Kanaya, 2016. "Convergence rates of sums of a-mixing triangular arrays: with an application to non-parametric drift function estimation of continuous-time processes," CREATES Research Papers 2016-24, Department of Economics and Business Economics, Aarhus University.
- G. O. Roberts & O. Stramer, 2002. "Langevin Diffusions and Metropolis-Hastings Algorithms," Methodology and Computing in Applied Probability, Springer, vol. 4(4), pages 337-357, December.
- 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.
- O. Stramer & R. L. Tweedie, 1999. "Langevin-Type Models I: Diffusions with Given Stationary Distributions and their Discretizations," Methodology and Computing in Applied Probability, Springer, vol. 1(3), pages 283-306, October.
- 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.
- Denis Belomestny & Leonid Iosipoi, 2019. "Fourier transform MCMC, heavy tailed distributions and geometric ergodicity," Papers 1909.00698, arXiv.org, revised Dec 2019.
- 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.
- Giovanni Cerulli, 2010. "Are R&D subsidies provided optimally? Evidence from a simulated agency-firm stochastic dynamic game," CERIS Working Paper 201011, CNR-IRCrES Research Institute on Sustainable Economic Growth - Torino (TO) ITALY - former Institute for Economic Research on Firms and Growth - Moncalieri (TO) ITALY.
- Fort, Gersende & Moulines, Eric, 2000. "V-Subgeometric ergodicity for a Hastings-Metropolis algorithm," Statistics & Probability Letters, Elsevier, vol. 49(4), pages 401-410, October.
- 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.
- 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
Adaptive Markov Chain Monte Carlo; Langevin algorithms; Metropolis-Hastings algorithms; Stochastic approximation algorithms;All these keywords.
Statistics
Access and download statisticsCorrections
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:spr:metcap:v:8:y:2006:i:2:d:10.1007_s11009-006-8550-0. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.