Fetching the paper…
Reading the bibliography…
We formulate and study a general family of (continuous-time) stochastic dynamics for accelerated first-order minimization of smooth convex functions.
A relaxation method of finding a common point of convex sets and its application to the solution of problems in convex programming
L. M. Bregman · 1967
Earlier work this paper cites.
Convex Analysis
R. Rockafellar · 1970
Earlier work this paper cites.
On the support of diffusion processes with applications to the strong maximum principle
D. W. Stroock and S. R. S. Varadhan · 1972
Earlier work this paper cites.
The pricing of options and corporate liabilities
F. Black and M. Scholes · 1973
Earlier work this paper cites.
Problem Complexity and Method Efficiency in Optimization
A. S. Nemirovsky and D. B. Yudin · 1983
Earlier work this paper cites.
A method of solving a convex programming problem with convergence rate o(1/k2)
Y. Nesterov · 1983
Earlier work this paper cites.
General Problem of the Stability Of Motion
A. Lyapunov · 1992
Earlier work this paper cites.
Acceleration of stochastic approximation by averaging
B. T. Polyak and A. B. Juditsky · 1992
Earlier work this paper cites.
Hamiltonian and gradient flows, algorithms, and control
A. Bloch, editor · 1994
Earlier work this paper cites.
Optimization and dynamical systems
U. Helmke and J. Moore · 1994
Earlier work this paper cites.
Asymptotic pseudotrajectories and chain recurrent flows, with applications
M. Benaïm and M. W. Hirsch · 1996
Earlier work this paper cites.
Dynamics of stochastic approximation algorithms
M. Benaïm · 1999
Earlier work this paper cites.
Lectures on Modern Convex Optimization
A. Ben-Tal and A. Nemirovski · 2001
Earlier work this paper cites.
The ordered subsets mirror descent optimization method with applications to tomography
A. Ben-Tal, T. Margalit, and A. Nemirovski · 2001
Earlier work this paper cites.
Itô’s formula for C 1 , λ C^{1,\lambda} -functions of a càdlàg process and related calculus
M. Errami, F. Russo, and P. Vallois · 2002
Cited alongside, same era.
Mirror descent and nonlinear projected subgradient methods for convex optimization
A. Beck and M. Teboulle · 2003
Cited alongside, same era.
Stochastic Differential Equations: An Introduction with Applications
B. Øksendal · 2003
Cited alongside, same era.
Clustering with Bregman divergences
A. Banerjee, S. Merugu, I. S. Dhillon, and J. Ghosh · 2005
Cited alongside, same era.
On the long time behavior of second order differential equations with asymptotically small dissipation
A. Cabot, H. Engler, and S. Gadat · 2009
Cited alongside, same era.
Robust stochastic approximation approach to stochastic programming
A. Nemirovski, A. Juditsky, G. Lan, and A. Shapiro · 2009
Fast convergence of an inertial gradient-like system with vanishing viscosity
H. Attouch, J. Peypouquet, and P. Redont · 2015
Later among the works it cites.
Finite-time analysis of projected Langevin Monte Carlo
S. Bubeck, R. Eldan, and J. Lehec · 2015
Later among the works it cites.
From averaging to acceleration, there is only a step-size
N. Flammarion and F. R. Bach · 2015
Later among the works it cites.
Accelerated mirror descent in continuous and discrete time
W. Krichene, A. Bayen, and P. Bartlett · 2015
Later among the works it cites.
Adaptive restart for accelerated gradient schemes
B. O’Donoghue and E. Candès · 2015
Later among the works it cites.
Adaptive averaging in accelerated descent dynamics
W. Krichene, A. Bayen, and P. Bartlett · 2016
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Ergodic mirror descent
J. C. Duchi, A. Agarwal, M. Johansson, and M. Jordan · 2010
Cited alongside, same era.
Stochastic calculus for a time-changed semimartingale and the associated stochastic differential equations
K. Kobayashi · 2011
Cited alongside, same era.
Convergence rates of inexact proximal-gradient methods for convex optimization
M. Schmidt, N. L. Roux, and F. Bach · 2011
Cited alongside, same era.
An optimal method for stochastic composite optimization
G. Lan · 2012
Cited alongside, same era.
Continuous-time stochastic mirror descent on a network: Variance reduction, consensus, convergence
M. Raginsky and J. Bouvrie · 2012
Cited alongside, same era.
Accelerating stochastic gradient descent using predictive variance reduction
R. Johnson and T. Zhang · 2013
Cited alongside, same era.
Later among the works it cites.
On the convergence of gradient-like flows with noisy gradient input
P. Mertikopoulos and M. Staudigl · 2016
Later among the works it cites.
A variational perspective on accelerated methods in optimization
A. Wibisono, A. C. Wilson, and M. I. Jordan · 2016
Later among the works it cites.
Convergence of Langevin MCMC in KL-divergence
X. Cheng and P. Bartlett · 2017
Closest in time.
Underdamped Langevin MCMC: A non-asymptotic analysis
X. Cheng, N. S. Chatterji, P. L. Bartlett, and M. I. Jordan · 2017
Closest in time.
Theoretical guarantees for approximate sampling from smooth and log-concave densities
A. S. Dalalyan · 2017
Closest in time.
Stochastic gradient descent as approximate bayesian inference
S. Mandt, M. D. Hoffman, and D. M. Blei · 2017
Closest in time.
Non-convex learning via stochastic gradient Langevin dynamics: a nonasymptotic analysis
M. Raginsky, A. Rakhlin, and M. Telgarsky · 2017
Closest in time.