Fetching the paper…
Reading the bibliography…
We consider the problem of sampling from a strongly log-concave density in $\mathbb{R}^d$, and prove a non-asymptotic upper bound on the mixing time of the Metropolis-adjusted Langevin algorithm (MALA).
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
W Keith Hastings · 1970
Earlier work this paper cites.
Correlation functions and computer simulations
G Parisi · 1981
Earlier work this paper cites.
The mixing rate of Markov chains, an isoperimetric inequality, and computing the volume
László Lovász and Miklós Simonovits · 1990
Earlier work this paper cites.
Expansion of the global error for numerical schemes solving stochastic differential equations
Denis Talay and Luciano Tubaro · 1990
Earlier work this paper cites.
Elements of Information Theory
T.M. Cover and J.A. Thomas · 1991
Earlier work this paper cites.
A random polynomial-time algorithm for approximating the volume of convex bodies
Martin Dyer, Alan Frieze, and Ravi Kannan · 1991
Earlier work this paper cites.
Hit-and-run algorithms for generating multivariate distributions
Claude JP Bélisle, H Edwin Romeijn, and Robert L Smith · 1993
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.
Sampling from log-concave distributions
Alan Frieze, Ravi Kannan, and Nick Polson · 1994
Earlier work this paper cites.
Representations of knowledge in complex systems
Ulf Grenander and Michael I Miller · 1994
Earlier work this paper cites.
Computable bounds for geometric convergence rates of Markov chains
Sean P Meyn and Robert L Tweedie · 1994
Earlier work this paper cites.
Isoperimetric problems for convex bodies and a localization lemma
Ravi Kannan, László Lovász, and Miklós Simonovits · 1995
Earlier work this paper cites.
Rates of convergence of the Hastings and Metropolis algorithms
Kerrie L Mengersen, Richard L Tweedie, et al · 1996
Earlier work this paper cites.
On Markov chains with continuous state space
Persi Diaconis and David Freedman · 1997
Earlier work this paper cites.
Hit-and-run mixes fast
László Lovász · 1999
Earlier work this paper cites.
Geometric ergodicity of Metropolis algorithms
Søren Fiig Jarner and Ernst Hansen · 2000
Earlier work this paper cites.
Optimal scaling for various Metropolis-Hastings algorithms
Gareth O Roberts and Jeffrey S Rosenthal · 2001
Cited alongside, same era.
Langevin diffusions and Metropolis-Hastings algorithms
Gareth O Roberts and Osnat Stramer · 2002
Cited alongside, same era.
Convex Optimization
Stephen Boyd and Lieven Vandenberghe · 2004
Cited alongside, same era.
A convex/log-concave correlation inequality for Gaussian measure and an application to abstract Wiener spaces
Gilles Hargé · 2004
Cited alongside, same era.
Monte Carlo methods
Christian P Robert · 2004
Cited alongside, same era.
General state space Markov chains and MCMC algorithms
Gareth O Roberts, Jeffrey S Rosenthal, et al · 2004
Cited alongside, same era.
Complexity bounds for MCMC via diffusion limits
Gareth O Roberts and Jeffrey S Rosenthal · 2014
Later among the works it cites.
Langevin diffusions and the Metropolis-adjusted Langevin algorithm
Tatiana Xifara, Chris Sherlock, Samuel Livingstone, Simon Byrne, and Mark Girolami · 2014
Later among the works it cites.
Convex optimization: algorithms and complexity
Sébastien Bubeck · 2015
Later among the works it cites.
Theoretical guarantees for approximate sampling from smooth and log-concave densities
Arnak S Dalalyan · 2016
Later among the works it cites.
Randomized interior point methods for sampling and optimization
Hariharan Narayanan · 2016
Later among the works it cites.
Proximal Markov chain Monte Carlo algorithms
Marcelo Pereyra · 2016
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Santosh Vempala · 2005
Cited alongside, same era.
Hit-and-run from a corner
László Lovász and Santosh Vempala · 2006
Cited alongside, same era.
The geometry of logconcave functions and sampling algorithms
László Lovász and Santosh Vempala · 2007
Cited alongside, same era.
Handbook of Markov Chain Monte Carlo
Steve Brooks, Andrew Gelman, Galin L Jones, and Xiao-Li Meng · 2011
Cited alongside, same era.
MCMC using Hamiltonian dynamics
Radford M Neal · 2011
Cited alongside, same era.
Nonasymptotic mixing of the MALA algorithm
Nawaf Bou-Rabee and Martin Hairer · 2012
Cited alongside, same era.
Later among the works it cites.
Rapid mixing of Hamiltonian Monte Carlo on strongly log-concave distributions
Oren Mangoubi and Aaron Smith · 2017
Later among the works it cites.
Coupling and convergence for Hamiltonian Monte Carlo
Nawaf Bou-Rabee, Andreas Eberle, and Raphael Zimmer · 2018
Closest in time.
Sampling from a log-concave distribution with projected Langevin Monte Carlo
Sébastien Bubeck, Ronen Eldan, and Joseph Lehec · 2018
Closest in time.
Fast MCMC sampling algorithms on polytopes
Yuansi Chen, Raaz Dwivedi, Martin J Wainwright, and Bin Yu · 2018
Closest in time.
Convergence of Langevin MCMC in KL-divergence
Xiang Cheng and Peter L Bartlett · 2018
Closest in time.
Underdamped Langevin MCMC: A non-asymptotic analysis
Xiang Cheng, Niladri S Chatterji, Peter L Bartlett, and Michael I Jordan · 2018
Closest in time.
Efficient Bayesian computation by proximal Markov chain Monte Carlo: when Langevin meets Moreau
Alain Durmus, Eric Moulines, and Marcelo Pereyra · 2018
Closest in time.
Dimensionally tight bounds for second-order Hamiltonian Monte Carlo
Oren Mangoubi and Nisheeth Vishnoi · 2018
Closest in time.
Fast mixing of Metropolized Hamiltonian Monte Carlo: Benefits of multi-step gradients
Yuansi Chen, Raaz Dwivedi, Martin J. Wainwright, and Bin Yu · 2019
Closest in time.
High-dimensional Bayesian inference via the unadjusted Langevin algorithm
Alain Durmus, Eric Moulines, et al · 2019
Closest in time.
Couplings and quantitative contraction rates for langevin dynamics
Andreas Eberle, Arnaud Guillin, Raphael Zimmer, et al · 2019
Closest in time.