[1507.05021] Non-asymptotic convergence analysis for the Unadjusted Langevin Algorithm
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs. arXiv Operational Status
[1507.05021] Non-asymptotic convergence analysis for the Unadjusted Langevin Algorithm Skip to main content arXiv is now an independent nonprofit! Learn more × Search arXiv Press Enter to search · Advanced search --> Mathematics > Statistics Theory arXiv:1507.05021 (math) [Submitted on 17 Jul 2015 ( v1 ), last revised 19 Dec 2016 (this version, v3)] Title: Non-asymptotic convergence analysis for the Unadjusted Langevin Algorithm Authors: Alain Durmus (LTCI), Eric Moulines (CMAP) View a PDF of the paper titled Non-asymptotic convergence analysis for the Unadjusted Langevin Algorith
related reading
- An optimization perspective on log-concave sampling and beyond | Sinho Chewichewisinho.github.io
- A Simplified Overview of Langevin Dynamicsfriedmanroy.github.io
- Gregory Gundersengregorygundersen.com
- [2505.02621] Mirror Mean-Field Langevin Dynamicsarxiv.org
- Step-by-Step Diffusion: An Elementary Tutorialarxiv.org
- Law of large numbers - Wikipediaen.wikipedia.org
- Competing with sampling — Alignment Research Centeralignment.org
- High-Dimensional Gaussian Sampling: A Review and a Unifying Approach Based on a Stochastic Proximal Point Algorithmarxiv.org
- survey.dvimath.uchicago.edu
- Sampling: Two Basic Algorithmsgregorygundersen.com
- Keep the gradient flowingfa.bianp.net
- ARC progress update: Competing with sampling — LessWronglesswrong.com