Fetching the paper…
Reading the bibliography…
In this paper, we are concerned with a non-asymptotic analysis of sampling algorithms used in nonconvex optimization.
A useful theorem for nonlinear devices having gaussian inputs
Robert Price · 1958
Earlier work this paper cites.
Laplace’s method revisited: weak convergence of probability measures
Chii-Ruey Hwang · 1980
Earlier work this paper cites.
Ergodicity for sdes and approximations: Locally lipschitz vector fields and degenerate noise
Jonathan Mattingly, A. Stuart, and D. Higham · 2002
Earlier work this paper cites.
Optimal portfolio selection and dynamic benchmark tracking
Alexei A Gaivoronski, Sergiy Krylov, and Nico Van der Wijst · 2005
Earlier work this paper cites.
Graphical models, exponential families, and variational inference
Martin J Wainwright and Michael I Jordan · 2008
Earlier work this paper cites.
Bayesian learning via stochastic gradient Langevin dynamics
Max Welling and Yee W Teh · 2011
Earlier work this paper cites.
Sonja Cox, Martin Hutzenthaler, and Arnulf Jentzen · 2013
Earlier work this paper cites.
Auto-encoding variational bayes
Diederik P Kingma and Max Welling · 2013
Earlier work this paper cites.
Fixed-form variational posterior approximation through stochastic linear regression
Tim Salimans and David A Knowles · 2013
Earlier work this paper cites.
Stochastic backpropagation and approximate inference in deep generative models
Danilo Jimenez Rezende, Shakir Mohamed, and Daan Wierstra · 2014
Earlier work this paper cites.
Reflection couplings and contraction rates for diffusions
Andreas Eberle · 2016
Cited alongside, same era.
Further and stronger analogy between sampling and optimization: Langevin monte carlo and gradient descent
Arnak Dalalyan · 2017
Cited alongside, same era.
Nonasymptotic convergence analysis for the unadjusted Langevin algorithm
Alain Durmus and Eric Moulines · 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.
The promises and pitfalls of stochastic gradient Langevin dynamics
Nicolas Brosse, Alain Durmus, and Eric Moulines · 2018
Cited alongside, same era.
Sharp convergence rates for Langevin dynamics in the nonconvex setting
On fixed gain recursive estimators with discontinuity in the parameters
Huy N Chau, Chaman Kumar, Miklós Rásonyi, and Sotirios Sabanis · 2019
Closest in time.
User-friendly guarantees for the Langevin Monte Carlo with inaccurate gradient
Arnak S Dalalyan and Avetik Karagulyan · 2019
Closest in time.
High-dimensional Bayesian inference via the unadjusted Langevin algorithm
Alain Durmus and Eric Moulines · 2019
Closest in time.
Quantitative Harris-type theorems for diffusions and McKean–Vlasov processes
Andreas Eberle, Arnaud Guillin, and Raphael Zimmer · 2019
Closest in time.
Non-asymptotic bounds for sampling algorithms without log-concavity
Mateusz B Majka, Aleksandar Mijatović, and Lukasz Szpruch · 2019
Closest in time.
Higher order Langevin Monte Carlo algorithm
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Xiang Cheng, Niladri S Chatterji, Yasin Abbasi-Yadkori, Peter L Bartlett, and Michael I Jordan · 2018
Cited alongside, same era.
Global non-convex optimization with discretized diffusions
Murat A Erdogdu, Lester Mackey, and Ohad Shamir · 2018
Cited alongside, same era.
Global convergence of Langevin dynamics based algorithms for nonconvex optimization
Pan Xu, Jinghui Chen, Difan Zou, and Quanquan Gu · 2018
Cited alongside, same era.
The tamed unadjusted Langevin algorithm
Nicolas Brosse, Alain Durmus, Éric Moulines, and Sotirios Sabanis · 2019
Cited alongside, same era.
Theoretical guarantees for approximate sampling from smooth and log-concave densities
Arnak S Dalalyan
Cited in the paper.
Sotirios Sabanis and Ying Zhang · 2019
Closest in time.
Index tracking with cardinality constraints: A stochastic neural networks approach
Yu Zheng, Bowei Chen, Timothy M Hospedales, and Yongxin Yang · 2020
Closest in time.
On stochastic gradient langevin dynamics with dependent data streams in the logconcave case
Mathias Barkhagen, Ngoc Huy Chau, Éric Moulines, Miklós Rásonyi, Sotirios Sabanis, and Ying Zhang · 2021
Closest in time.
On stochastic gradient langevin dynamics with dependent data streams: The fully nonconvex case
Ngoc Huy Chau, Éric Moulines, Miklos Rásonyi, Sotirios Sabanis, and Ying Zhang · 2021
Closest in time.