Fetching the paper…
Reading the bibliography…
We study the problem of sampling from a distribution $p^*(x) \propto \exp\left(-U(x)\right)$, where the function $U$ is $L$-smooth everywhere and $m$-strongly convex outside a ball of radius $R$, but potentially nonconvex inside this ball.
Note on the derivatives with respect to a parameter of the solutions of a system of differential equations
Thomas H. Gronwall · 1919
Earlier work this paper cites.
Brownian motion in a field of force and the diffusion model of chemical reactions
Hendrik A. Kramers · 1940
Earlier work this paper cites.
Some methods of speeding up the convergence of iteration methods
Boris T Polyak · 1964
Earlier work this paper cites.
Correlation functions and computer simulations
Giorgio Parisi · 1981
Earlier work this paper cites.
A method of solving a convex programming problem with convergence rate 𝒪 ( 1 / k 2 ) \mathcal{O}(1/k^{2})
Yurii Nesterov · 1983
Earlier work this paper cites.
Recursive stochastic algorithms for global optimization in ℝ d \mathbb{R}^{d}
Saul B. Gelfand and Sanjoy K. Mitter · 1991
Earlier work this paper cites.
Exponential convergence of Langevin distributions and their discrete approximations
Gareth Roberts and Richard Tweedie · 1996
Earlier work this paper cites.
Determinants of block matrices
John R Silvester · 2000
Earlier work this paper cites.
Isotropic hypoellipticity and trend to the equilibrium for the Fokker-Planck equation with high degree potential
Frédéric Hérau · 2002
Earlier work this paper cites.
Some Gronwall Type Inequalities and Applications
Sever S. Dragomir · 2003
Earlier work this paper cites.
Stochastic differential equations
Philip E. Protter · 2005
Earlier work this paper cites.
Prediction, Learning, and Games
Nicolo Cèsa-Bianchi and Gábor Lugosi · 2006
Earlier work this paper cites.
Optimal Transport: Old and New
Cédric Villani · 2008
Earlier work this paper cites.
Hypocoercivity
Cédric Villani · 2009
Earlier work this paper cites.
Trend to equilibrium and particle approximation for a weakly self-consistent Vlasov-Fokker-Planck equation
Francois Bolley, Arnaud Guillin, and Florent Malrieu · 2010
Earlier work this paper cites.
Brownian Motion
Peter Mörters and Yuval Peres · 2010
Earlier work this paper cites.
Lecture notes: Introduction to online optimization, 2011
Sébastien Bubeck · 2011
Earlier work this paper cites.
MCMC using Hamiltonian dynamics
Radford M. Neal · 2011
Earlier work this paper cites.
Exponential convergence to equilibrium for kinetic Fokker-Planck equations
Simone Calogero · 2012
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.
Online learning in Markov decision processes with adversarially chosen transition probability distributions
Yasin Abbasi, Peter L. Bartlett, Varun Kanade, Yevgeny Seldin, and Csaba Szepesvári · 2013
Cited alongside, same era.
Stochastic Differential Equations: An Introduction with Wpplications
Bernt Øksendal · 2013
Cited alongside, same era.
Monte Carlo Statistical Methods
Christian Robert and George Casella · 2013
Cited alongside, same era.
Exponential stability of slowly decaying solutions to the kinetic Fokker-Planck equation
Convergence of Langevin MCMC in KL-divergence
Xiang Cheng and Peter Bartlett · 2017
Later among the works it cites.
Underdamped Langevin MCMC: A non-asymptotic analysis
Xiang Cheng, Niladri S. Chatterji, Peter L. Bartlett, and Michael I. Jordan · 2017
Later among the works it cites.
Theoretical guarantees for approximate sampling from smooth and log-concave densities
Arnak S. Dalalyan · 2017
Later among the works it cites.
User-friendly guarantees for the Langevin Monte Carlo with inaccurate gradient
Arnak S. Dalalyan and Avetik G. Karagulyan · 2017
Later among the works it cites.
Nonasymptotic convergence analysis for the unadjusted Langevin algorithm
Alain Durmus and Eric Moulines · 2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Stéphane Mischler and Clément Mouhot · 2014
Cited alongside, same era.
A differential equation for modeling Nesterov’s accelerated gradient method: Theory and insights
Weijie Su, Stephen Boyd, and Emmanuel Candès · 2014
Cited alongside, same era.
Hypocoercivity for linear kinetic equations conserving mass
Jean Dolbeault, Clément Mouhot, and Christian Schmeiser · 2015
Cited alongside, same era.
Accelerated mirror descent in continuous and discrete time
Walid Krichene, Alexandre Bayen, and Peter Bartlett · 2015
Cited alongside, same era.
A complete recipe for stochastic gradient MCMC
Yi-An Ma, Tianqi Chen, and Emily Fox · 2015
Cited alongside, same era.
Wasserstein contraction properties for hypoelliptic diffusions
Fabrice Baudoin · 2016
Cited alongside, same era.
Sampling from strongly log-concave distributions with the Unadjusted Langevin Algorithm
Alain Durmus and Eric Moulines · 2016
Cited alongside, same era.
Couplings and quantitative contraction rates for Langevin dynamics
Andreas Eberle, Arnaud Guillin, and Raphael Zimmer · 2017
Later among the works it cites.
Rong Ge, Holden Lee, and Andrej Risteski · 2017
Later among the works it cites.
Convergence rate of Riemannian Hamiltonian Monte Carlo and faster polytope volume computation
Yin Tat Lee and Santosh Vempala · 2017
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.
Non-convex learning via stochastic gradient Langevin dynamics: A nonasymptotic analysis
Maxim Raginsky, Alexander Rakhlin, and Matus Telgarsky · 2017
Later among the works it cites.
A hitting time analysis of stochastic gradient Langevin dynamics
Yuchen Zhang, Percy Liang, and Moses Charikar · 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.
George Deligiannidis, Daniel Paulin, Alexandre Bouchard-Côté, and Arnaud Doucet · 2018
Closest in time.
Log-concave sampling: Metropolis-Hastings algorithms are fast!
Raaz Dwivedi, Yuansi Chen, Martin Wainwright, and Bin Yu · 2018
Closest in time.
Dimensionally tight running time bounds for second-order Hamiltonian Monte Carlo
Oren Mangoubi and Nisheeth K Vishnoi · 2018
Closest in time.
Global convergence of Langevin dynamics based algorithms for nonconvex optimization
Pan Xu, Jinghui Chen, Difan Zou, and Quanquan Gu · 2018
Closest in time.
Quantitative contraction rates for markov chains on general state spaces
Andreas Eberle, Mateusz B Majka, et al · 2019
Closest in time.