Minimizing finite sums with the stochastic average gradient

We analyze the stochastic average gradient (SAG) method for optimizing the sum of a finite number of smooth convex functions. Like stochastic gradient (SG) methods, the SAG method’s iteration cost is independent of the number of terms in the sum. However, by incorporating a memory of previous gradie...

Full description

Saved in:

Bibliographic Details
Published in:	Mathematical programming Vol. 162; no. 1-2; pp. 83 - 112
Main Authors:	Schmidt, Mark, Le Roux, Nicolas, Bach, Francis
Format:	Journal Article
Language:	English
Published:	Berlin/Heidelberg Springer Berlin Heidelberg 01.03.2017 Springer Nature B.V Springer Verlag
Subjects:	Algorithms Calculus of Variations and Optimal Control; Optimization Combinatorics Computation Computer Science Convergence Convex analysis Full Length Paper Machine Learning Mathematical analysis Mathematical and Computational Physics Mathematical Methods in Physics Mathematical models Mathematics Mathematics and Statistics Mathematics of Computing Methods Numerical Analysis Optimization Optimization and Control Regression analysis Sag Sampling Statistics Stochasticity Strategy Studies Texts Theoretical 68Q25 90C30 65K05 Convex optimization 90C25 90C06 Stochastic gradient methods 90C15 Convergence Rates First-order methods 62L20 Stochastic Gradient Convex Optimization
ISSN:	0025-5610, 1436-4646
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!