Fetching the paper…
Reading the bibliography…
In this paper, we provide non-asymptotic upper bounds on the error of sampling from a target density using three schemes of discretized Langevin diffusions.
Über dyadische Brüche
A. Khintchine · 1923
Earlier work this paper cites.
Dynamical Theories of Brownian Motion
E. Nelson · 1967
Earlier work this paper cites.
On extensions of the brunn-minkowski and prékopa-leindler theorems, including inequalities for log concave functions, and with an application to the diffusion equation
H. J. Brascamp and E. H. Lieb · 1976
Earlier work this paper cites.
Exponential convergence of Langevin distributions and their discrete approximations
G. O. Roberts and R. L. Tweedie · 1996
Earlier work this paper cites.
Optimal scaling of discrete approximations to Langevin diffusions
G. O. Roberts and J. S. Rosenthal · 1998
Earlier work this paper cites.
Isoperimetric and analytic inequalities for log-concave probability measures
S. G. Bobkov · 1999
Earlier work this paper cites.
Inequalities for the incomplete gamma function
P. Natalini and B. Palumbo · 2000
Earlier work this paper cites.
The concentration of measure phenomenon
M. Ledoux · 2001
Earlier work this paper cites.
Langevin diffusions and Metropolis-Hastings algorithms
G. O. Roberts and O. Stramer · 2002
Earlier work this paper cites.
Quantitative bounds on convergence of time-inhomogeneous Markov chains
R. Douc, E. Moulines, and J. S. Rosenthal · 2004
Earlier work this paper cites.
A convex/log-concave correlation inequality for gaussian measure and an application to abstract Wiener spaces
G. Hargé · 2004
Earlier work this paper cites.
Weighted csiszár-kullback-pinsker inequalities and applications to transportation inequalities
F. Bolley and C. Villani · 2005
Earlier work this paper cites.
Hit-and-run from a corner
L. Lovász and S. Vempala · 2006
Earlier work this paper cites.
Fast algorithms for logconcave functions: Sampling, Rounding, Integration and Optimization
L. Lovasz and S. Vempala · 2006
Earlier work this paper cites.
Optimal transport: old and new , volume 338
C. Villani · 2008
Earlier work this paper cites.
Uniform bounds for the complementary incomplete gamma function
J. M. Borwein, O. Chan, et al · 2009
Earlier work this paper cites.
Sparse regression learning by aggregation and Langevin Monte-Carlo
A. S. Dalalyan and A. B. Tsybakov · 2009
Cited alongside, same era.
Transport inequalities. A survey
N. Gozlan and C. Léonard · 2010
Cited alongside, same era.
Bounds for the ratio of two gamma functions—from Wendel’s and related inequalities to logarithmically completely monotonic functions
F. Qi, Q.-M. Luo, et al · 2012
Cited alongside, same era.
Geometry of Isotropic Convex Bodies
A. Giannopoulos, S. Brazitikos, P. Valettas, and B.-H. Vritsiou · 2014
Cited alongside, same era.
Stochastic processes and applications , volume 60 of Texts in Applied Mathematics
G. A. Pavliotis · 2014
Cited alongside, same era.
Convex optimization: Algorithms and complexity
S. Bubeck · 2015
Cited alongside, same era.
Efficient Bayesian Computation by Proximal Markov Chain Monte-Carlo: When Langevin Meets Moreau
A. Durmus, É. Moulines, and M. Pereyra · 2018
Later among the works it cites.
Log-concave sampling: Metropolis-hastings algorithms are fast!
R. Dwivedi, Y. Chen, M. J. Wainwright, and B. Yu · 2018
Later among the works it cites.
Algorithmic Theory of ODEs and Sampling from Well-conditioned Logconcave Densities
Y. Tat Lee, Z. Song, and S. S. Vempala · 2018
Later among the works it cites.
Sampling as optimization in the space of measures: The Langevin dynamics as a composite optimization problem
A. Wibisono · 2018
Later among the works it cites.
Control variates for stochastic gradient mcmc
J. Baker, P. Fearnhead, E. B. Fox, and C. Nemeth · 2019
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Further and stronger analogy between sampling and optimization: Langevin Monte-Carlo and gradient descent
A. Dalalyan · 2017
Cited alongside, same era.
Nonasymptotic convergence analysis for the unadjusted Langevin algorithm
A. Durmus and E. Moulines · 2017
Cited alongside, same era.
Non-convex optimization for machine learning
P. Jain and P. Kar · 2017
Cited alongside, same era.
Rapid mixing of Hamiltonian Monte-Carlo on strongly log-concave distributions
O. Mangoubi and A. Smith · 2017
Cited alongside, same era.
Non-convex learning via stochastic gradient Langevin dynamics: a nonasymptotic analysis
M. Raginsky, A. Rakhlin, and M. Telgarsky · 2017
Cited alongside, same era.
Langevin Monte-Carlo and JKO splitting
E. Bernton · 2018
Cited alongside, same era.
Z. Chen and S. S. Vempala · 2019
Closest in time.
User-friendly guarantees for the Langevin Monte-Carlo with inaccurate gradient
A. S. Dalalyan and A. Karagulyan · 2019
Closest in time.
High-dimensional Bayesian inference via the unadjusted Langevin algorithm
A. Durmus and E. Moulines · 2019
Closest in time.
Analysis of Langevin Monte-Carlo via convex optimization
A. Durmus, S. Majewski, and B. Miasojedow · 2019
Closest in time.
Is there an analog of Nesterov Acceleration for MCMC?
Y.-A. Ma, N. Chatterji, X. Cheng, N. Flammarion, P. Bartlett, and M. I. Jordan · 2019
Closest in time.
Mixing of Hamiltonian Monte-Carlo on strongly log-concave distributions 2: Numerical integrators
O. Mangoubi and A. Smith · 2019
Closest in time.
Nonconvex sampling with the metropolis-adjusted Langevin algorithm
O. Mangoubi and N. K. Vishnoi · 2019
Closest in time.
Sampling from non-log-concave distributions via variance-reduced gradient Langevin dynamics
D. Zou, P. Xu, and Q. Gu · 2019
Closest in time.
Fast mixing of Metropolized Hamiltonian Monte-Carlo: Benefits of multi-step gradients
Y. Chen, R. Dwivedi, M. J. Wainwright, and B. Yu · 2020
Closest in time.
On sampling from a log-concave density using kinetic Langevin diffusions
A. S. Dalalyan and L. Riou-Durand · 2020
Closest in time.
Nonasymptotic bounds for sampling algorithms without log-concavity
M. B. Majka, A. Mijatović, and Łukasz Szpruch · 2020
Closest in time.