Fetching the paper…
Reading the bibliography…
We study the Proximal Langevin Algorithm (PLA) for sampling from a probability distribution $\nu = e^{-f}$ on $\mathbb{R}^n$ under isoperimetry.
On measures of entropy and information
Alfréd Rényi et al · 1961
Earlier work this paper cites.
Diffusion on compact Riemannian manifolds and logarithmic Sobolev inequalities
OS Rothaus · 1981
Earlier work this paper cites.
Diffusions hypercontractives
Dominique Bakry and Michel Émery · 1985
Earlier work this paper cites.
Time’s Arrow: The Origins of Thermodynamics Behavior
Michael C. Mackey · 1992
Earlier work this paper cites.
A simple analytic proof of an inequality by P. Buser
M. Ledoux · 1994
Earlier work this paper cites.
Generalized cutoff rates and Rényi’s information measures
Imre Csiszár · 1995
Earlier work this paper cites.
Random walks and an
R. Kannan, L. Lovász, and M. Simonovits · 1997
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.
Rényi statistics in directed families of exponential experiments
D Morales, L Pardo, and I Vajda · 2000
Earlier work this paper cites.
Generalization of an inequality by Talagrand and links with the logarithmic Sobolev inequality
Felix Otto and Cédric Villani · 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
Cédric Villani · 2003
Earlier work this paper cites.
Fast algorithms for logconcave functions: sampling, rounding, integration and optimization
L. Lovász and S. Vempala · 2006
Earlier work this paper cites.
Hit-and-run from a corner
László Lovász and Santosh S. Vempala · 2006
Earlier work this paper cites.
The geometry of logconcave functions and sampling algorithms
L. Lovász and S. Vempala · 2007
Earlier work this paper cites.
Nonasymptotic mixing of the MALA algorithm
Nawaf Bou-Rabee and Martin Hairer · 2013
Earlier work this paper cites.
Rényi divergence and Kullback-Leibler divergence
Tim Van Erven and Peter Harremos · 2014
Earlier work this paper cites.
A complete recipe for stochastic gradient MCMC
Yi-An Ma, Tianqi Chen, and Emily Fox · 2015
Earlier work this paper cites.
Deep learning with differential privacy
Martin Abadi, Andy Chu, Ian Goodfellow, H Brendan McMahan, Ilya Mironov, Kunal Talwar, and Li Zhang · 2016
Earlier work this paper cites.
Concentrated differential privacy
Cynthia Dwork and Guy N Rothblum · 2016
Cited alongside, same era.
Proximal Markov chain Monte Carlo algorithms
Marcelo Pereyra · 2016
Cited alongside, same era.
Sampling from a log-concave distribution with compact support with proximal Langevin Monte Carlo
Nicolas Brosse, Alain Durmus, Éric Moulines, and Marcelo Pereyra · 2017
Cited alongside, same era.
Further and stronger analogy between sampling and optimization: Langevin Monte Carlo and gradient descent
Arnak Dalalyan · 2017
Cited alongside, same era.
Theoretical guarantees for approximate sampling from smooth and log-concave densities
Arnak S Dalalyan · 2017
Cited alongside, same era.
Nonasymptotic convergence analysis for the unadjusted Langevin algorithm
Passty Langevin
Pascal Bianchi, Adil Salim, and Sholom Schechtman · 2019
Closest in time.
Rényi divergence and the central limit theorem
SG Bobkov, GP Chistyakov, and Friedrich Götze · 2019
Closest in time.
Optimal convergence rate of Hamiltonian Monte Carlo for strongly logconcave distributions
Zongchen Chen and Santosh S. Vempala · 2019
Closest in time.
User-friendly guarantees for the Langevin Monte Carlo with inaccurate gradient
Arnak S Dalalyan and Avetik Karagulyan · 2019
Closest in time.
Analysis of Langevin Monte Carlo via convex optimization
Alain Durmus and Szymon Majewski · 2019
Closest in time.
Implicit Langevin algorithms for sampling from log-concave densities
Liam Hodgkinson, Robert Salomone, and Fred Roosta · 2019
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Alain Durmus and Éric Moulines · 2017
Cited alongside, same era.
Rapid mixing of Hamiltonian Monte Carlo on strongly log-concave distributions
Oren Mangoubi and Aaron Smith · 2017
Cited alongside, same era.
Rényi differential privacy
Ilya Mironov · 2017
Cited alongside, same era.
Information and estimation in Fokker-Planck channels
Andre Wibisono, Varun Jog, and Po-Ling Loh · 2017
Cited alongside, same era.
Langevin Monte Carlo and JKO splitting
Espen Bernton · 2018
Cited alongside, same era.
Uncertainty quantification for radio interferometric imaging – I. Proximal MCMC methods
Xiaohao Cai, Marcelo Pereyra, and Jason D McEwen · 2018
Cited alongside, same era.
Exponential decay of Rényi divergence under Fokker–Planck equations
Yu Cao, Jianfeng Lu, and Yulong Lu · 2018
Cited alongside, same era.
Closest in time.
Stochastic Runge–Kutta accelerates Langevin Monte Carlo and beyond
Xuechen Li, Denny Wu, Lester Mackey, and Murat A Erdogdu · 2019
Closest in time.
Is there an analog of Nesterov acceleration for MCMC?
Yi-An Ma, Niladri Chatterji, Xiang Cheng, Nicolas Flammarion, Peter Bartlett, and Michael I Jordan · 2019
Closest in time.
Nonconvex sampling with the Metropolis-adjusted Langevin algorithm
Oren Mangoubi and Nisheeth K. Vishnoi · 2019
Closest in time.
Preconditioned P-ULA for joint deconvolution-segmentation of ultrasound images – extended version
Corbineau Marie-Caroline, Kouamé Denis, Chouzenoux Emilie, Tourneret Jean-Yves, and Pesquet Jean-Christophe · 2019
Closest in time.
An efficient sampling algorithm for non-smooth composite potentials
Wenlong Mou, Nicolas Flammarion, Martin J. Wainwright, and Peter L. Bartlett · 2019
Closest in time.
Improved bounds for discretization of Langevin diffusions: Near-optimal rates without convexity
Wenlong Mou, Nicolas Flammarion, Martin J. Wainwright, and Peter L. Bartlett · 2019
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 · 2019
Closest in time.
Scalable Bayesian uncertainty quantification in imaging inverse problems via convex optimization
Audrey Repetti, Marcelo Pereyra, and Yves Wiaux · 2019
Closest in time.
Stochastic proximal Langevin algorithm: Potential splitting and nonasymptotic rates
Adil Salim, Dmitry Kovalev, and Peter Richtárik · 2019
Closest in time.
The randomized midpoint method for log-concave sampling
Ruoqi Shen and Yin Tat Lee · 2019
Closest in time.
Accelerating proximal Markov chain Monte Carlo by using explicit stabilised methods
Luis Vargas, Marcelo Pereyra, and Konstantinos Zygalakis · 2019
Closest in time.
Rapid convergence of the Unadjusted Langevin Algorithm: Isoperimetry suffices
Santosh Vempala and Andre Wibisono · 2019
Closest in time.