Fetching the paper…
Reading the bibliography…
We introduce the continuized Nesterov acceleration, a close variant of Nesterov acceleration whose variables are indexed by a continuous time parameter.
Problem Complexity and Method Efficiency in Optimization
Arkadij Semenovič Nemirovskij and David Borisovich Yudin · 1983
Earlier work this paper cites.
A method of solving a convex programming problem with convergence rate O ( 1 / k 2 ) O(1/k^{2})
Yurii Nesterov · 1983
Earlier work this paper cites.
Piecewise-deterministic markov processes: a general class of non-diffusion stochastic models
Mark HA Davis · 1984
Earlier work this paper cites.
Introductory Lectures on Convex Optimization: A Basic Course , volume 87
Yurii Nesterov · 2003
Earlier work this paper cites.
Randomized gossip algorithms
Stephen Boyd, Arpita Ghosh, Balaji Prabhakar, and Devavrat Shah · 2006
Earlier work this paper cites.
Geographic gossip: Efficient averaging for sensor networks
Alexandros D. G. Dimakis, Anand D. Sarwate, and Martin J. Wainwright · 2007
Earlier work this paper cites.
Accelerated gradient methods for stochastic optimization and online learning
Chonghai Hu, Weike Pan, and James Kwok · 2009
Earlier work this paper cites.
On the duality of strong convexity and strong smoothness: Learning applications and matrix regularization
Sham Kakade, Shai Shalev-Shwartz, and Ambuj Tewari · 2009
Earlier work this paper cites.
A coordinate gradient descent method for nonsmooth separable minimization
Paul Tseng and Sangwoon Yun · 2009
Earlier work this paper cites.
Gossip algorithms for distributed signal processing
A. G. Dimakis, S. Kar, J. M. F. Moura, M. G. Rabbat, and A. Scaglione · 2010
Earlier work this paper cites.
Dual averaging methods for regularized stochastic learning and online optimization
Lin Xiao · 2010
Earlier work this paper cites.
Stochastic first order methods in smooth convex optimization
Olivier Devolder · 2011
Earlier work this paper cites.
Effective graph resistance
W. Ellens, F.M. Spieksma, P. Van Mieghem, A. Jamakovic, and R.E. Kooij · 2011
Earlier work this paper cites.
An optimal method for stochastic composite optimization
Guanghui Lan · 2012
Earlier work this paper cites.
Chebyshev polynomials in distributed consensus applications
Eduardo Montijano, Juan Montijano, and C. Sagues · 2012
Earlier work this paper cites.
Efficiency of coordinate descent methods on huge-scale optimization problems
Yurii Nesterov · 2012
Earlier work this paper cites.
Limit theorems for stochastic processes , volume 288
Jean Jacod and Albert Shiryaev · 2013
Earlier work this paper cites.
Analysis of accelerated gossip algorithms
Ji Liu, Brian D.O. Anderson, Ming Cao, and A. Stephen Morse · 2013
Earlier work this paper cites.
Reversible markov chains and random walks on graphs
David Aldous and James Allen Fill · 2014
Cited alongside, same era.
Stochastic differential equations and diffusion processes
Nobuyuki Ikeda and Shinzo Watanabe · 2014
Cited alongside, same era.
A differential equation for modeling Nesterov’s accelerated gradient method: theory and insights
Weijie Su, Stephen Boyd, and Emmanuel Candes · 2014
Cited alongside, same era.
A geometric alternative to Nesterov’s accelerated gradient descent
Sébastien Bubeck, Yin Tat Lee, and Mohit Singh · 2015
Cited alongside, same era.
From averaging to acceleration, there is only a step-size
Nicolas Flammarion and Francis Bach · 2015
Cited alongside, same era.
Accelerated mirror descent in continuous and discrete time
On acceleration with noise-corrupted gradients
Michael Cohen, Jelena Diakonikolas, and Lorenzo Orecchia · 2018
Later among the works it cites.
Markov models & optimization
Mark HA Davis · 2018
Later among the works it cites.
Accelerated decentralized optimization with local updates for smooth and strongly convex objectives, 2018
Hadrien Hendrikx, Francis Bach, and Laurent Massoulié · 2018
Later among the works it cites.
Accelerating stochastic gradient descent for least squares regression
Prateek Jain, Sham M Kakade, Rahul Kidambi, Praneeth Netrapalli, and Aaron Sidford · 2018
Later among the works it cites.
Understanding the acceleration phenomenon via high-resolution differential equations
Bin Shi, Simon Du, Michael Jordan, and Weijie Su · 2018
Later among the works it cites.
Direct Runge-Kutta discretization achieves acceleration
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Walid Krichene, Alexandre Bayen, and Peter Bartlett · 2015
Cited alongside, same era.
Coordinate descent algorithms
Stephen Wright · 2015
Cited alongside, same era.
On lower and upper bounds in smooth and strongly convex optimization
Yossi Arjevani, Shai Shalev-Shwartz, and Ohad Shamir · 2016
Cited alongside, same era.
Optimized first-order methods for smooth convex minimization
Donghwan Kim and Jeffrey A Fessler · 2016
Cited alongside, same era.
Brownian Motion, Martingales, and Stochastic Calculus , volume 274
Jean-François Le Gall · 2016
Cited alongside, same era.
A variational perspective on accelerated methods in optimization
Andre Wibisono, Ashia C Wilson, and Michael I Jordan · 2016
Cited alongside, same era.
A Lyapunov analysis of momentum methods in optimization
Ashia Wilson, Benjamin Recht, and Michael I Jordan · 2016
Cited alongside, same era.
Jingzhao Zhang, Aryan Mokhtari, Suvrit Sra, and Ali Jadbabaie · 2018
Later among the works it cites.
Rate of convergence of the Nesterov accelerated gradient method in the subcritical case α ⩽ 3 \alpha\leqslant 3
Hedy Attouch, Zaki Chbani, and Hassan Riahi · 2019
Later among the works it cites.
The approximate duality gap technique: A unified theory of first-order methods
Jelena Diakonikolas and Lorenzo Orecchia · 2019
Later among the works it cites.
An accelerated decentralized stochastic proximal algorithm for finite sums
Hadrien Hendrikx, Francis Bach, and Laurent Massoulié · 2019
Later among the works it cites.
Provably accelerated randomized gossip algorithms
Nicolas Loizou, Michael Rabbat, and Peter Richtárik · 2019
Later among the works it cites.
A dynamical systems perspective on Nesterov acceleration
Michael Muehlebach and Michael Jordan · 2019
Later among the works it cites.
Acceleration via symplectic discretization of high-resolution differential equations
Bin Shi, Simon Du, Weijie Su, and Michael Jordan · 2019
Later among the works it cites.
Fast and faster convergence of sgd for over-parameterized models and an accelerated perceptron
Sharan Vaswani, Francis Bach, and Mark Schmidt · 2019
Later among the works it cites.
Robust accelerated gradient methods for smooth strongly convex functions
Necdet Serhat Aybat, Alireza Fallah, Mert Gurbuzbalaban, and Asuman Ozdaglar · 2020
Later among the works it cites.
Jesús María Sanz-Serna and Konstantinos Zygalakis · 2020
Later among the works it cites.
Acceleration methods
Alexandre d’Aspremont, Damien Scieur, and Adrien Taylor · 2021
Closest in time.
Decentralized optimization with heterogeneous delays: a continuous-time approach
Mathieu Even, Hadrien Hendrikx, and Laurent Massoulié · 2021
Closest in time.
Analysis of stochastic gradient descent in continuous time
Jonas Latz · 2021
Closest in time.