Fetching the paper…
Reading the bibliography…
We propose the stochastic average gradient (SAG) method for optimizing the sum of a finite number of smooth convex functions.
A stochastic approximation method
H. Robbins and S. Monro · 1951
Earlier work this paper cites.
Accelerated stochastic approximation
H. Kesten · 1958
Earlier work this paper cites.
Problem complexity and method efficiency in optimization
A. Nemirovski and D. B. Yudin · 1983
Earlier work this paper cites.
A method for unconstrained convex minimization problem with the rate of convergence O ( 1 / k 2 ) {O}(1/k^{2})
Y. Nesterov · 1983
Earlier work this paper cites.
On the convergence of the coordinate descent method for convex differentiable minimization
Zhi-Quan Luo and Paul Tseng · 1992
Earlier work this paper cites.
Acceleration of stochastic approximation by averaging
B. T. Polyak and A. B. Juditsky · 1992
Earlier work this paper cites.
Accelerated stochastic approximation
B. Delyon and A. Juditsky · 1993
Earlier work this paper cites.
A new class of incremental gradient methods for least squares problems
D. P. Bertsekas · 1997
Earlier work this paper cites.
Incremental gradient algorithms with stepsizes bounded away from zero
M.V. Solodov · 1998
Earlier work this paper cites.
An incremental gradient(-projection) method with momentum term and adaptive stepsize rule
P. Tseng · 1998
Earlier work this paper cites.
Convergence rate of incremental subgradient algorithms
A. Nedic and D. Bertsekas · 2000
Earlier work this paper cites.
Large scale online learning
L. Bottou and Y. LeCun · 2003
Earlier work this paper cites.
Stochastic approximation and recursive algorithms and applications
H. J. Kushner and G. Yin · 2003
Earlier work this paper cites.
KDD-cup 2004: results and analysis
R. Caruana, T. Joachims, and L. Backstrom · 2004
Earlier work this paper cites.
RCV1: A new benchmark collection for text categorization research
D.D. Lewis, Y. Yang, T. Rose, and F. Li · 2004
Earlier work this paper cites.
Introductory lectures on convex optimization: A basic course
Y. Nesterov · 2004
Earlier work this paper cites.
Monte Carlo Statistical Methods
Christian P Robert and George Casella · 2004
Earlier work this paper cites.
Spam corpus creation for TREC
G. V. Cormack and T. R. Lynam · 2005
Earlier work this paper cites.
A modified finite newton method for fast solution of large scale linear svms
S.S. Keerthi and D. DeCoste · 2005
Earlier work this paper cites.
Smooth minimization of non-smooth functions
Yu Nesterov · 2005
Earlier work this paper cites.
minfunc: unconstrained differentiable multivariate optimization in matlab
M. Schmidt · 2005
Earlier work this paper cites.
Numerical Optimization
J. Nocedal and S. J. Wright · 2006
Earlier work this paper cites.
A convergent incremental gradient method with a constant step size
D. Blatt, A. O. Hero, and H. Gauchman · 2007
Earlier work this paper cites.
Gradient methods for minimizing composite objective function
Y. Nesterov · 2007
Earlier work this paper cites.
A scalable modular convex solver for regularized risk minimization
C. H. Teo, Q. Le, A. J. Smola, and S. V. N. Vishwanathan · 2007
Earlier work this paper cites.
Exponentiated gradient algorithms for conditional random fields and max-margin markov networks
M. Collins, A. Globerson, T. Koo, X. Carreras, and P.L. Bartlett · 2008
Earlier work this paper cites.
Sido: A phamacology dataset, 2008
I. Guyon · 2008
Cited alongside, same era.
Sgd-qn: Careful quasi-newton stochastic gradient descent
Antoine Bordes, Léon Bottou, and Patrick Gallinari · 2009
Cited alongside, same era.
New probabilistic inference algorithms that harness the strengths of variational and Monte Carlo methods
P. Carbonetto · 2009
Cited alongside, same era.
Accelerated gradient methods for stochastic optimization and online learning
C. Hu, J.T. Kwok, and W. Pan · 2009
Cited alongside, same era.
Large-scale sparse logistic regression
J. Liu, J. Chen, and J. Ye · 2009
Cited alongside, same era.
Robust stochastic approximation approach to stochastic programming
A. Nemirovski, A. Juditsky, G. Lan, and A. Shapiro · 2009
Cited alongside, same era.
Accelerating stochastic gradient descent using predictive variance reduction
R. Johnson and T Zhang · 2013
Closest in time.
Semi-stochastic gradient descent methods
Jakub Konečnỳ and Peter Richtárik · 2013
Closest in time.
Block-coordinate frank-wolfe optimization for structural svms
S. Lacoste-Julien, M. Jaggi, M. Schmidt, and P. Pletscher · 2013
Closest in time.
Mixedgrad: An o ( 1 / t CLOSE o(1/t ) convergence rate algorithm for stochastic smooth optimization
M. Mahdavi and R. Jin · 2013
Closest in time.
Optimization with first-order surrogate functions
Julien Mairal · 2013
Closest in time.
Fast convergence of stochastic gradient descent under a strong growth condition
M. Schmidt and N. Le Roux · 2013
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Primal-dual subgradient methods for convex problems
Y. Nesterov · 2009
Cited alongside, same era.
A randomized kaczmarz algorithm with exponential convergence
T. Strohmer and R. Vershynin · 2009
Cited alongside, same era.
Variable metric stochastic approximation theory
P. Sunehag, J. Trumpf, SVN Vishwanathan, and N. Schraudolph · 2009
Cited alongside, same era.
UCI machine learning repository, 2010
A. Frank and A. Asuncion · 2010
Cited alongside, same era.
Optimal stochastic approximation algorithms for strongly convex stochastic composite optimization
S. Ghadimi and G. Lan · 2010
Cited alongside, same era.
Deep learning via Hessian-free optimization
J. Martens · 2010
Cited alongside, same era.
Accelerated mini-batch stochastic dual coordinate ascent
Shai Shalev-Shwartz and Tong Zhang · 2013
Closest in time.
Variance reduction for stochastic gradient optimization
Chong Wang, Xi Chen, Alex Smola, and Eric Xing · 2013
Closest in time.
Linear convergence with condition number independent access of full gradients
Lijun Zhang, Mehrdad Mahdavi, and Rong Jin · 2013
Closest in time.
A lower bound for the optimization of finite sums
A. Agarwal and L. Bottou · 2014
Closest in time.
Linear convergence of variance-reduced projected stochastic gradient without strong convexity
Pinghua Gong and Jieping Ye · 2014
Closest in time.
Semi-stochastic coordinate descent
Jakub Konečnỳ, Zheng Qu, and Peter Richtárik · 2014
Closest in time.
An accelerated proximal coordinate gradient method and its application to regularized empirical risk minimization
Qihang Lin, Zhaosong Lu, and Lin Xiao · 2014
Closest in time.
Incremental majorization-minimization optimization with application to large-scale machine learning
Julien Mairal · 2014
Closest in time.
Stochastic gradient descent, weighted sampling, and the randomized Kaczmarz algorithm
D. Needell, N. Srebro, and R. Ward · 2014
Closest in time.
Stochastic proximal gradient descent with acceleration techniques
Atsushi Nitanda · 2014
Closest in time.
Randomized dual coordinate ascent with arbitrary sampling
Zheng Qu, Peter Richtárik, and Tong Zhang · 2014
Closest in time.
Accelerated proximal stochastic dual coordinate ascent for regularized loss minimization
S. Shalev-Schwartz and T. Zhang · 2014
Closest in time.
Fast large-scale optimization by unifying stochastic gradient and quasi-newton methods
Jascha Sohl-Dickstein, Ben Poole, and Surya Ganguli · 2014
Closest in time.
Stochastic dual coordinate ascent with alternating direction method of multipliers
Taiji Suzuki · 2014
Closest in time.
A proximal stochastic gradient method with progressive variance reduction
Lin Xiao and Tong Zhang · 2014
Closest in time.
Stochastic primal-dual coordinate method for regularized empirical risk minimization
Yuchen Zhang and Lin Xiao · 2014
Closest in time.
Stochastic optimization with importance sampling
Peilin Zhao and Tong Zhang · 2014
Closest in time.
Fast stochastic alternating direction method of multipliers
L.W. Zhong and J.T. Kwok · 2014
Closest in time.
Non-uniform stochastic average gradient method for training conditional random fields
M. Schmidt, R. Babanezhad, M.O. Ahemd, A. Clifton, and A. Sarkar · 2015
Closest in time.