Fetching the paper…
Reading the bibliography…
Understanding the complexity of sampling from a strongly log-concave and log-smooth distribution $\pi$ on $\mathbb{R}^d$ to high accuracy is a fundamental problem, both from a practical and theoretical standpoint.
“Zufallige bewegungen (zur theorie der Brownschen bewegung)”
Andrey Kolmogoroff · 1934
Earlier work this paper cites.
“Hypoelliptic second order differential equations”
Lars Hörmander · 1967
Earlier work this paper cites.
“Logarithmic Sobolev inequalities”
Leonard Gross · 1975
Earlier work this paper cites.
“Ergodic and quasideterministic properties of finite-dimensional stochastic systems”
MM Tropper · 1977
Earlier work this paper cites.
“Numerical integration of the Langevin equation: Monte Carlo simulation”
Donald Ermak and Helen Buckholz · 1980
Earlier work this paper cites.
“Problem complexity and method efficiency in optimization”, Wiley-Interscience Series in Discrete Mathematics
Arkadii. Nemirovsky and David. Yudin · 1983
Earlier work this paper cites.
“On sampling from a log-concave density using kinetic Langevin diffusions”
Arnak. Dalalyan and Lionel Riou-Durand · 1988
Earlier work this paper cites.
“Private convex optimization via exponential mechanism”
Sivakanth Gopi, Yin Lee and Daogao Liu · 1989
Earlier work this paper cites.
“Theory of Orlicz spaces”
Malempati Rao and Zhong Ren · 1991
Earlier work this paper cites.
“Is there an analog of Nesterov acceleration for gradient-based MCMC?”
Yi-An Ma et al · 1992
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.
“Bayesian computation and stochastic systems”
Julian Besag, Peter Green, David Higdon and Kerrie Mengersen · 1995
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.
“The variational formulation of the Fokker–Planck equation”
Richard Jordan, David Kinderlehrer and Felix Otto · 1998
Earlier work this paper cites.
“Optimal scaling of discrete approximations to Langevin diffusions”
Gareth. Roberts and Jeffrey. Rosenthal · 1998
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.
“Mechanism design via differential privacy”
Frank McSherry and Kunal Talwar · 2007
Earlier work this paper cites.
“Hypocoercivity for kinetic equations with linear relaxation terms”
Jean Dolbeault, Clément Mouhot and Christian Schmeiser · 2009
Earlier work this paper cites.
“Hypocoercivity”
Cédric Villani · 2009
Earlier work this paper cites.
“Optimal transport: old and new”
Cédric Villani · 2009
Earlier work this paper cites.
“MCMC using Hamiltonian dynamics”
Radford Neal · 2011
Earlier work this paper cites.
“Generalized Orlicz spaces and Wasserstein distances for convex-concave scale functions”
Karl-Theodor Sturm · 2011
Earlier work this paper cites.
“Concentration inequalities” A nonasymptotic theory of independence, With a foreword by Michel Ledoux
Stéphane Boucheron, Gábor Lugosi and Pascal Massart · 2013
Earlier work this paper cites.
“Analysis and geometry of Markov diffusion operators”
Dominique Bakry, Ivan Gentil and Michel Ledoux · 2014
Earlier work this paper cites.
“The algorithmic foundations of differential privacy.”
Cynthia Dwork and Aaron Roth · 2014
Earlier work this paper cites.
“Rényi divergence and Kullback–Leibler divergence”
Tim Van and Peter Harremos · 2014
Earlier work this paper cites.
“Approaching the Kannan–Lovász–Simonovits and variance conjectures”
David Alonso-Gutiérrez and Jesús Bastero · 2015
Earlier work this paper cites.
“Un-regularizing: approximate proximal point and faster stochastic algorithms for empirical risk minimization”
Roy Frostig, Rong Ge, Sham Kakade and Aaron Sidford · 2015
Earlier work this paper cites.
“Stan: a probabilistic programming language for Bayesian inference and optimization”
Andrew Gelman, Daniel Lee and Jiqiang Guo · 2015
Earlier work this paper cites.
“A universal catalyst for first-order optimization”
Hongzhou Lin, Julien Mairal and Zaid Harchaoui · 2015
Earlier work this paper cites.
“Deep learning with differential privacy”
Martin Abadi et al · 2016
Earlier work this paper cites.
“TensorFlow: a system for large-scale machine learning”
Martı́n Abadi et al · 2016
Earlier work this paper cites.
“Concentrated differential privacy”
Cynthia Dwork and Guy Rothblum · 2016
Cited alongside, same era.
“Brownian motion, martingales, and stochastic calculus”
Jean-François Le · 2016
Cited alongside, same era.
“Bakry–Émery meet Villani”
Fabrice Baudoin · 2017
Cited alongside, same era.
“On interpolation and curvature via Wasserstein geodesics”
Martin Kell · 2017
Cited alongside, same era.
“Rényi differential privacy”
Ilya Mironov · 2017
Cited alongside, same era.
“Underdamped Langevin MCMC: a non-asymptotic analysis”
Xiang Cheng, Niladri Chatterji, Peter Bartlett and Michael Jordan · 2018
Cited alongside, same era.
“Differential privacy dynamics of Langevin diffusion and noisy gradient descent”
Rishav Chourasia, Jiayuan Ye and Reza Shokri · 2021
Later among the works it cites.
“The shifted ODE method for underdamped Langevin MCMC”
James Foster, Terry Lyons and Harald Oberhauser · 2021
Later among the works it cites.
“Spectral monotonicity under Gaussian convolution”
Bo’az Klartag and Eli Putterman · 2021
Later among the works it cites.
“Lower bounds on Metropolized sampling methods for well-conditioned distributions”
Yin Lee, Ruoqi Shen and Kevin Tian · 2021
Later among the works it cites.
“Structured logconcave sampling with a restricted Gaussian oracle”
Yin Lee, Ruoqi Shen and Kevin Tian · 2021
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
“Log-concave sampling: Metropolis–Hastings algorithms are fast!”
Raaz Dwivedi, Yuansi Chen, Martin Wainwright and Bin Yu · 2018
Cited alongside, same era.
“Privacy amplification by iteration”
Vitaly Feldman, Ilya Mironov, Kunal Talwar and Abhradeep Thakurta · 2018
Cited alongside, same era.
“Lectures on convex optimization”
Yurii Nesterov · 2018
Cited alongside, same era.
“Spectral methods for Langevin dynamics and associated error estimates”
Julien Roussel and Gabriel Stoltz · 2018
Cited alongside, same era.
“Auxiliary gradient-based sampling algorithms”
Michalis. Titsias and Omiros Papaspiliopoulos · 2018
Cited alongside, same era.
“High-dimensional probability: an introduction with applications in data science”
Roman Vershynin · 2018
Cited alongside, same era.
Jiaming Liang and Yongxin Chen · 2021
Later among the works it cites.
“High-dimensional MCMC with a standard splitting scheme for the underdamped Langevin diffusion.”
Pierre Monmarché · 2021
Later among the works it cites.
“Privacy amplification via iteration for shuffled and online PNSGD”
Matteo Sordello, Zhiqi Bu and Jinshuo Dong · 2021
Later among the works it cites.
“Privacy of noisy stochastic gradient descent: more iterations without more privacy loss”
Jason. Altschuler and Kunal Talwar · 2022
Later among the works it cites.
Jason. Altschuler and Kunal Talwar · 2022
Later among the works it cites.
“Unadjusted Hamiltonian MCMC with stratified Monte Carlo time integration”
Nawaf Bou-Rabee and Milo Marsden · 2022
Later among the works it cites.
“Improved analysis for a proximal algorithm for sampling”
Yongxin Chen, Sinho Chewi, Adil Salim and Andre Wibisono · 2022
Later among the works it cites.
“Localization schemes: a framework for proving mixing bounds for Markov chains”
Yuansi Chen and Ronen Eldan · 2022
Later among the works it cites.
“Analysis of Langevin Monte Carlo from Poincaré to log-Sobolev”
Sinho Chewi et al · 2022
Later among the works it cites.
“Introduction to algorithms”
Thomas Cormen, Charles Leiserson, Ronald Rivest and Clifford Stein · 2022
Later among the works it cites.
“Bounding the error of discretized Langevin algorithms for non-strongly log-concave targets”
Arnak. Dalalyan, Avetik Karagulyan and Lionel Riou-Durand · 2022
Later among the works it cites.
“Convergence of Langevin Monte Carlo in chi-squared and Rényi divergence”
Murat. Erdogdu, Rasa Hosseinzadeh and Shunshi Zhang · 2022
Later among the works it cites.
“Bourgain’s slicing problem and KLS isoperimetry up to polylog”
Bo’az Klartag and Joseph Lehec · 2022
Later among the works it cites.
“A proximal algorithm for sampling”
Jiaming Liang and Yongxin Chen · 2022
Later among the works it cites.
“A proximal algorithm for sampling from non-convex potentials”
Jiaming Liang and Yongxin Chen · 2022
Later among the works it cites.
“Complexity of zigzag sampling algorithm for strongly log-concave distributions”
Jianfeng Lu and Lihan Wang · 2022
Later among the works it cites.
“Differential privacy guarantees for stochastic gradient Langevin dynamics” arXiv:2201.11980, 2022
Theo Ryffel, Francis Bach and David Pointcheval · 2022
Later among the works it cites.
“Minimax mixing time of the Metropolis-adjusted Langevin algorithm for log-concave sampling”
Keru Wu, Scott Schmidler and Yuansi Chen · 2022
Later among the works it cites.
Jiayuan Ye and Reza Shokri · 2022
Later among the works it cites.
“Sampling is as easy as learning the score: theory for diffusion models with minimal data assumptions”
Sitan Chen et al · 2023
Closest in time.
“Log-concave sampling” Draft available at
Sinho Chewi · 2023
Closest in time.
“Improved dimension dependence of a proximal algorithm for sampling” Forthcoming, 2023
Jiaojiao Fan, Bo Yuan and Yongxin Chen · 2023
Closest in time.
“Algorithmic aspects of the log-Laplace transform and a non-Euclidean proximal sampler”
Sivakanth Gopi et al · 2023
Closest in time.
“Private convex optimization in general norms”
Sivakanth Gopi et al · 2023
Closest in time.
“On excess mass behavior in Gaussian mixture models with Orlicz–Wasserstein distances”
Aritra Guha, Nhat Ho and XuanLong Nguyen · 2023
Closest in time.
“Improved discretization analysis for underdamped Langevin Monte Carlo”
Matthew Zhang et al · 2023
Closest in time.
“Sampling as optimization in the space of measures: the Langevin dynamics as a composite optimization problem”
Andre Wibisono · 2093
Closest in time.