Fetching the paper…
Reading the bibliography…
We propose a novel randomized incremental gradient algorithm, namely, VAriance-Reduced Accelerated Gradient (Varag), for finite-sum optimization.
The relaxation method of finding the common point convex sets and its application to the solution of problems in convex programming
L.M. Bregman · 1967
Earlier work this paper cites.
An iterative row-action method for interval convex programming
Yair Censor and Arnold Lent · 1981
Earlier work this paper cites.
Problem complexity and method efficiency in optimization
A. S. Nemirovski and D. Yudin · 1983
Earlier work this paper cites.
Proximal minimization methods with generalized bregman functions
K.C. Kiwiel · 1997
Earlier work this paper cites.
Bregman monotone optimization algorithms
H.H. Bauschke, J.M. Borwein, and P.L. Combettes · 2003
Earlier work this paper cites.
Interior gradient and proximal methods for convex and conic optimization
A. Auslender and M. Teboulle · 2006
Earlier work this paper cites.
A convergent incremental gradient method with a constant step size
D. Blatt, A. Hero, and H. Gauchman · 2007
Earlier work this paper cites.
Robust stochastic approximation approach to stochastic programming
A. S. Nemirovski, A. Juditsky, G. Lan, and A. Shapiro · 2009
Earlier work this paper cites.
Optimal stochastic approximation algorithms for strongly convex stochastic composite optimization, I: a generic algorithmic framework
S. Ghadimi and G. Lan · 2012
Earlier work this paper cites.
An optimal method for stochastic composite optimization
Guanghui Lan · 2012
Cited alongside, same era.
Optimal stochastic approximation algorithms for strongly convex stochastic composite optimization, II: shrinking procedures and optimal algorithms
S. Ghadimi and G. Lan · 2013
Cited alongside, same era.
Accelerating stochastic gradient descent using predictive variance reduction
R. Johnson and T. Zhang · 2013
Cited alongside, same era.
SAGA: A fast incremental gradient method with support for non-strongly convex composite objectives
A. Defazio, F. Bach, and S. Lacoste-Julien · 2014
Cited alongside, same era.
A proximal stochastic gradient method with progressive variance reduction
Lin Xiao and Tong Zhang · 2014
Cited alongside, same era.
Linearly convergent first-order algorithms for semidefinite programming
Cong D Dang, Guanghui Lan, and Zaiwen Wen · 2017
Later among the works it cites.
UCI machine learning repository, 2017
Dheeru Dua and Casey Graff · 2017
Later among the works it cites.
An optimal randomized incremental gradient method
Guanghui Lan and Yi Zhou · 2017
Later among the works it cites.
Minimizing finite sums with the stochastic average gradient
Mark Schmidt, Nicolas Le Roux, and Francis Bach · 2017
Later among the works it cites.
Exploiting strong convexity from data with primal-dual first-order algorithms
Jialei Wang and Lin Xiao · 2017
Later among the works it cites.
Random gradient extrapolation for distributed and stochastic optimization
Guanghui Lan and Yi Zhou · 2018
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
A universal catalyst for first-order optimization
Hongzhou Lin, Julien Mairal, and Zaid Harchaoui · 2015
Cited alongside, same era.
Katyusha: The first direct acceleration of stochastic gradient methods
Zeyuan Allen-Zhu · 2016
Cited alongside, same era.
Improved svrg for non-strongly-convex or sum-of-non-convex objectives
Zeyuan Allen-Zhu and Yang Yuan · 2016
Cited alongside, same era.
Variance-reduced and projection-free stochastic optimization
Elad Hazan and Haipeng Luo · 2016
Cited alongside, same era.
Linear convergence of first order methods for non-strongly convex optimization
Ion Necoara, Yu Nesterov, and Francois Glineur · 2018
Later among the works it cites.
Rest-katyusha: Exploiting the solution’s structure via scheduled restart schemes
Junqi Tang, Mohammad Golbabaee, Francis Bach, et al · 2018
Later among the works it cites.
Andrei Kulunchakov and Julien Mairal · 2019
Closest in time.