Fetching the paper…
Reading the bibliography…
For a $d$-dimensional log-concave distribution $\pi(\theta) \propto e^{-f(\theta)}$ constrained to a convex body $K$, the problem of outputting samples from a distribution $\nu$ which is $\varepsilon$-close in infinity-distance $\sup_{\theta \in K} |\log \frac{\nu(\theta)}{\pi(\theta)}|$ to $\pi$ arises in differentially private optimization.
On the complexity of computing the volume of a polyhedron
M. E. Dyer and A. M. Frieze · 1988
Earlier work this paper cites.
Sampling and integration of near log-concave functions
David Applegate and Ravi Kannan · 1991
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.
The variational formulation of the Fokker–Planck equation
Richard Jordan, David Kinderlehrer, and Felix Otto · 1998
Earlier work this paper cites.
Log-Sobolev inequalities and sampling from log-concave distributions
Alan Frieze and Ravi Kannan · 1999
Earlier work this paper cites.
Hit-and-run is fast and fun
László Lovász and Santosh Vempala · 2003
Earlier work this paper cites.
Practical privacy: the SuLQ framework
Avrim Blum, Cynthia Dwork, Frank McSherry, and Kobbi Nissim · 2005
Earlier work this paper cites.
Fast algorithms for logconcave functions: Sampling, rounding, integration and optimization
László Lovász and Santosh Vempala · 2006
Earlier work this paper cites.
The geometry of logconcave functions and sampling algorithms
László Lovász and Santosh Vempala · 2007
Earlier work this paper cites.
Mechanism design via differential privacy
Frank McSherry and Kunal Talwar · 2007
Earlier work this paper cites.
Optimal transport: old and new
Cédric Villani · 2009
Earlier work this paper cites.
On the geometry of differential privacy
Moritz Hardt and Kunal Talwar · 2010
Earlier work this paper cites.
An empirical evaluation of Thompson sampling
Olivier Chapelle and Lihong Li · 2011
Cited alongside, same era.
Bayesian learning via stochastic gradient Langevin dynamics
Max Welling and Yee W Teh · 2011
Cited alongside, same era.
Near-optimal differentially private principal components
Kamalika Chaudhuri, Anand Sarwate, and Kaushik Sinha · 2012
Cited alongside, same era.
Random walks on polytopes and an affine interior point method for linear programming
Ravi Kannan and Hariharan Narayanan · 2012
Cited alongside, same era.
Private empirical risk minimization: Efficient algorithms and tight error bounds
Raef Bassily, Adam Smith, and Abhradeep Thakurta · 2014
Cited alongside, same era.
The algorithmic foundations of differential privacy
Cynthia Dwork and Aaron Roth · 2014
Cited alongside, same era.
Nonasymptotic convergence analysis for the unadjusted Langevin algorithm
Alain Durmus and Eric Moulines · 2017
Later among the works it cites.
Eldan’s stochastic localization and the KLS hyperplane conjecture: An improved lower bound for expansion
Yin Tat Lee and Santosh Vempala · 2017
Later among the works it cites.
Efficient sampling from time-varying log-concave distributions
Hariharan Narayanan and Alexander Rakhlin · 2017
Later among the works it cites.
Convergence of Langevin MCMC in KL-divergence
Xiang Cheng and Peter Bartlett · 2018
Later among the works it cites.
Convergence rate of Riemannian Hamiltonian Monte Carlo and faster polytope volume computation
Yin Tat Lee and Santosh S Vempala · 2018
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Analyze gauss: optimal bounds for privacy-preserving principal component analysis
Cynthia Dwork, Kunal Talwar, Abhradeep Thakurta, and Li Zhang · 2014
Cited alongside, same era.
Finite-time analysis of projected Langevin Monte Carlo
Sebastien Bubeck, Ronen Eldan, and Joseph Lehec · 2015
Cited alongside, same era.
Randomized interior point methods for sampling and optimization
Hariharan Narayanan · 2016
Cited alongside, same era.
The mixing time of the Dikin walk in a polytope—a simple proof
Sushant Sachdeva and Nisheeth K Vishnoi · 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.
Vaidya walk: A sampling algorithm based on the volumetric barrier
Yuansi Chen, Raaz Dwivedi, Martin J Wainwright, and Bin Yu · 2017
Cited alongside, same era.
Andre Wibisono · 2018
Later among the works it cites.
Analysis of Langevin Monte Carlo via convex optimization
Alain Durmus, Szymon Majewski, and Blazej Miasojedow · 2019
Later among the works it cites.
Rapid convergence of the unadjusted Langevin algorithm: Isoperimetry suffices
Santosh Vempala and Andre Wibisono · 2019
Later among the works it cites.
On sampling from a log-concave density using kinetic Langevin diffusions
Arnak S Dalalyan and Lionel Riou-Durand · 2020
Later among the works it cites.
Faster differentially private samplers via Rényi divergence analysis of discretized Langevin MCMC
Arun Ganesh and Kunal Talwar · 2020
Later among the works it cites.
Reducing isotropy and volume to KLS: an O ∗ ( n 3 ψ 2 ) {O}^{*}(n^{3}\psi^{2}) volume algorithm
He Jia, Aditi Laddha, Yin Tat Lee, and Santosh S. Vempala · 2021
Closest in time.
A polynomial-time algorithm and applications for matrix sampling from Harish-Chandra–Itzykson-Zuber densities
Jonathan Leake, Colin S McSwiggen, and Nisheeth K Vishnoi · 2021
Closest in time.
An introduction to Hamiltonian Monte Carlo method for sampling
Nisheeth K. Vishnoi · 2021
Closest in time.