Fetching the paper…
Reading the bibliography…
We consider a broad class of first-order optimization algorithms which are \emph{oblivious}, in the sense that their step sizes are scheduled regardless of the function under consideration, except for limited side-information such as smoothness or strong convexity parameters.
On an algorithm for the minimization of convex functions
A Yu Levin · 1965
Earlier work this paper cites.
Location of the maximum on unimodal surfaces
Donald J Newman · 1965
Earlier work this paper cites.
Problem complexity and method efficiency in optimization. 1983
AS Nemirovsky and DB Yudin · 1983
Earlier work this paper cites.
A method of solving a convex programming problem with convergence rate O (1/k2)
Yurii Nesterov · 1983
Earlier work this paper cites.
Introduction to optimization
Boris T Polyak · 1987
Earlier work this paper cites.
Algorithms and theory of computation handbook
Mikhail J Atallah · 1998
Earlier work this paper cites.
Introductory lectures on convex optimization
Yurii Nesterov · 2004
Earlier work this paper cites.
Numerical optimization
Jorge Nocedal and Stephen Wright · 2006
Cited alongside, same era.
Minimization methods for non-differentiable functions
Naum Zuselevich Shor · 2012
Cited alongside, same era.
Accelerating stochastic gradient descent using predictive variance reduction
Rie Johnson and Tong Zhang · 2013
Cited alongside, same era.
Minimizing finite sums with the stochastic average gradient
Mark Schmidt, Nicolas Le Roux, and Francis Bach · 2013
Cited alongside, same era.
Stochastic dual coordinate ascent methods for regularized loss
Shai Shalev-Shwartz and Tong Zhang · 2013
Cited alongside, same era.
Saga: A fast incremental gradient method with support for non-strongly convex composite objectives
Aaron Defazio, Francis Bach, and Simon Lacoste-Julien · 2014
Analysis and design of optimization algorithms via integral quadratic constraints
Laurent Lessard, Benjamin Recht, and Andrew Packard · 2014
Later among the works it cites.
On lower and upper bounds for smooth and strongly convex optimization problems
Yossi Arjevani, Shai Shalev-Shwartz, and Ohad Shamir · 2015
Later among the works it cites.
From averaging to acceleration, there is only a step-size
Nicolas Flammarion and Francis Bach · 2015
Later among the works it cites.
Roy Frostig, Rong Ge, Sham M Kakade, and Aaron Sidford · 2015
Later among the works it cites.
A universal catalyst for first-order optimization
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Contributions to the Complexity Analysis of Optimization Algorithms
Yoel Drori · 2014
Cited alongside, same era.
Hongzhou Lin, Julien Mairal, and Zaid Harchaoui · 2015
Later among the works it cites.
Shai Shalev-Shwartz · 2015
Later among the works it cites.