Fetching the paper…
Reading the bibliography…
We study sampling problems associated with potentials that lack smoothness.
On measures of entropy and information
Alfréd Rényi · 1961
Earlier work this paper cites.
Correlation functions and computer simulations
Giorgio Parisi · 1981
Earlier work this paper cites.
Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images
Stuart Geman and Donald Geman · 1984
Earlier work this paper cites.
Bayesian neural networks
Igor Kononenko · 1989
Earlier work this paper cites.
Representations of knowledge in complex systems
Ulf Grenander and Michael I Miller · 1994
Earlier work this paper cites.
A sampling problem in molecular dynamics simulations of macromolecules
James B Clarage, Tod Romo, B Kim Andrews, B Montgomery Pettitt, and George N Phillips · 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.
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.
Statistical mechanics: algorithms and computations , volume 13
Werner Krauth · 2006
Earlier work this paper cites.
Probabilistic graphical models: principles and techniques
Daphne Koller and Nir Friedman · 2009
Earlier work this paper cites.
MCMC using hamiltonian dynamics
Radford M Neal · 2011
Earlier work this paper cites.
Nonasymptotic mixing of the MALA algorithm
Nawaf Bou-Rabee and Martin Hairer · 2013
Earlier work this paper cites.
Bayesian Data Analysis
Andrew Gelman, John B Carlin, Hal S Stern, David B Dunson, Aki Vehtari, and Donald B Rubin · 2013
Earlier work this paper cites.
First-order methods of smooth convex optimization with inexact oracle
Olivier Devolder, François Glineur, and Yurii Nesterov · 2014
Earlier work this paper cites.
Proximal algorithms
Neal Parikh and Stephen Boyd · 2014
Cited alongside, same era.
Universal gradient methods for convex optimization problems
Yu Nesterov · 2015
Cited alongside, same era.
Principles and overview of sampling methods for modeling macromolecular structure and dynamics
Tatiana Maximova, Ryan Moffatt, Buyong Ma, Ruth Nussinov, and Amarda Shehu · 2016
Cited alongside, same era.
Theoretical guarantees for approximate sampling from smooth and log-concave densities
Arnak S Dalalyan · 2017
Cited alongside, same era.
Non-convex learning via stochastic gradient langevin dynamics: a nonasymptotic analysis
Maxim Raginsky, Alexander Rakhlin, and Matus Telgarsky · 2017
Cited alongside, same era.
Langevin Monte Carlo and JKO splitting
Espen Bernton · 2018
Cited alongside, same era.
Composite logconcave sampling with a Restricted Gaussian Oracle
Ruoqi Shen, Kevin Tian, and Yin Tat Lee · 2020
Later among the works it cites.
Analysis of Langevin Monte Carlo from Poincaré to Log-Sobolev
Sinho Chewi, Murat A Erdogdu, Mufan Bill Li, Ruoqi Shen, and Matthew Zhang · 2021
Later among the works it cites.
On the convergence of Langevin Monte Carlo: the interplay between tail growth and smoothness
Murat A Erdogdu and Rasa Hosseinzadeh · 2021
Later among the works it cites.
What are bayesian neural network posteriors really like?
Pavel Izmailov, Sharad Vikram, Matthew D Hoffman, and Andrew Gordon Gordon Wilson · 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.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Efficient Bayesian computation by proximal Markov Chain Monte Carlo: when Langevin meets Moreau
Alain Durmus, Eric Moulines, and Marcelo Pereyra · 2018
Cited alongside, same era.
Sampling as optimization in the space of measures: The langevin dynamics as a composite optimization problem
Andre Wibisono · 2018
Cited alongside, same era.
Analysis of Langevin Monte Carlo via convex optimization
Alain Durmus, Szymon Majewski, and Błażej Miasojedow · 2019
Cited alongside, same era.
Rapid convergence of the unadjusted langevin algorithm: Isoperimetry suffices
Santosh Vempala and Andre Wibisono · 2019
Cited alongside, same era.
Proximal langevin algorithm: Rapid convergence under isoperimetry
Andre Wibisono · 2019
Cited alongside, same era.
Langevin Monte Carlo without smoothness
Niladri Chatterji, Jelena Diakonikolas, Michael I Jordan, and Peter Bartlett · 2020
Cited alongside, same era.
Joseph Lehec · 2021
Later among the works it cites.
Sampling from non-smooth distributions through Langevin diffusion
Tung Duy Luu, Jalal Fadili, and Christophe Chesneau · 2021
Later among the works it cites.
Unadjusted Langevin algorithm for non-convex weakly smooth potentials
Dao Nguyen, Xin Dang, and Yixin Chen · 2021
Later among the works it cites.
Topics in optimal transportation , volume 58
Cédric Villani · 2021
Later among the works it cites.
Towards a theory of non-log-concave sampling: first-order stationarity guarantees for langevin monte carlo
Krishna Balasubramanian, Sinho Chewi, Murat A Erdogdu, Adil Salim, and Shunshi Zhang · 2022
Closest in time.
Improved analysis for a proximal algorithm for sampling
Yongxin Chen, Sinho Chewi, Adil Salim, and Andre Wibisono · 2022
Closest in time.
Bounding the error of discretized langevin algorithms for non-strongly log-concave targets
Arnak S Dalalyan, Avetik Karagulyan, and Lionel Riou-Durand · 2022
Closest in time.
When is the convergence time of langevin algorithms dimension independent? a composite optimization viewpoint
Yoav Freund, Yi-An Ma, and Tong Zhang · 2022
Closest in time.
A proximal algorithm for sampling from non-smooth potentials
Jiaming Liang and Yongxin Chen · 2022
Closest in time.