{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/method/saga","slug":"saga","name":"SAGA","full_name":"SAGA","full_name_withheld":false,"description_markdown":"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.","description_state":"present","introduced_year":null,"introduced_by":{"title":"SAGA: A Fast Incremental Gradient Method With Support for Non-Strongly Convex Composite Objectives","paper":"/paper/saga-a-fast-incremental-gradient-method-with","first_author":"Aaron Defazio","n_authors":3,"url_abs":null,"archive_paper_url":"https://paperswithcode.com/paper/saga-a-fast-incremental-gradient-method-with"},"source":{"url":"http://arxiv.org/abs/1407.0202v3","title":"SAGA: A Fast Incremental Gradient Method With Support for Non-Strongly Convex Composite Objectives","url_on_a_paper_host":true},"code_snippet_url":null,"code_snippet_url_on_a_code_host":false,"categories":[{"area":"General","area_id":"general","collection":"Optimization","url":"/methods/category/optimization","pwc_aliases":[]}],"n_papers_tagged":81,"archive_num_papers":81,"papers_newest_first":[{"paper":"/paper/rethinking-verification-for-llm-code","slug":"rethinking-verification-for-llm-code","title":"Rethinking Verification for LLM Code Generation: From Generation to Testing","date":"2025-07-09","arxiv_id":"2507.06920","n_code_links":1,"syntology":null},{"paper":null,"slug":"atmm-saga-alternating-training-for-multi","title":"ATMM-SAGA: Alternating Training for Multi-Module with Score-Aware Gated Attention SASV system","date":"2025-05-23","arxiv_id":"2505.18273","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-digital-perspective-on-the-role-of-a-stemma","title":"A digital perspective on the role of a stemma in material-philological transmission studies","date":"2025-05-11","arxiv_id":"2505.06938","n_code_links":0,"syntology":null},{"paper":"/paper/saga-a-security-architecture-for-governing-ai","slug":"saga-a-security-architecture-for-governing-ai","title":"SAGA: A Security Architecture for Governing AI Agentic Systems","date":"2025-04-27","arxiv_id":"2504.21034","n_code_links":0,"syntology":{"ran":2,"of":4,"n_ran_checked":2,"n_instrument":0,"unverified":2,"pointer_only":0,"phrase":"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","official":null}},{"paper":"/paper/saga-semantic-aware-gray-color-augmentation","slug":"saga-semantic-aware-gray-color-augmentation","title":"SAGA: Semantic-Aware Gray color Augmentation for Visible-to-Thermal Domain Adaptation across Multi-View Drone and Ground-Based Vision Systems","date":"2025-04-22","arxiv_id":"2504.15728","n_code_links":2,"syntology":null},{"paper":null,"slug":"variance-reduced-fast-operator-splitting","title":"Variance-Reduced Fast Operator Splitting Methods for Stochastic Generalized Equations","date":"2025-04-17","arxiv_id":"2504.13046","n_code_links":0,"syntology":null},{"paper":null,"slug":"saga-surface-aligned-gaussian-avatar","title":"SAGA: Surface-Aligned Gaussian Avatar","date":"2024-12-01","arxiv_id":"2412.00845","n_code_links":0,"syntology":null},{"paper":null,"slug":"on-the-saga-algorithm-with-decreasing-step","title":"On the SAGA algorithm with decreasing step","date":"2024-10-02","arxiv_id":"2410.03760","n_code_links":0,"syntology":null},{"paper":null,"slug":"saga-synthesis-augmentation-with-genetic","title":"SAGA: Synthesis Augmentation with Genetic Algorithms for In-Memory Sequence Optimization","date":"2024-06-14","arxiv_id":"2406.09677","n_code_links":0,"syntology":null},{"paper":null,"slug":"accelerated-variance-reduced-forward","title":"Variance-Reduced Fast Krasnoselkii-Mann Methods for Finite-Sum Root-Finding Problems","date":"2024-06-04","arxiv_id":"2406.02413","n_code_links":0,"syntology":null},{"paper":null,"slug":"spaba-a-single-loop-and-probabilistic","title":"SPABA: A Single-Loop and Probabilistic Stochastic Bilevel Algorithm Achieving Optimal Sample Complexity","date":"2024-05-29","arxiv_id":"2405.18777","n_code_links":0,"syntology":null},{"paper":null,"slug":"segment-any-3d-gaussians","title":"Segment Any 3D Gaussians","date":"2023-12-01","arxiv_id":"2312.00860","n_code_links":0,"syntology":null},{"paper":"/paper/promise-preconditioned-stochastic","slug":"promise-preconditioned-stochastic","title":"PROMISE: Preconditioned Stochastic Optimization Methods by Incorporating Scalable Curvature Estimates","date":"2023-09-05","arxiv_id":"2309.02014","n_code_links":1,"syntology":{"ran":1,"of":2,"n_ran_checked":1,"n_instrument":0,"unverified":1,"pointer_only":2,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","official":{"repos":["udellgroup/promise"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/variance-reduction-techniques-for-stochastic","slug":"variance-reduction-techniques-for-stochastic","title":"Variance reduction techniques for stochastic proximal point algorithms","date":"2023-08-18","arxiv_id":"2308.09310","n_code_links":1,"syntology":null},{"paper":null,"slug":"growing-and-serving-large-open-domain","title":"Growing and Serving Large Open-domain Knowledge Graphs","date":"2023-05-16","arxiv_id":"2305.09464","n_code_links":0,"syntology":null},{"paper":null,"slug":"securing-the-spike-on-the-transferabilty-and","title":"Attacking the Spike: On the Transferability and Security of Spiking Neural Networks to Adversarial Examples","date":"2022-09-07","arxiv_id":"2209.03358","n_code_links":0,"syntology":null},{"paper":null,"slug":"tackling-data-heterogeneity-a-new-unified","title":"Tackling Data Heterogeneity: A New Unified Framework for Decentralized SGD with Sample-induced Topology","date":"2022-07-08","arxiv_id":"2207.03730","n_code_links":0,"syntology":null},{"paper":null,"slug":"an-adaptive-incremental-gradient-method-with","title":"An Adaptive Incremental Gradient Method With Support for Non-Euclidean Norms","date":"2022-04-28","arxiv_id":"2205.02273","n_code_links":0,"syntology":null},{"paper":null,"slug":"saga-a-platform-for-continuous-construction","title":"Saga: A Platform for Continuous Construction and Serving of Knowledge At Scale","date":"2022-04-15","arxiv_id":"2204.07309","n_code_links":0,"syntology":null},{"paper":"/paper/a-framework-for-bilevel-optimization-that","slug":"a-framework-for-bilevel-optimization-that","title":"A framework for bilevel optimization that enables stochastic and global variance reduction algorithms","date":"2022-01-31","arxiv_id":"2201.13409","n_code_links":1,"syntology":{"ran":1,"of":2,"n_ran_checked":0,"n_instrument":1,"unverified":1,"pointer_only":2,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","official":{"repos":["benchopt/benchmark_bilevel"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/saga-stochastic-whole-body-grasping-with","slug":"saga-stochastic-whole-body-grasping-with","title":"SAGA: Stochastic Whole-Body Grasping with Contact","date":"2021-12-19","arxiv_id":"2112.10103","n_code_links":1,"syntology":{"ran":3,"of":4,"n_ran_checked":2,"n_instrument":1,"unverified":1,"pointer_only":2,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","official":null}},{"paper":null,"slug":"siamese-attribute-missing-graph-auto-encoder","title":"Siamese Attribute-missing Graph Auto-encoder","date":"2021-12-09","arxiv_id":"2112.04842","n_code_links":0,"syntology":null},{"paper":"/paper/surrogate-assisted-genetic-algorithm-for","slug":"surrogate-assisted-genetic-algorithm-for","title":"Surrogate-Assisted Genetic Algorithm for Wrapper Feature Selection","date":"2021-11-17","arxiv_id":"2111.09074","n_code_links":1,"syntology":null},{"paper":null,"slug":"zerosarah-efficient-nonconvex-finite-sum-1","title":"ZeroSARAH: Efficient Nonconvex Finite-Sum Optimization with Zero Full Gradient Computations","date":"2021-09-29","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"zerosarah-efficient-nonconvex-finite-sum","title":"ZeroSARAH: Efficient Nonconvex Finite-Sum Optimization with Zero Full Gradient Computation","date":"2021-03-02","arxiv_id":"2103.01447","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-new-framework-for-variance-reduced","title":"A New Framework for Variance-Reduced Hamiltonian Monte Carlo","date":"2021-02-09","arxiv_id":"2102.04613","n_code_links":0,"syntology":null},{"paper":null,"slug":"segmentation-and-genome-annotation-algorithms","title":"Segmentation and genome annotation algorithms","date":"2021-01-03","arxiv_id":"2101.00688","n_code_links":0,"syntology":null},{"paper":null,"slug":"tight-lower-complexity-bounds-for-strongly","title":"Tight Lower Complexity Bounds for Strongly Convex Finite-Sum Optimization","date":"2020-10-17","arxiv_id":"2010.08766","n_code_links":0,"syntology":null},{"paper":null,"slug":"asynchronous-distributed-optimization-with","title":"Asynchronous Distributed Optimization with Stochastic Delays","date":"2020-09-22","arxiv_id":"2009.10717","n_code_links":0,"syntology":null},{"paper":null,"slug":"optimal-accelerated-variance-reduced-extra","title":"Variance Reduced EXTRA and DIGing and Their Optimal Acceleration for Strongly Convex Decentralized Optimization","date":"2020-09-09","arxiv_id":"2009.04373","n_code_links":0,"syntology":null},{"paper":null,"slug":"privacy-preserving-asynchronous-federated","title":"Privacy-Preserving Asynchronous Federated Learning Algorithms for Multi-Party Vertically Collaborative Learning","date":"2020-08-14","arxiv_id":"2008.06233","n_code_links":0,"syntology":null},{"paper":null,"slug":"langevin-monte-carlo-random-coordinate","title":"Langevin Monte Carlo: random coordinate descent and variance reduction","date":"2020-07-26","arxiv_id":"2007.14209","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-unified-analysis-of-stochastic-gradient","title":"A Unified Analysis of Stochastic Gradient Methods for Nonconvex Federated Optimization","date":"2020-06-12","arxiv_id":"2006.07013","n_code_links":0,"syntology":null},{"paper":null,"slug":"sampling-and-update-frequencies-in-proximal","title":"Sampling and Update Frequencies in Proximal Variance-Reduced Stochastic Gradient Methods","date":"2020-02-13","arxiv_id":"2002.05545","n_code_links":0,"syntology":null},{"paper":null,"slug":"federated-variance-reduced-stochastic","title":"Federated Variance-Reduced Stochastic Gradient Descent with Robustness to Byzantine Attacks","date":"2019-12-29","arxiv_id":"1912.12716","n_code_links":0,"syntology":null},{"paper":null,"slug":"on-the-global-convergence-of-fast-incremental","title":"On the Global Convergence of (Fast) Incremental Expectation Maximization Methods","date":"2019-10-28","arxiv_id":"1910.12521","n_code_links":0,"syntology":null},{"paper":null,"slug":"variance-reduced-decentralized-stochastic","title":"Variance-Reduced Decentralized Stochastic Optimization with Gradient Tracking -- Part II: GT-SVRG","date":"2019-10-08","arxiv_id":"1910.04057","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-stochastic-proximal-point-algorithm-for","title":"A Stochastic Proximal Point Algorithm for Saddle-Point Problems","date":"2019-09-13","arxiv_id":"1909.06946","n_code_links":0,"syntology":null},{"paper":null,"slug":"async-asynchronous-machine-learning-on","title":"ASYNC: A Cloud Engine with Asynchrony and History for Distributed Machine Learning","date":"2019-07-19","arxiv_id":"1907.08526","n_code_links":0,"syntology":null},{"paper":null,"slug":"estimate-sequences-for-variance-reduced","title":"Estimate Sequences for Variance-Reduced Stochastic Composite Optimization","date":"2019-05-07","arxiv_id":"1905.02374","n_code_links":0,"syntology":null},{"paper":null,"slug":"svag-unified-convergence-results-for-sag-saga","title":"Cocoercivity, Smoothness and Bias in Variance-Reduced Stochastic Gradient Methods","date":"2019-03-21","arxiv_id":"1903.09009","n_code_links":0,"syntology":null},{"paper":null,"slug":"faster-gradient-free-proximal-stochastic","title":"Faster Gradient-Free Proximal Stochastic Methods for Nonconvex Nonsmooth Optimization","date":"2019-02-16","arxiv_id":"1902.06158","n_code_links":0,"syntology":null},{"paper":"/paper/optimal-mini-batch-and-step-sizes-for-saga","slug":"optimal-mini-batch-and-step-sizes-for-saga","title":"Optimal mini-batch and step sizes for SAGA","date":"2019-01-31","arxiv_id":"1902.00071","n_code_links":2,"syntology":null},{"paper":null,"slug":"99-of-parallel-optimization-is-inevitably-a","title":"99% of Distributed Optimization is a Waste of Time: The Issue and How to Fix it","date":"2019-01-27","arxiv_id":"1901.09437","n_code_links":0,"syntology":null},{"paper":null,"slug":"estimate-sequences-for-stochastic-composite","title":"Estimate Sequences for Stochastic Composite Optimization: Variance Reduction, Acceleration, and Robustness to Noise","date":"2019-01-25","arxiv_id":"1901.08788","n_code_links":0,"syntology":null},{"paper":null,"slug":"saga-with-arbitrary-sampling","title":"SAGA with Arbitrary Sampling","date":"2019-01-24","arxiv_id":"1901.08669","n_code_links":0,"syntology":null},{"paper":null,"slug":"stochastic-primal-dual-method-for-empirical","title":"Stochastic Primal-Dual Method for Empirical Risk Minimization with O(1) Per-Iteration Complexity","date":"2018-12-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"stochastic-primal-dual-method-for-empirical-1","title":"Stochastic Primal-Dual Method for Empirical Risk Minimization with $\\mathcal{O}(1)$ Per-Iteration Complexity","date":"2018-11-03","arxiv_id":"1811.01182","n_code_links":0,"syntology":null},{"paper":null,"slug":"fast-variance-reduction-method-with","title":"Fast Variance Reduction Method with Stochastic Batch Size","date":"2018-08-07","arxiv_id":"1808.02169","n_code_links":0,"syntology":null},{"paper":"/paper/local-convergence-properties-of-sagaprox-svrg","slug":"local-convergence-properties-of-sagaprox-svrg","title":"Local Convergence Properties of SAGA/Prox-SVRG and Acceleration","date":"2018-07-01","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":null,"slug":"direct-acceleration-of-saga-using-sampled","title":"Direct Acceleration of SAGA using Sampled Negative Momentum","date":"2018-06-28","arxiv_id":"1806.11048","n_code_links":0,"syntology":null},{"paper":null,"slug":"lightweight-stochastic-optimization-for","title":"Lightweight Stochastic Optimization for Minimizing Finite Sums with Infinite Data","date":"2018-06-08","arxiv_id":"1806.02927","n_code_links":0,"syntology":null},{"paper":"/paper/nonlinear-acceleration-of-cnns","slug":"nonlinear-acceleration-of-cnns","title":"Nonlinear Acceleration of CNNs","date":"2018-06-01","arxiv_id":"1806.00370","n_code_links":1,"syntology":{"ran":3,"of":3,"n_ran_checked":3,"n_instrument":0,"unverified":0,"pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["windows7lover/RegularizedNonlinearAcceleration"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"sucag-stochastic-unbiased-curvature-aided","title":"SUCAG: Stochastic Unbiased Curvature-aided Gradient Method for Distributed Optimization","date":"2018-03-22","arxiv_id":"1803.08198","n_code_links":0,"syntology":null},{"paper":null,"slug":"guaranteed-sufficient-decrease-for-stochastic","title":"Guaranteed Sufficient Decrease for Stochastic Variance Reduced Gradient Optimization","date":"2018-02-26","arxiv_id":"1802.09933","n_code_links":0,"syntology":null},{"paper":null,"slug":"on-the-theory-of-variance-reduction-for","title":"On the Theory of Variance Reduction for Stochastic Gradient Monte Carlo","date":"2018-02-15","arxiv_id":"1802.05431","n_code_links":0,"syntology":null},{"paper":null,"slug":"faster-learning-by-reduction-of-data-access","title":"Faster Learning by Reduction of Data Access Time","date":"2018-01-18","arxiv_id":"1801.05931","n_code_links":0,"syntology":null},{"paper":null,"slug":"improved-asynchronous-parallel-optimization","title":"Improved asynchronous parallel optimization analysis for stochastic incremental methods","date":"2018-01-11","arxiv_id":"1801.03749","n_code_links":0,"syntology":null},{"paper":"/paper/catalyst-acceleration-for-first-order-convex","slug":"catalyst-acceleration-for-first-order-convex","title":"Catalyst Acceleration for First-order Convex Optimization: from Theory to Practice","date":"2017-12-15","arxiv_id":"1712.05654","n_code_links":1,"syntology":null},{"paper":null,"slug":"nonlinear-acceleration-of-stochastic","title":"Nonlinear Acceleration of Stochastic Algorithms","date":"2017-12-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"duality-free-methods-for-stochastic","title":"Duality-free Methods for Stochastic Composition Optimization","date":"2017-10-26","arxiv_id":"1710.09554","n_code_links":0,"syntology":null},{"paper":null,"slug":"stochastic-optimization-with-bandit-sampling","title":"Stochastic Optimization with Bandit Sampling","date":"2017-08-08","arxiv_id":"1708.02544","n_code_links":0,"syntology":null},{"paper":null,"slug":"variance-reduced-stochastic-learning-by","title":"Variance-Reduced Stochastic Learning by Networked Agents under Random Reshuffling","date":"2017-08-04","arxiv_id":"1708.01384","n_code_links":0,"syntology":null},{"paper":null,"slug":"variance-reduced-stochastic-learning-under","title":"Variance-Reduced Stochastic Learning under Random Reshuffling","date":"2017-08-04","arxiv_id":"1708.01383","n_code_links":0,"syntology":null},{"paper":"/paper/breaking-the-nonsmooth-barrier-a-scalable","slug":"breaking-the-nonsmooth-barrier-a-scalable","title":"Breaking the Nonsmooth Barrier: A Scalable Parallel Method for Composite Optimization","date":"2017-07-20","arxiv_id":"1707.06468","n_code_links":1,"syntology":null},{"paper":null,"slug":"a-unified-analysis-of-stochastic-optimization","title":"A Unified Analysis of Stochastic Optimization Methods Using Jump System Theory and Quadratic Constraints","date":"2017-06-25","arxiv_id":"1706.08141","n_code_links":0,"syntology":null},{"paper":null,"slug":"distributed-saga-maintaining-linear","title":"Distributed SAGA: Maintaining linear convergence rate with limited communication","date":"2017-05-29","arxiv_id":"1705.10405","n_code_links":0,"syntology":null},{"paper":null,"slug":"catalyst-acceleration-for-gradient-based-non","title":"Catalyst Acceleration for Gradient-Based Non-Convex Optimization","date":"2017-03-31","arxiv_id":"1703.10993","n_code_links":0,"syntology":null},{"paper":null,"slug":"guaranteed-sufficient-decrease-for-variance","title":"Guaranteed Sufficient Decrease for Variance Reduced Stochastic Gradient Descent","date":"2017-03-20","arxiv_id":"1703.06807","n_code_links":0,"syntology":null},{"paper":null,"slug":"sarah-a-novel-method-for-machine-learning","title":"SARAH: A Novel Method for Machine Learning Problems Using Stochastic Recursive Gradient","date":"2017-03-01","arxiv_id":"1703.00102","n_code_links":0,"syntology":null},{"paper":null,"slug":"saga-and-restricted-strong-convexity","title":"SAGA and Restricted Strong Convexity","date":"2017-02-19","arxiv_id":"1702.05683","n_code_links":0,"syntology":null},{"paper":null,"slug":"dimension-free-iteration-complexity-of-finite","title":"Dimension-Free Iteration Complexity of Finite Sum Optimization Problems","date":"2016-06-30","arxiv_id":"1606.09333","n_code_links":0,"syntology":null},{"paper":"/paper/asaga-asynchronous-parallel-saga","slug":"asaga-asynchronous-parallel-saga","title":"ASAGA: Asynchronous Parallel SAGA","date":"2016-06-15","arxiv_id":"1606.04809","n_code_links":1,"syntology":null},{"paper":null,"slug":"fast-incremental-method-for-nonconvex","title":"Fast Incremental Method for Nonconvex Optimization","date":"2016-03-19","arxiv_id":"1603.06159","n_code_links":0,"syntology":null},{"paper":"/paper/a-simple-practical-accelerated-method-for","slug":"a-simple-practical-accelerated-method-for","title":"A Simple Practical Accelerated Method for Finite Sums","date":"2016-02-08","arxiv_id":"1602.02442","n_code_links":1,"syntology":{"ran":0,"of":1,"n_ran_checked":0,"n_instrument":0,"unverified":1,"pointer_only":0,"phrase":"0 ran · 1 unverified","official":{"repos":["adefazio/point-saga"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"paper":null,"slug":"speed-learning-on-the-fly","title":"Speed learning on the fly","date":"2015-11-08","arxiv_id":"1511.02540","n_code_links":0,"syntology":null},{"paper":null,"slug":"new-optimisation-methods-for-machine-learning","title":"New Optimisation Methods for Machine Learning","date":"2015-10-09","arxiv_id":"1510.02533","n_code_links":0,"syntology":null},{"paper":null,"slug":"on-variance-reduction-in-stochastic-gradient","title":"On Variance Reduction in Stochastic Gradient Descent and its Asynchronous Variants","date":"2015-06-23","arxiv_id":"1506.06840","n_code_links":0,"syntology":null},{"paper":null,"slug":"variance-reduced-stochastic-gradient-descent-1","title":"Variance Reduced Stochastic Gradient Descent with Neighbors","date":"2015-06-11","arxiv_id":"1506.03662","n_code_links":0,"syntology":null},{"paper":null,"slug":"non-uniform-stochastic-average-gradient","title":"Non-Uniform Stochastic Average Gradient Method for Training Conditional Random Fields","date":"2015-04-16","arxiv_id":"1504.04406","n_code_links":0,"syntology":null},{"paper":"/paper/saga-a-fast-incremental-gradient-method-with","slug":"saga-a-fast-incremental-gradient-method-with","title":"SAGA: A Fast Incremental Gradient Method With Support for Non-Strongly Convex Composite Objectives","date":"2014-07-01","arxiv_id":"1407.0202","n_code_links":5,"syntology":null}],"papers_shown":81,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":81,"with_a_code_link":15,"where_syntology_ran_a_sample":5,"not_listed_spam_title":0,"listed":81,"listed_where_code_ran":5,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":4,"every_run_a_failure_of_syntologys_instrument":1,"listed_with_a_run_with_no_instrument_failure":4,"listed_every_run_a_failure_of_syntologys_instrument":1,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"papers_where_code_ran":5,"papers_where_code_ran_first_page":"/method/saga/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not isolate this method inside it.","pages":[{"order":"ran","page":1,"of":1,"url":"/method/saga/papers/ran/1","json":"/method/saga/papers/ran/1.json","rows":5}],"tasks":[{"task":"/task/stochastic-optimization","name":"Stochastic Optimization","papers":11},{"task":"/task/machine-learning","name":"BIG-bench Machine Learning","papers":7},{"task":"/task/distributed-optimization","name":"Distributed Optimization","papers":3},{"task":"/task/federated-learning","name":"Federated Learning","papers":3},{"task":"/task/bilevel-optimization","name":"Bilevel Optimization","papers":2},{"task":"/task/segmentation","name":"Segmentation","papers":2},{"task":"/task/3dgs","name":"3DGS","papers":1},{"task":"/task/adversarial-attack","name":"Adversarial Attack","papers":1},{"task":"/task/attribute","name":"Attribute","papers":1},{"task":"/task/autonomous-driving","name":"Autonomous Driving","papers":1},{"task":"/task/clustering","name":"Clustering","papers":1},{"task":"/task/code-generation","name":"Code Generation","papers":1},{"task":"/task/computational-efficiency","name":"Computational Efficiency","papers":1},{"task":"/task/data-augmentation","name":"Data Augmentation","papers":1},{"task":"/task/distributed-computing","name":"Distributed Computing","papers":1},{"task":"/task/domain-adaptation","name":"Domain Adaptation","papers":1},{"task":"/task/dynamic-reconstruction","name":"Dynamic Reconstruction","papers":1},{"task":"/task/entity-linking","name":"Entity Linking","papers":1},{"task":"/task/fact-verification","name":"Fact Verification","papers":1},{"task":"/task/graph-representation-learning","name":"Graph Representation Learning","papers":1}],"tasks_shown":20,"n_tasks":39,"usage_by_year":[{"year":"2014","papers":1},{"year":"2015","papers":5},{"year":"2016","papers":4},{"year":"2017","papers":13},{"year":"2018","papers":12},{"year":"2019","papers":12},{"year":"2020","papers":7},{"year":"2021","papers":7},{"year":"2022","papers":5},{"year":"2023","papers":4},{"year":"2024","papers":5},{"year":"2025","papers":6}],"row_source":"methods_table","archive":{"source":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","archive_url":"https://paperswithcode.com/method/saga"},"syntology_read_at":"2026-10-05T00:36:11+00:00","syntology":{"source":"Syntology's have check for this name (the free coverage lookup), read from Syntology's graph","have_url":"https://syntology.ai/api/graph/have?x=SAGA","read_at":"2026-10-05T01:01:32+00:00","query":"SAGA","kind":"method","have":"declared_code","tier":"repo_known","verified_implementation":false,"level":null,"level_meaning":"the served verification level, per answer; never summed across methods","resolved_to":{"method":"SAGA","origin_arxiv_id":"2504.21034"},"resolution":"exact","resolved_name_differs":false,"absence_asserted":false,"absence_unchecked":null,"no_code_is_about_this_method":false,"subject":"different_paper","archive_paper_arxiv_id":"1407.0202","repositories":{"listed":2,"in_graph":2,"list_truncated":false,"strongest_link":"listed_only"},"retrieve_with":null,"name_competition":{"verdict":"outranked","may_be_wrong_sense":true,"bearers_found":8,"served":{"arxiv_id":"2504.21034","citations":null},"leading_other_bearer":{"arxiv_id":"1407.0202","title":"SAGA: A Fast Incremental Gradient Method With Support for Non-Strongly Convex Composite Objectives","citations":2023,"named_by":["title_prefix"],"bearer_name":"SAGA: A Fast Incremental Gradient Method With Support for Non-Strongly Convex Composite Objectives","ask_with":"have('1407.0202')"},"n_other_bearers_listed":5,"note":"'SAGA' is ALSO the name of the paper 'SAGA: A Fast Incremental Gradient Method With Support for Non-Strongly Convex Composite Objectives' (arXiv:1407.0202, 2,023 citations), which is cited FAR more than the paper this answer is about (citations not recorded). This answer may be about the wrong SAGA. If you meant the better-known one, ask again with that entry of `also_named`."},"name_competition_text":"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.","near_matches":null,"code_nearby":[],"code_nearby_caption":null,"origin_paper":{"arxiv_id":"2504.21034","page":"/paper/saga-a-security-architecture-for-governing-ai","syntology_url":"https://syntology.ai/paper/2504.21034","in_graph_layer":true,"samples":4,"ran":2,"n_ran_checked":2,"n_instrument":0,"unverified":2,"phrase":"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","instrument_means":"failures of Syntology's instrument, not of the code"},"line":"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.","level_legend":null},"syntology_have_state":"loaded","record_sha256":"e5f470b38f35f968b5a8b07af3c694d7f1a2f1dbee399509127cbd06b579829c","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}