Fetching the paper…
Reading the bibliography…
Accelerated algorithms have broad applications in large-scale optimization, due to their generality and fast convergence.
Problem complexity and method efficiency in optimization
Nemirovskii, Arkadii and Yudin, David Borisovich · 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})
Nesterov, Yurii · 1983
Earlier work this paper cites.
Indications of nonlinear deterministic and finite-dimensional structures in time series of brain electrical activity: Dependence on recording region and brain state
Andrzejak, Ralph G, Lehnertz, Klaus, Mormann, Florian, Rieke, Christoph, David, Peter, and Elger, Christian E · 2001
Earlier work this paper cites.
Lectures on modern convex optimization: Analysis, algorithms, and engineering applications
Ben-Tal, Aharon and Nemirovski, Arkadi · 2001
Earlier work this paper cites.
Convex Analysis and Optimization
Bertsekas, Dimitri P, Nedic, Angelia, and Ozdaglar, Asuman E · 2003
Earlier work this paper cites.
Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems
Spielman, Daniel A. and Teng, Shang-Hua · 2004
Earlier work this paper cites.
Smooth minimization of non-smooth functions
Nesterov, Yu · 2005
Earlier work this paper cites.
Smooth optimization with approximate gradient
d’Aspremont, Alexandre · 2008
Earlier work this paper cites.
A fast iterative shrinkage-thresholding algorithm for linear inverse problems
Beck, Amir and Teboulle, Marc · 2009
Earlier work this paper cites.
Optimal stochastic approximation algorithms for strongly convex stochastic composite optimization I: A generic algorithmic framework
Ghadimi, Saeed and Lan, Guanghui · 2012
Earlier work this paper cites.
An optimal method for stochastic composite optimization
Lan, Guanghui · 2012
Earlier work this paper cites.
Measurements-based power control-a cross-layered framework
Birand, Berk, Wang, Howard, Bergman, Keren, and Zussman, Gil · 2013
Earlier work this paper cites.
Optimal stochastic approximation algorithms for strongly convex stochastic composite optimization, II: shrinking procedures and optimal algorithms
Ghadimi, Saeed and Lan, Guanghui · 2013
Earlier work this paper cites.
A simple, combinatorial algorithm for solving SDD systems in nearly-linear time
Kelner, Jonathan A., Orecchia, Lorenzo, Sidford, Aaron, and Zhu, Zeyuan Allen · 2013
Earlier work this paper cites.
UCI machine learning repository, 2013
Lichman, M · 2013
Cited alongside, same era.
Introductory lectures on convex optimization: A basic course
Nesterov, Yurii · 2013
Cited alongside, same era.
On stochastic proximal gradient algorithms
Atchade, Yves F, Fort, Gersende, and Moulines, Eric · 2014
Cited alongside, same era.
Private empirical risk minimization: Efficient algorithms and tight error bounds
Bassily, Raef, Smith, Adam, and Thakurta, Abhradeep · 2014
Cited alongside, same era.
Theory of Convex Optimization for Machine Learning
Bubeck, Sébastien · 2014
Cited alongside, same era.
First-order methods of smooth convex optimization with inexact oracle
Relatively-smooth convex optimization by first-order methods, and applications
Lu, Haihao, Freund, Robert M, and Nesterov, Yurii · 2016
Later among the works it cites.
A variational perspective on accelerated methods in optimization
Wibisono, Andre, Wilson, Ashia C, and Jordan, Michael I · 2016
Later among the works it cites.
Katyusha: The first direct acceleration of stochastic gradient methods
Allen-Zhu, Zeyuan · 2017
Later among the works it cites.
Linear coupling: An ultimate unification of gradient and mirror descent
Allen-Zhu, Zeyuan and Orecchia, Lorenzo · 2017
Later among the works it cites.
The approximate duality gap technique: A unified theory of first-order methods, 2017
Diakonikolas, Jelena and Orecchia, Lorenzo · 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…
Devolder, Olivier, Glineur, François, and Nesterov, Yurii · 2014
Cited alongside, same era.
Robustness versus acceleration
Hardt, Moritz · 2014
Cited alongside, same era.
Nearly-linear time positive LP solver with faster convergence rate
Allen-Zhu, Zeyuan and Orecchia, Lorenzo · 2015
Cited alongside, same era.
A geometric alternative to Nesterov’s accelerated gradient descent
Bubeck, Sébastien, Lee, Yin Tat, and Singh, Mohit · 2015
Cited alongside, same era.
Accelerated mirror descent in continuous and discrete time
Krichene, Walid, Bayen, Alexandre, and Bartlett, Peter L · 2015
Cited alongside, same era.
Stochastic intermediate gradient method for convex problems with stochastic inexact oracle
Dvurechensky, Pavel and Gasnikov, Alexander · 2016
Cited alongside, same era.
Constrained submodular maximization: Beyond 1/e
Ene, A. and Nguyen, H. L · 2016
Cited alongside, same era.
Control interpretations for first-order optimization methods
Hu, Bin and Lessard, Laurent · 2017
Later among the works it cites.
Hu, Bin, Seiler, Peter, and Lessard, Laurent · 2017
Later among the works it cites.
Acceleration and averaging in stochastic descent dynamics
Krichene, Walid and Bartlett, Peter · 2017
Later among the works it cites.
Minimizing finite sums with the stochastic average gradient
Schmidt, Mark, Le Roux, Nicolas, and Bach, Francis · 2017
Later among the works it cites.
Area-convexity, ℓ ∞ \ell_{\infty} regularization, and undirected multicommodity flow
Sherman, Jonah · 2017
Later among the works it cites.
Accelerated extra-gradient descent: A novel, accelerated first-order method
Diakonikolas, Jelena and Orecchia, Lorenzo · 2018
Closest in time.
Universal method for stochastic composite optimization problems
Gasnikov, A. V. and Nesterov, Yu. E · 2018
Closest in time.
Accelerating stochastic gradient descent, 2018
Jain, Prateek, Kakade, Sham M., Kidambi, Rahul, Netrapalli, Praneeth, and Sidford, Aaron · 2018
Closest in time.