Methods › General › Optimization › SAGA

SAGA

81 papers tagged archive 2025-07-28

Introduced by Aaron Defazio et al. in SAGA: A Fast Incremental Gradient Method With Support for Non-Strongly Convex Composite Objectives

archive 2025-07-28 Description, source and code snippet are the archive's method entry.

SAGA is a method 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.

PaperSource

In Syntology about another paper, arXiv:2504.21034: repository known, no verified implementation (declared_code; repositories: 2 listed of 2 in the graph, strongest link: listed only). About another paper: this answer is about arXiv:2504.21034, while the archive credits arXiv:1407.0202.

From the lookup's note on this name: The same name also belongs to the paper “SAGA: A Fast Incremental Gradient Method With Support for Non-Strongly Convex Composite Objectives” (arXiv:1407.0202, 2,023 citations), which the lookup finds cited far more than the paper this answer is about (citations not recorded), so this answer may be about a different sense of the name. For arXiv:1407.0202: its page on this site · ask the lookup about it.

Origin paper of this answer, arXiv:2504.21034 (its page on this site · its page on Syntology): Syntology's run record for its harvested code, 2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified (of 4 harvested samples). The instrument figure counts failures of Syntology's instrument, not of the code. Ran means executed on a synthesized input, not that the code is correct.

Syntology's have check for this name (free, it answers coverage only), read 2026-10-05; ask it again live. A level is the served verification level of that one answer; nothing here is summed across methods.

Papers archive 2025-07-28

archive papers tagged: 81 · with a code link: 15 · where Syntology ran a sample: 5 (4 with a run with no instrument failure, 1 where every run was a failure of Syntology's instrument) Syntology

Show: all tagged papersonly where code ran (5 of 81 tagged: 4 with a run with no instrument failure, 1 where every run was a failure of Syntology's instrument)

Page 1 of 1: papers 1 to 81 of 81, newest first by the archive's date (ties by slug), in archive order.

Repository counts are the archive's code-links table. A Syntology line states what Syntology ran from that paper's harvested code, as “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the instrument figure counts failures of Syntology's instrument, not of the code. It is per sample and not a correctness claim. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code; “community repositories only” when every sample that ran came from a community repository, “official: no sample here; runs from other or unrecorded repositories” when some came from a repository the paper names or has in its text, or from none recorded); hover it for the repositories the samples that ran came from.

Tasks archive 2025-07-28

20 shown of 39 tasks the archive attaches to papers tagged with this method, by distinct papers. A task without a page in the catalog is plain text.

TaskPapers
Stochastic Optimization11
BIG-bench Machine Learning7
Distributed Optimization3
Federated Learning3
Bilevel Optimization2
Segmentation2
3DGS1
Adversarial Attack1
Attribute1
Autonomous Driving1
Clustering1
Code Generation1
Computational Efficiency1
Data Augmentation1
Distributed Computing1
Domain Adaptation1
Dynamic Reconstruction1
Entity Linking1
Fact Verification1
Graph Representation Learning1

Usage over time archive 2025-07-28

Papers per year tagged with SAGA: 2014 to 2025, peak 13 13 0 2014: 1 paper 2014 2015: 5 papers 2015 2016: 4 papers 2016 2017: 13 papers 2017 2018: 12 papers 2018 2019: 12 papers 2019 2020: 7 papers 2020 2021: 7 papers 2021 2022: 5 papers 2022 2023: 4 papers 2023 2024: 5 papers 2024 2025: 6 papers 2025
Papers per year the archive tags with this method, by the paper's archive date (81 dated). Bars are counts, not a trend claim.

Components: the archive holds no method-to-method composition, so PwC's Components table cannot be rebuilt; the Papers list carries no Results column for the same reason (the archive does not join its leaderboard rows to method tags).

Categories archive 2025-07-28

Optimization

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