Fetching the paper…
Reading the bibliography…
We study the conditions under which one is able to efficiently apply variance-reduction and acceleration schemes on finite sum optimization problems.
A new class of incremental gradient methods for least squares problems
Dimitri P Bertsekas · 1997
Earlier work this paper cites.
Introductory lectures on convex optimization
Yurii Nesterov · 2004
Earlier work this paper cites.
A convergent incremental gradient method with a constant step size
Doron Blatt, Alfred O Hero, and Hillel Gauchman · 2007
Earlier work this paper cites.
Training invariant support vector machines using selective sampling
Gaëlle Loosli, Stéphane Canu, and Léon Bottou · 2007
Earlier work this paper cites.
Information-theoretic lower bounds on the oracle complexity of convex optimization
Alekh Agarwal, Martin J Wainwright, Peter L Bartlett, and Pradeep K Ravikumar · 2009
Earlier work this paper cites.
Information-based complexity, feedback and dynamics in convex programming
Maxim Raginsky and Alexander Rakhlin · 2011
Earlier work this paper cites.
Elements of information theory
Thomas M Cover and Joy A Thomas · 2012
Earlier work this paper cites.
Efficiency of coordinate descent methods on huge-scale optimization problems
Yu Nesterov · 2012
Earlier work this paper cites.
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
Cited alongside, same era.
An optimal randomized incremental gradient method
Guanghui Lan · 2015
Cited alongside, same era.
A universal catalyst for first-order optimization
On the iteration complexity of oblivious first-order optimization algorithms
Yossi Arjevani and Ohad Shamir · 2016
Later among the works it cites.
Oracle complexity of second-order methods for finite-sum problems
Yossi Arjevani and Ohad Shamir · 2016
Later among the works it cites.
Improved svrg for non-strongly-convex or sum-of-non-convex objectives
Zeyuan Allen-Zhu and Yang Yuan · 2016
Later among the works it cites.
Stochastic optimization with variance reduction for infinite datasets with finite-sum structure
Alberto Bietti and Julien Mairal · 2016
Later among the works it cites.
Accelerated stochastic gradient descent for minimizing finite sums
Atsushi Nitanda · 2016
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Hongzhou Lin, Julien Mairal, and Zaid Harchaoui · 2015
Cited alongside, same era.
Shai Shalev-Shwartz · 2015
Cited alongside, same era.
Dimension-free iteration complexity of finite sum optimization problems
Yossi Arjevani and Ohad Shamir · 2016
Cited alongside, same era.
Accelerated proximal stochastic dual coordinate ascent for regularized loss minimization
Shai Shalev-Shwartz and Tong Zhang · 2016
Later among the works it cites.
Tight complexity bounds for optimizing composite objectives
Blake E Woodworth and Nati Srebro · 2016
Later among the works it cites.