Papers › SAGA: A Fast Incremental Gradient Method With Support for Non-Strongly Convex...

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

1 Jul 2014NeurIPS 2014 12arXiv:1407.0202archive 2025-07-28

Aaron Defazio, Francis Bach, Simon Lacoste-Julien

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.

PaperPDFConference PDFCode

In Syntology View this paper on Syntology, its page in Syntology's graph. That page lists the repositories linked to the paper, the abstract and the calls for agents.

Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, on Syntology's MCP service (how to connect):

Code

PrzemyslawRys/Logistic-Regression-Lasso-Optimization mentioned on GitHubSyntology: not harvested report
kilianFatras/variance_reduced_neural_networks mentioned on GitHubpytorchSyntology: not harvested report
adefazio/point-saga MITSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to A Simple Practical Accelerated Method for Finite Sums (arXiv:1602.02442; that paper's own run record: 0 ran · 1 unverified); nothing checks that they implement this paper's method. report
scikit-learn-contrib/lightning Syntology: not harvested report
scikit-learn/scikit-learn Syntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to Scikit-learn: Machine Learning in Python (arXiv:1201.0490; that paper's own run record: 1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified); nothing checks that they implement this paper's method. report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

A paper named beside a repository with no sample linked to this paper is shown with that paper's own run record, not this paper's: “ran” means executed on a synthesized input, not that the code is correct, and “where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Papers are listed in arXiv-id order, at most three per repository.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

Introduced by this paper: SAGA

SAGA

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections