Fetching the paper…
Reading the bibliography…
This article considers the popular MCMC method of unadjusted Langevin Monte Carlo (LMC) and provides a non-asymptotic analysis of its sampling error in 2-Wasserstein distance.
The maximum rate of convergence of discrete approximations for stochastic differential equations
John MC Clark and RJ Cameron · 1980
Earlier work this paper cites.
Numerical treatment of stochastic differential equations
W Rüemelin · 1982
Earlier work this paper cites.
Numerical solution of stochastic differential equations
Peter E Kloeden and Eckhard Platen · 1992
Earlier work this paper cites.
Exponential convergence of langevin distributions and their discrete approximations
Gareth O Roberts, Richard L Tweedie, et al · 1996
Earlier work this paper cites.
The variational formulation of the fokker–planck equation
Richard Jordan, David Kinderlehrer, and Felix Otto · 1998
Earlier work this paper cites.
Optimal scaling of discrete approximations to langevin diffusions
Gareth O Roberts and Jeffrey S Rosenthal · 1998
Earlier work this paper cites.
An introduction to mcmc for machine learning
Christophe Andrieu, Nando De Freitas, Arnaud Doucet, and Michael I Jordan · 2003
Earlier work this paper cites.
Monte Carlo strategies in scientific computing
Jun S Liu · 2008
Earlier work this paper cites.
Runge–kutta methods for the strong approximation of solutions of stochastic differential equations
Andreas Rößler · 2010
Earlier work this paper cites.
Stochastic numerics for mathematical physics
Grigori Noah Milstein and Michael V Tretyakov · 2013
Earlier work this paper cites.
Monte Carlo statistical methods
Christian Robert and George Casella · 2013
Earlier work this paper cites.
Stochastic processes and applications: diffusion processes, the Fokker-Planck and Langevin equations , volume 60
Grigorios A Pavliotis · 2014
Earlier work this paper cites.
Tensorflow: A system for large-scale machine learning
Martin Abadi, Paul Barham, Jianmin Chen, Zhifeng Chen, Andy Davis, Jeffrey Dean, Matthieu Devin, Sanjay Ghemawat, Geoffrey Irving, Michael Isard, Manjunath Kudlur, Josh Levenberg, Rajat Monga, Sherry Moore, Derek G. Murray, Benoit Steiner, Paul Tucker, Vijay Vasudevan, Pete Warden, Martin Wicke, Yuan Yu, and Xiaoqiang Zheng · 2016
Earlier work this paper cites.
Stein variational gradient descent: A general purpose bayesian inference algorithm
Qiang Liu and Dilin Wang · 2016
Cited alongside, same era.
The Bayesian Approach to Inverse Problems , pp. 311–428
Masoumeh Dashti and Andrew M. Stuart · 2017
Cited alongside, same era.
Nonasymptotic convergence analysis for the unadjusted langevin algorithm
Alain Durmus and Eric Moulines · 2017
Cited alongside, same era.
Stochastic gradient descent as approximate bayesian inference
Stephan Mandt, Matthew D Hoffman, and David M Blei · 2017
Cited alongside, same era.
A unified particle-optimization framework for scalable bayesian sampling
Changyou Chen, Ruiyi Zhang, Wenlin Wang, Bai Li, and Liqun Chen · 2018
Cited alongside, same era.
Convergence of langevin mcmc in kl-divergence
Xiang Cheng and Peter L Bartlett · 2018
Cited alongside, same era.
Improved bounds for discretization of langevin diffusions: Near-optimal rates without convexity
Wenlong Mou, Nicolas Flammarion, Martin J Wainwright, and Peter L Bartlett · 2019
Later among the works it cites.
The randomized midpoint method for log-concave sampling
Ruoqi Shen and Yin Tat Lee · 2019
Later among the works it cites.
Rapid convergence of the unadjusted langevin algorithm: Isoperimetry suffices
Santosh Vempala and Andre Wibisono · 2019
Later among the works it cites.
On sampling from a log-concave density using kinetic Langevin diffusions
Arnak S Dalalyan and Lionel Riou-Durand · 2020
Later among the works it cites.
Approximate inference with wasserstein gradient flows
Charlie Frogner and Tomaso Poggio · 2020
Later among the works it cites.
Hessian-free high-resolution nesterov acceleration for sampling
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
On the global convergence of gradient descent for over-parameterized models using optimal transport
Lenaic Chizat and Francis Bach · 2018
Cited alongside, same era.
Sampling as optimization in the space of measures: The langevin dynamics as a composite optimization problem
Andre Wibisono · 2018
Cited alongside, same era.
Policy optimization as wasserstein gradient flows
Ruiyi Zhang, Changyou Chen, Chunyuan Li, and Lawrence Carin · 2018
Cited alongside, same era.
High-dimensional bayesian inference via the unadjusted langevin algorithm
Alain Durmus and Eric Moulines · 2019
Cited alongside, same era.
Analysis of langevin monte carlo via convex optimization
Alain Durmus, Szymon Majewski, and Blazej Miasojedow · 2019
Cited alongside, same era.
Stochastic Runge-Kutta accelerates Langevin Monte Carlo and beyond
Xuechen Li, Denny Wu, Lester Mackey, and Murat A Erdogdu · 2019
Cited alongside, same era.
Ruilin Li, Hongyuan Zha, and Molei Tao · 2020
Later among the works it cites.
Optimal dimension dependence of the metropolis-adjusted langevin algorithm
Sinho Chewi, Chen Lu, Kwangjun Ahn, Xiang Cheng, Thibaut Le Gouic, and Philippe Rigollet · 2021
Closest in time.
On the convergence of langevin monte carlo: The interplay between tail growth and smoothness
Murat A Erdogdu and Rasa Hosseinzadeh · 2021
Closest in time.
The langevin monte carlo algorithm in the non-smooth log-concave case
Joseph Lehec · 2021
Closest in time.
The mirror langevin algorithm converges with vanishing bias
Ruilin Li, Molei Tao, Santosh S Vempala, and Andre Wibisono · 2021
Closest in time.
Is there an analog of Nesterov acceleration for gradient-based MCMC?
Yi-An Ma, Niladri S. Chatterji, Xiang Cheng, Nicolas Flammarion, Peter L. Bartlett, and Michael I. Jordan · 2021
Closest in time.
High-order langevin diffusion yields an accelerated mcmc algorithm
Wenlong Mou, Yi-An Ma, Martin J Wainwright, Peter L Bartlett, and Michael I Jordan · 2021
Closest in time.