Fetching the paper…
Reading the bibliography…
In this work, we examine sampling problems with non-smooth potentials.
An extension of davidon methods to non differentiable problems
Claude Lemaréchal · 1975
Earlier work this paper cites.
A method of conjugate subgradients for minimizing nondifferentiable functions
Philip Wolfe · 1975
Earlier work this paper cites.
Monotone operators and the proximal point algorithm
Ralph Tyrrell Rockafellar · 1976
Earlier work this paper cites.
Nonsmooth optimization and descent methods
Claude Lemaréchal · 1978
Earlier work this paper cites.
Correlation functions and computer simulations
Giorgio Parisi · 1981
Earlier work this paper cites.
A modification and an extension of Lemaréchal’s algorithm for nonsmooth minimization
Robert Mifflin · 1982
Earlier work this paper cites.
Sampling and integration of near log-concave functions
David Applegate and Ravi Kannan · 1991
Earlier work this paper cites.
A random polynomial-time algorithm for approximating the volume of convex bodies
Martin Dyer, Alan Frieze, and Ravi Kannan · 1991
Earlier work this paper cites.
Representations of knowledge in complex systems
Ulf Grenander and Michael I Miller · 1994
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.
Random walks and an O ∗ ( n 5 ) {O}^{*}(n^{5}) volume algorithm for convex bodies
Ravi Kannan, László Lovász, and Miklós Simonovits · 1997
Earlier work this paper cites.
Optimal scaling of discrete approximations to langevin diffusions
Gareth O Roberts and Jeffrey S Rosenthal · 1998
Earlier work this paper cites.
Langevin diffusions and metropolis-hastings algorithms
Gareth O Roberts and Osnat Stramer · 2002
Earlier work this paper cites.
Delimiting species: a renaissance issue in systematic biology
Jack W Sites Jr and Jonathon C Marshall · 2003
Earlier work this paper cites.
Solving convex programs by random walks
Dimitris Bertsimas and Santosh Vempala · 2004
Earlier work this paper cites.
Simulated annealing for convex optimization
Adam Tauman Kalai and Santosh Vempala · 2006
Cited alongside, same era.
Statistical mechanics: algorithms and computations
Werner Krauth · 2006
Cited alongside, same era.
Fast algorithms for logconcave functions: Sampling, rounding, integration and optimization
László Lovász and Santosh Vempala · 2006
Cited alongside, same era.
MCMC using hamiltonian dynamics
Radford M Neal · 2011
Cited alongside, same era.
Nonasymptotic mixing of the mala algorithm
Nawaf Bou-Rabee and Martin Hairer · 2013
Cited alongside, same era.
Bayesian Data Analysis
Andrew Gelman, John B Carlin, Hal S Stern, David B Dunson, Aki Vehtari, and Donald B Rubin · 2013
Cited alongside, same era.
Analysis of langevin monte carlo via convex optimization
Alain Durmus, Szymon Majewski, and Błażej Miasojedow · 2019
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 · 2019
Later among the works it cites.
The randomized midpoint method for log-concave sampling
Ruoqi Shen and Yin Tat Lee · 2019
Later among the works it cites.
Proximal langevin algorithm: Rapid convergence under isoperimetry
A. Wibisono · 2019
Later among the works it cites.
Langevin monte carlo without smoothness
Niladri Chatterji, Jelena Diakonikolas, Michael I Jordan, and Peter Bartlett · 2020
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Theoretical guarantees for approximate sampling from smooth and log-concave densities
Arnak S Dalalyan · 2017
Cited alongside, same era.
Eldan’s stochastic localization and the kls hyperplane conjecture: an improved lower bound for expansion
Yin Tat Lee and Santosh Srinivas Vempala · 2017
Cited alongside, same era.
Langevin monte carlo and jko splitting
E. Bernton · 2018
Cited alongside, same era.
Fast mcmc sampling algorithms on polytopes
Yuansi Chen, Raaz Dwivedi, Martin J Wainwright, and Bin Yu · 2018
Cited alongside, same era.
Convergence of langevin mcmc in kl-divergence
Xiang Cheng and Peter Bartlett · 2018
Cited alongside, same era.
Underdamped langevin mcmc: A non-asymptotic analysis
Xiang Cheng, Niladri S Chatterji, Peter L Bartlett, and Michael I Jordan · 2018
Cited alongside, same era.
Yuansi Chen, Raaz Dwivedi, Martin J Wainwright, and Bin Yu · 2020
Later among the works it cites.
Structured logconcave sampling with a restricted gaussian oracle
Yin Tat Lee, Ruoqi Shen, and Kevin Tian · 2020
Later among the works it cites.
Composite logconcave sampling with a restricted gaussian oracle
Ruoqi Shen, Kevin Tian, and Yin Tat Lee · 2020
Later among the works it cites.
Variational transport: A convergent particle-based algorithm for distributional optimization
Zhuoran Yang, Yufeng Zhang, Yongxin Chen, and Zhaoran Wang · 2020
Later among the works it cites.
Yoav Freund, Yi-An Ma, and Tong Zhang · 2021
Closest in time.
Structured logconcave sampling with a restricted gaussian oracle
Yin Tat Lee, Ruoqi Shen, and Kevin Tian · 2021
Closest in time.
The langevin monte carlo algorithm in the non-smooth log-concave case
Joseph Lehec · 2021
Closest in time.
A proximal bundle variant with optimal iteration-complexity for a large range of prox stepsizes
Jiaming Liang and Renato D. C. Monteiro · 2021
Closest in time.
Jiaming Liang and Renato D. C. Monteiro · 2021
Closest in time.
Efficient MCMC sampling with dimension-free convergence rate using ADMM-type splitting
Maxime Vono, Daniel Paulin, and Arnaud Doucet · 2022
Closest in time.