Fetching the paper…
Reading the bibliography…
Conventional wisdom in the sampling literature, backed by a popular diffusion scaling limit, suggests that the mixing time of the Metropolis-Adjusted Langevin Algorithm (MALA) scales as $O(d^{1/3})$, where $d$ is the dimension.
Equation of state calculations by fast computing machines
Nicholas Metropolis, Arianna W. Rosenbluth, Marshall N. Rosenbluth, Augusta H. Teller, and Edward Teller · 1953
Earlier work this paper cites.
Monte Carlo sampling methods using Markov chains and their applications
Wilfred K. Hastings · 1970
Earlier work this paper cites.
Distribution function inequalities for martingales
Donald L. Burkholder · 1973
Earlier work this paper cites.
On the L p L^{p} norms of stochastic integrals and other martingales
Burgess Davis · 1976
Earlier work this paper cites.
Bounds on the L 2 L^{2} spectrum for Markov chains and Markov processes: a generalization of Cheeger’s inequality
Gregory F. Lawler and Alan D. Sokal · 1988
Earlier work this paper cites.
Random walks in a convex body and an improved volume algorithm
László Lovász and Miklós Simonovits · 1993
Earlier work this paper cites.
Some connections between isoperimetric and Sobolev-type inequalities
Serguei G. Bobkov and Christian Houdré · 1997
Earlier work this paper cites.
Weak convergence and optimal scaling of random walk Metropolis algorithms
Gareth O Roberts, Andrew Gelman, Walter R Gilks, et al · 1997
Earlier work this paper cites.
Multidimensional diffusion processes
Daniel W. Stroock and S. R. Srinivasa Varadhan · 1997
Earlier work this paper cites.
Brownian motion
Ioannis Karatzas and Steven E. Shreve · 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.
Monotonicity properties of optimal transportation and the FKG and related inequalities
Luis A. Caffarelli · 2000
Earlier work this paper cites.
A geometric interpretation of the Metropolis-Hastings algorithm
Louis J. Billera and Persi Diaconis · 2001
Earlier work this paper cites.
Topics in optimal transportation , volume 58 of Graduate Studies in Mathematics
Cédric Villani · 2003
Earlier work this paper cites.
Introduction to nonparametric estimation
Alexandre B. Tsybakov · 2004
Cited alongside, same era.
Monte Carlo strategies in scientific computing
Jun S. Liu · 2008
Cited alongside, same era.
Sparse regression learning by aggregation and Langevin Monte-Carlo
Arnak S. Dalalyan and Alexandre B. Tsybakov · 2012
Cited alongside, same era.
Optimal scaling and diffusion limits for the Langevin algorithm in high dimensions
Natesh S. Pillai, Andrew M. Stuart, and Alexandre H. Thiéry · 2012
Cited alongside, same era.
Monte Carlo statistical methods
Christian Robert and George Casella · 2013
Cited alongside, same era.
Analysis and geometry of Markov diffusion operators , volume 348 of Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences]
Dominique Bakry, Ivan Gentil, and Michel Ledoux · 2014
Lectures on convex optimization , volume 137
Yurii Nesterov · 2018
Later among the works it cites.
Elements of stochastic calculus and analysis
Daniel W. Stroock · 2018
Later among the works it cites.
High-dimensional probability , volume 47 of Cambridge Series in Statistical and Probabilistic Mathematics
Roman Vershynin · 2018
Later among the works it cites.
Bounding the error of discretized Langevin algorithms for non-strongly log-concave targets
Arnak S. Dalalyan, Avetik Karagulyan, and Lionel Riou-Durand · 2019
Later among the works it cites.
Log-concave sampling: Metropolis-Hastings algorithms are fast
Raaz Dwivedi, Yuansi Chen, Martin J. Wainwright, and Bin Yu · 2019
Later among the works it cites.
Nonconvex sampling with the Metropolis-adjusted Langevin algorithm
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Spectral gaps for a Metropolis–Hastings algorithm in infinite dimensions
Martin Hairer, Andrew M. Stuart, and Sebastian J. Vollmer · 2014
Cited alongside, same era.
Convex optimization: algorithms and complexity
Sébastien Bubeck · 2015
Cited alongside, same era.
Brownian motion, martingales, and stochastic calculus , volume 274 of Graduate Texts in Mathematics
Jean-François Le Gall · 2016
Cited alongside, same era.
Probability in high dimension, 2016
Ramon van Handel · 2016
Cited alongside, same era.
Theoretical guarantees for approximate sampling from smooth and log-concave densities
Arnak S. Dalalyan · 2017
Cited alongside, same era.
Underdamped Langevin MCMC: A non-asymptotic analysis
Xiang Cheng, Niladri S. Chatterji, Peter L. Bartlett, and Michael I. Jordan · 2018
Cited alongside, same era.
Oren Mangoubi and Nisheeth K. Vishnoi · 2019
Later among the works it cites.
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.
Martin J. Wainwright · 2019
Later among the works it cites.
Fast mixing of Metropolized Hamiltonian Monte Carlo: benefits of multi-step gradients
Yuansi Chen, Raaz Dwivedi, Martin J. Wainwright, and Bin Yu · 2020
Closest in time.
A proof of the Caffarelli contraction theorem via entropic regularization
Max Fathi, Nathael Gozlan, and Maxime Prod’homme · 2020
Closest in time.
Faster differentially private samplers via Rényi divergence analysis of discretized Langevin MCMC
Arun Ganesh and Kunal Talwar · 2020
Closest in time.
High-order Langevin diffusion yields an accelerated MCMC algorithm, 2020
Wenlong Mou, Yi-An Ma, Martin J. Wainwright, Peter L. Bartlett, and Michael I. Jordan · 2020
Closest in time.