SAGA: A Fast Incremental Gradient Method With Support for Non-Strongly Convex Composite Objectives

Abstract

In this work we introduce a new optimisation method called SAGA in the spirit of SAG, SDCA, MISO and SVRG, a set of recently proposed incremental gradient algorithms with fast linear convergence rates. SAGA improves on the theory behind SAG and SVRG, with better theoretical convergence rates, and has support for composite objectives where a proximal operator is used on the regulariser. Unlike SDCA, SAGA supports non-strongly convex problems directly, and is adaptive to any inherent strong convexity of the problem. We give experimental results showing the effectiveness of our method.

Extracted Key Phrases

2 Figures and Tables

05010015020142015201620172018
Citations per Year

320 Citations

Semantic Scholar estimates that this publication has 320 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@inproceedings{Defazio2014SAGAAF, title={SAGA: A Fast Incremental Gradient Method With Support for Non-Strongly Convex Composite Objectives}, author={Aaron Defazio and Francis R. Bach and Simon Lacoste-Julien}, booktitle={NIPS}, year={2014} }