Methods › General › Optimization › SAGA
SAGA
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.
Papers archive 2025-07-28
30 shown of 81, newest first. Repository counts are the archive's code-links table. A Syntology line states what Syntology ran from that paper's harvested code; it is per sample and not a correctness claim.
-
Rethinking Verification for LLM Code Generation: From Generation to Testing 9 Jul 2025 · 1 repository · arXiv:2507.06920
-
ATMM-SAGA: Alternating Training for Multi-Module with Score-Aware Gated Attention SASV system 23 May 2025 · 0 repositories · arXiv:2505.18273
-
A digital perspective on the role of a stemma in material-philological transmission studies 11 May 2025 · 0 repositories · arXiv:2505.06938
-
SAGA: A Security Architecture for Governing AI Agentic Systems 27 Apr 2025 · 0 repositories · arXiv:2504.21034Syntology ran 0 of 4 samples · 4 unverified
-
SAGA: Semantic-Aware Gray color Augmentation for Visible-to-Thermal Domain Adaptation across Multi-View Drone and Ground-Based Vision Systems 22 Apr 2025 · 2 repositories · arXiv:2504.15728
-
Variance-Reduced Fast Operator Splitting Methods for Stochastic Generalized Equations 17 Apr 2025 · 0 repositories · arXiv:2504.13046
-
SAGA: Surface-Aligned Gaussian Avatar 1 Dec 2024 · 0 repositories · arXiv:2412.00845
-
On the SAGA algorithm with decreasing step 2 Oct 2024 · 0 repositories · arXiv:2410.03760
-
SAGA: Synthesis Augmentation with Genetic Algorithms for In-Memory Sequence Optimization 14 Jun 2024 · 0 repositories · arXiv:2406.09677
-
Variance-Reduced Fast Krasnoselkii-Mann Methods for Finite-Sum Root-Finding Problems 4 Jun 2024 · 0 repositories · arXiv:2406.02413
-
SPABA: A Single-Loop and Probabilistic Stochastic Bilevel Algorithm Achieving Optimal Sample Complexity 29 May 2024 · 0 repositories · arXiv:2405.18777
-
Segment Any 3D Gaussians 1 Dec 2023 · 0 repositories · arXiv:2312.00860
-
PROMISE: Preconditioned Stochastic Optimization Methods by Incorporating Scalable Curvature Estimates 5 Sep 2023 · 1 repository · arXiv:2309.02014Syntology ran 1 of 2 samples · 1 unverified · 2 pointer-only (licence)
-
Variance reduction techniques for stochastic proximal point algorithms 18 Aug 2023 · 1 repository · arXiv:2308.09310
-
Growing and Serving Large Open-domain Knowledge Graphs 16 May 2023 · 0 repositories · arXiv:2305.09464
-
Attacking the Spike: On the Transferability and Security of Spiking Neural Networks to Adversarial Examples 7 Sep 2022 · 0 repositories · arXiv:2209.03358
-
Tackling Data Heterogeneity: A New Unified Framework for Decentralized SGD with Sample-induced Topology 8 Jul 2022 · 0 repositories · arXiv:2207.03730
-
An Adaptive Incremental Gradient Method With Support for Non-Euclidean Norms 28 Apr 2022 · 0 repositories · arXiv:2205.02273
-
Saga: A Platform for Continuous Construction and Serving of Knowledge At Scale 15 Apr 2022 · 0 repositories · arXiv:2204.07309
-
A framework for bilevel optimization that enables stochastic and global variance reduction algorithms 31 Jan 2022 · 1 repository · arXiv:2201.13409Syntology ran 1 of 2 samples · 1 unverified · 2 pointer-only (licence)
-
SAGA: Stochastic Whole-Body Grasping with Contact 19 Dec 2021 · 1 repository · arXiv:2112.10103Syntology ran 2 of 4 samples · 2 unverified
-
Siamese Attribute-missing Graph Auto-encoder 9 Dec 2021 · 0 repositories · arXiv:2112.04842
-
Surrogate-Assisted Genetic Algorithm for Wrapper Feature Selection 17 Nov 2021 · 1 repository · arXiv:2111.09074
-
ZeroSARAH: Efficient Nonconvex Finite-Sum Optimization with Zero Full Gradient Computations 29 Sep 2021 · 0 repositories
-
ZeroSARAH: Efficient Nonconvex Finite-Sum Optimization with Zero Full Gradient Computation 2 Mar 2021 · 0 repositories · arXiv:2103.01447
-
A New Framework for Variance-Reduced Hamiltonian Monte Carlo 9 Feb 2021 · 0 repositories · arXiv:2102.04613
-
Segmentation and genome annotation algorithms 3 Jan 2021 · 0 repositories · arXiv:2101.00688
-
Tight Lower Complexity Bounds for Strongly Convex Finite-Sum Optimization 17 Oct 2020 · 0 repositories · arXiv:2010.08766
-
Asynchronous Distributed Optimization with Stochastic Delays 22 Sep 2020 · 0 repositories · arXiv:2009.10717
-
Variance Reduced EXTRA and DIGing and Their Optimal Acceleration for Strongly Convex Decentralized Optimization 9 Sep 2020 · 0 repositories · arXiv:2009.04373
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.
Usage over time archive 2025-07-28
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
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