Fetching the paper…
Reading the bibliography…
Gradient-based optimization algorithms can be studied from the perspective of limiting ordinary differential equations (ODEs).
Some methods of speeding up the convergence of iteration methods
Boris T Polyak · 1964
Earlier work this paper cites.
A method of solving a convex programming problem with convergence rate
Yurii Nesterov · 1983
Earlier work this paper cites.
Problem complexity and method efficiency in optimization
Arkadii Semenovich Nemirovsky and David Borisovich Yudin · 1983
Earlier work this paper cites.
Introduction to optimization
Boris T Polyak · 1987
Earlier work this paper cites.
A dynamical systems approach to constrained minimization
Johannes Schropp · 2000
Earlier work this paper cites.
A second-order gradient-like dissipative dynamical system with Hessian-driven damping.: Application to optimization and mechanics
Felipe Alvarez, Hedy Attouch, Jérôme Bolte, and P Redont · 2002
Earlier work this paper cites.
Quasi-geodesic neural learning algorithms over the orthogonal group: A tutorial
Simone Fiori · 2005
Earlier work this paper cites.
A second-order differential system with Hessian-driven damping; application to non-elastic shock laws
Hedy Attouch, Paul-Emile Maingé, and Patrick Redont · 2012
Earlier work this paper cites.
Optimization and Dynamical Systems
Uwe Helmke and John B Moore · 2012
Earlier work this paper cites.
How to make the gradients small
Yurii Nesterov · 2012
Earlier work this paper cites.
Mathematical Methods of Classical Mechanics
Vladimir Igorevich Arnold · 2013
Earlier work this paper cites.
Nonlinear Oscillations, Dynamical Systems, and Bifurcations of Vector Fields
John Guckenheimer and Philip Holmes · 2013
Earlier work this paper cites.
Introductory Lectures on Convex Optimization: A Basic Course
Yurii Nesterov · 2013
Earlier work this paper cites.
Geophysical Fluid Dynamics
Joseph Pedlosky · 2013
Earlier work this paper cites.
Differential equations and dynamical systems
Lawrence Perko · 2013
Earlier work this paper cites.
Introduction to Numerical Analysis
Josef Stoer and Roland Bulirsch · 2013
Earlier work this paper cites.
A differential equation for modeling Nesterov’s accelerated gradient method: Theory and insights
Weijie Su, Stephen Boyd, and Emmanuel J Candès · 2014
Earlier work this paper cites.
A geometric alternative to Nesterov’s accelerated gradient descent
Sébastien Bubeck, Yin Tat Lee, and Mohit Singh · 2015
Earlier work this paper cites.
Convex optimization: Algorithms and complexity
Sébastien Bubeck · 2015
Earlier work this paper cites.
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
Walid Krichene, Alexandre Bayen, and Peter L Bartlett · 2015
Cited alongside, same era.
Adaptive restart for accelerated gradient schemes
Brendan O’Donoghue and Emmanuel J Candès · 2015
Cited alongside, same era.
The rate of convergence of Nesterov’s accelerated forward-backward method is actually faster than
Hedy Attouch and Juan Peypouquet · 2016
Cited alongside, same era.
Fast convex optimization via inertial dynamics with Hessian driven damping
Hedy Attouch, Juan Peypouquet, and Patrick Redont · 2016
Cited alongside, same era.
Accelerated gradient methods for nonconvex nonlinear and stochastic programming
Saeed Ghadimi and Guanghui Lan · 2016
On the diffusion approximation of nonconvex stochastic gradient descent
Wenqing Hu, Chris Junchi Li, Lei Li, and Jian-Guo Liu · 2017
Later among the works it cites.
On the global convergence of a randomly perturbed dissipative nonlinear oscillator
Wenqing Hu, Chris Junchi Li, and Weijie Su · 2017
Later among the works it cites.
How to escape saddle points efficiently
Chi Jin, Rong Ge, Praneeth Netrapalli, Sham M Kakade, and Michael I Jordan · 2017
Later among the works it cites.
Acceleration and averaging in stochastic descent dynamics
Walid Krichene and Peter L Bartlett · 2017
Later among the works it cites.
Statistical inference for the population landscape via moment adjusted stochastic gradients
Tengyuan Liang and Weijie Su · 2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Adaptive averaging in accelerated descent dynamics
Walid Krichene, Alexandre Bayen, and Peter L Bartlett · 2016
Cited alongside, same era.
Analysis and design of optimization algorithms via integral quadratic constraints
Laurent Lessard, Benjamin Recht, and Andrew Packard · 2016
Cited alongside, same era.
Sparse recovery via differential inclusions
Stanley Osher, Feng Ruan, Jiechao Xiong, Yuan Yao, and Wotao Yin · 2016
Cited alongside, same era.
A differential equation for modeling Nesterov’s accelerated gradient method: theory and insights
Weijie Su, Stephen Boyd, and Emmanuel J Candès · 2016
Cited alongside, same era.
A Lyapunov analysis of momentum methods in optimization
Ashia C Wilson, Benjamin Recht, and Michael I Jordan · 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.
Stochastic modified equations and adaptive stochastic gradient algorithms
Qianxiao Li, Cheng Tai, and Weinan E · 2017
Later among the works it cites.
Asymptotic for a second-order evolution equation with convex potential and vanishing damping term
Ramzi May · 2017
Later among the works it cites.
Fast convergence of inertial dynamics and algorithms with asymptotic vanishing viscosity
Hedy Attouch, Zaki Chbani, Juan Peypouquet, and Patrick Redont · 2018
Closest in time.
How to make the gradients small stochastically
Zeyuan Allen-Zhu · 2018
Closest in time.
Michael Betancourt, Michael I Jordan, and Ashia C Wilson · 2018
Closest in time.
An optimal first order method based on optimal quadratic averaging
Dmitriy Drusvyatskiy, Maryam Fazel, and Scott Roy · 2018
Closest in time.
Analysis of optimization algorithms via integral quadratic constraints: Nonstrongly convex problems
Mahyar Fazlyab, Alejandro Ribeiro, Manfred Morari, and Victor M Preciado · 2018
Closest in time.
Xuefeng Gao, Mert Gürbüzbalaban, and Lingjiong Zhu · 2018
Closest in time.
Differential equations for modeling asynchronous algorithms
Li He, Qi Meng, Wei Chen, Zhi-Ming Ma, and Tie-Yan Liu · 2018
Closest in time.
Donghwan Kim and Jeffrey A Fessler · 2018
Closest in time.
Catalyst acceleration for first-order convex optimization: from theory to practice
Hongzhou Lin, Julien Mairal, and Zaid Harchaoui · 2018
Closest in time.
The differential inclusion modeling FISTA algorithm and optimality of convergence rate in the case
Apidopoulos Vassilis, Aujol Jean-François, and Dossal Charles · 2018
Closest in time.
Continuous and discrete-time accelerated stochastic mirror descent for strongly convex functions
Pan Xu, Tianhao Wang, and Quanquan Gu · 2018
Closest in time.
Direct Runge–Kutta discretization achieves acceleration
Jingzhao Zhang, Aryan Mokhtari, Suvrit Sra, and Ali Jadbabaie · 2018
Closest in time.