Fetching the paper…
Reading the bibliography…
The development of efficient sampling algorithms catering to non-Euclidean geometries has been a challenging endeavor, as discretization techniques which succeed in the Euclidean setting do not readily carry over to more general settings.
Sur un nouveau théorème-limite de la théorie des probabilités
Harald Cramér · 1938
Earlier work this paper cites.
Differential operators on a semisimple lie groups
Harish-Chandra · 1957
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
Herm Jan Brascamp and Elliott H Lieb · 1976
Earlier work this paper cites.
The planar approximation. ii
C. Itzykson and J.-. Zuber · 1980
Earlier work this paper cites.
A method for solving a convex programming problem with convergence rate o ( 1 / k 2 ) o(1/k^{2})
Yurii Nesterov · 1983
Earlier work this paper cites.
Problem Complexity and Method Efficiency in Optimization
A. Nemirovski and D.B̃. Yudin · 1983
Earlier work this paper cites.
A random polynomial time algorithm for approximating the volume of convex bodies
Martin E. Dyer, Alan M. Frieze, 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.
Sharp uniform convexity and smoothness estimates for trace norms
Keith Ball, Eric A. Carlen, and Elliott H. Lieb · 1994
Earlier work this paper cites.
Comments on “representations of knowledge in complex systems” by u. grenander and mi miller
Julian Besag · 1994
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.
Exponential convergence of langevin distributions and their discrete approximations
Gareth O Roberts and Richard L Tweedie · 1996
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.
Concentration of measure and logarithmic Sobolev inequalities
Michel Ledoux · 1999
Earlier work this paper cites.
Faster mixing via average conductance
László Lovász and Ravi Kannan · 1999
Earlier work this paper cites.
From brunn-minkowski to brascamp-lieb and to logarithmic sobolev inequalities
Sergey G Bobkov and Michel Ledoux · 2000
Earlier work this paper cites.
On the riemannian geometry defined by self-concordant barriers and interior-point methods
Yurii E Nesterov and Michael J Todd · 2002
Earlier work this paper cites.
Interior point polynomial time methods in convex programming
Arkadi Nemirovski · 2004
Earlier work this paper cites.
Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
Emmanuel J. Candès, Justin K. Romberg, and Terence Tao · 2006
Earlier work this paper cites.
On convex perturbations with a bounded isotropic constant
Bo”az Klartag · 2006
Earlier work this paper cites.
The geometry of logconcave functions and sampling algorithms
László Lovász and Santosh S. Vempala · 2007
Earlier work this paper cites.
Lévy stable distributions in the theory of probability
Francesco Mainardi · 2007
Earlier work this paper cites.
Online learning: Theory, algorithms, and applications
Shai Shalev-Shwartz · 2007
Earlier work this paper cites.
Privacy-preserving logistic regression
Kamalika Chaudhuri and Claire Monteleoni · 2008
Earlier work this paper cites.
Applications of strong convexity–strong smoothness duality to learning with matrices
Sham M. Kakade, Shai Shalev-Shwartz, and Ambuj Tewari · 2009
Earlier work this paper cites.
Fast global convergence rates of gradient methods for high-dimensional statistical recovery
Alekh Agarwal, Sahand N. Negahban, and Martin J. Wainwright · 2010
Earlier work this paper cites.
Differentially private empirical risk minimization
Kamalika Chaudhuri, Claire Monteleoni, and Anand D Sarwate · 2011
Earlier work this paper cites.
Approximately gaussian marginals and the hyperplane conjecture
Ronen Eldan and Bo”az Klartag · 2011
Earlier work this paper cites.
Riemann manifold langevin and hamiltonian monte carlo methods
Mark Girolami and Ben Calderhead · 2011
Earlier work this paper cites.
The multiplicative weights update method: a meta-algorithm and applications
Sanjeev Arora, Elad Hazan, and Satyen Kale · 2012
Earlier work this paper cites.
Regret analysis of stochastic and nonstochastic multi-armed bandit problems
Sébastien Bubeck and Nicolò Cesa-Bianchi · 2012
Earlier work this paper cites.
Nonasymptotic mixing of the mala algorithm
Nawaf Bou-Rabee and Martin Hairer · 2012
Cited alongside, same era.
Centroid bodies and the logarithmic laplace transform: a unified approach
Bo”az Klartag and Emanuel Milman · 2012
Cited alongside, same era.
Private convex empirical risk minimization and high-dimensional regression
Daniel Kifer, Adam Smith, and Abhradeep Thakurta · 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.
Optimal rates for zero-order convex optimization: The power of two function evaluations
John C Duchi, Michael I Jordan, Martin J Wainwright, and Andre Wibisono · 2015
Cited alongside, same era.
Nearly-optimal private lasso
Kunal Talwar, Abhradeep Thakurta, and Li Zhang · 2015
Logsmooth gradient concentration and tighter runtimes for metropolized hamiltonian monte carlo
Yin Tat Lee, Ruoqi Shen, and Kevin Tian · 2020
Later among the works it cites.
Wasserstein control of mirror langevin monte carlo
Kelvin Shuangjian Zhang, Gabriel Peyré, Jalal Fadili, and Marcelo Pereyra · 2020
Later among the works it cites.
Efficient constrained sampling via the mirror-langevin algorithm
Kwangjun Ahn and Sinho Chewi · 2021
Later among the works it cites.
Private stochastic convex optimization: Optimal rates in ℓ 1 \ell_{1} geometry
Hilal Asi, Vitaly Feldman, Tomer Koren, and Kunal Talwar · 2021
Later among the works it cites.
Non-euclidean differentially private stochastic convex optimization
Raef Bassily, Cristóbal Guzmán, and Anupama Nandi · 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…
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 S. 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.
Differentially private empirical risk minimization revisited: Faster and more general
Di Wang, Minwei Ye, and Jinhui Xu · 2017
Cited alongside, same era.
Langevin monte carlo and jko splitting
Espen Bernton · 2018
Cited alongside, same era.
An almost constant lower bound of the isoperimetric coefficient in the kls conjecture
Yuansi Chen · 2021
Later among the works it cites.
The entropic barrier is n-self-concordant
Sinho Chewi · 2021
Later among the works it cites.
Optimal dimension dependence of the metropolis-adjusted langevin algorithm
Sinho Chewi, Chen Lu, Kwangjun Ahn, Xiang Cheng, Thibaut Le Gouic, and Philippe Rigollet · 2021
Later among the works it cites.
Relative lipschitzness in extragradient methods and a direct recipe for acceleration
Michael B. Cohen, Aaron Sidford, and Kevin Tian · 2021
Later among the works it cites.
Mirror langevin monte carlo: the case under isoperimetry
Qijia Jiang · 2021
Later among the works it cites.
Sampling matrices from harish-chandra-itzykson-zuber densities with applications to quantum inference and differential privacy
Jonathan Leake, Colin S. McSwiggen, and Nisheeth K. Vishnoi · 2021
Later among the works it cites.
Lower bounds on metropolized sampling methods for well-conditioned distributions
Yin Tat Lee, Ruoqi Shen, and Kevin Tian · 2021
Later among the works it cites.
Structured logconcave sampling with a restricted gaussian oracle
Yin Tat Lee, Ruoqi Shen, and Kevin Tian · 2021
Later among the works it cites.
The harish-chandra integral: An introduction with examples
Colin McSwiggen · 2021
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 (extended abstract)
Yuansi Chen and Ronen Eldan · 2022
Later among the works it cites.
An entropic generalization of Caffarelli’s contraction theorem via covariance inequalities
Sinho Chewi and Aram-Alexandre Pooladian · 2022
Later among the works it cites.
Private convex optimization via exponential mechanism
Sivakanth Gopi, Yin Tat Lee, and Daogao Liu · 2022
Later among the works it cites.
Convergence of the riemannian langevin algorithm
Khashayar Gatmiry and Santosh S Vempala · 2022
Later among the works it cites.
Private streaming sco in ℓ _ p \ell\_p geometry with applications in high dimensional online decision making
Yuxuan Han, Zhicong Liang, Zhipeng Liang, Yang Wang, Yuan Yao, and Jiheng Zhang · 2022
Later among the works it cites.
A slightly improved bound for the KLS constant
Arun Jambulapati, Yin Tat Lee, and Santosh S. Vempala · 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.
Yunbum Kook, Yin Tat Lee, Ruoqi Shen, and Santosh S Vempala · 2022
Later among the works it cites.
A proximal algorithm for sampling from non-smooth potentials
Jiaming Liang and Yongxin Chen · 2022
Later among the works it cites.
The mirror langevin algorithm converges with vanishing bias
Ruilin Li, Molei Tao, Santosh S. Vempala, and Andre Wibisono · 2022
Later among the works it cites.
An efficient sampling algorithm for non-smooth composite potentials
Wenlong Mou, Nicolas Flammarion, Martin J Wainwright, and Peter L Bartlett · 2022
Later among the works it cites.
Log-Concave Sampling
Sinho Chewi · 2023
Closest in time.
Private convex optimization in general norms
Sivakanth Gopi, Yin Tat Lee, Daogao Liu, Ruoqi Shen, and Kevin Tian · 2023
Closest in time.
The harish-chandra-itzykson-zuber integral formula
Terence Tao · 2023
Closest in time.
High-accuracy sampling from constrained spaces with the metropolis-adjusted preconditioned langevin algorithm
Vishwak Srinivasan, Andre Wibisono, and Ashia Wilson · 2025
Closest in time.