{"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":"/paper/saga-a-fast-incremental-gradient-method-with","title":"SAGA: A Fast Incremental Gradient Method With Support for Non-Strongly Convex Composite Objectives","arxiv_id":"1407.0202","date":"2014-07-01","proceeding":"NeurIPS 2014 12","authors":["Aaron Defazio","Francis Bach","Simon Lacoste-Julien"],"abstract":"In this work we introduce a new optimisation method called SAGA in the spirit\nof SAG, SDCA, MISO and SVRG, a set of recently proposed incremental gradient\nalgorithms with fast linear convergence rates. SAGA improves on the theory\nbehind SAG and SVRG, with better theoretical convergence rates, and has support\nfor composite objectives where a proximal operator is used on the regulariser.\nUnlike SDCA, SAGA supports non-strongly convex problems directly, and is\nadaptive to any inherent strong convexity of the problem. We give experimental\nresults showing the effectiveness of our method.","url_abs":"http://arxiv.org/abs/1407.0202v3","url_pdf":"http://arxiv.org/pdf/1407.0202v3.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"saga-a-fast-incremental-gradient-method-with","repo_url":"https://github.com/PrzemyslawRys/Logistic-Regression-Lasso-Optimization","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok"}},{"paper_slug":"saga-a-fast-incremental-gradient-method-with","repo_url":"https://github.com/kilianFatras/variance_reduced_neural_networks","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}},{"paper_slug":"saga-a-fast-incremental-gradient-method-with","repo_url":"https://github.com/adefazio/point-saga","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"none","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"saga-a-fast-incremental-gradient-method-with","repo_url":"https://github.com/scikit-learn-contrib/lightning","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"none","reach":{"status":"ok"}},{"paper_slug":"saga-a-fast-incremental-gradient-method-with","repo_url":"https://github.com/scikit-learn/scikit-learn/blob/95119c13a/sklearn/linear_model/_logistic.py","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[],"methods":[{"method_slug":"saga","method_name":"SAGA"}],"datasets_introduced":[],"methods_introduced":[{"slug":"saga","name":"SAGA","full_name":"SAGA"}],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1407.0202","atlas_url":"https://app.syntology.ai/?focus=1407.0202","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1407.0202"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1407.0202\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1407.0202"},"call":"get_concepts_for_paper(arxiv_id=\"1407.0202\")"}],"by_repo":[{"repo":"PrzemyslawRys/Logistic-Regression-Lasso-Optimization","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"kilianFatras/variance_reduced_neural_networks","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"adefazio/point-saga","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1602.02442"],"harvested_for_calls":[{"arxiv_id":"1602.02442","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1602.02442"},"call":"get_harvested_code_for_paper(arxiv_id=\"1602.02442\")"}]},{"repo":"scikit-learn-contrib/lightning","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"scikit-learn/scikit-learn","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1201.0490"],"harvested_for_calls":[{"arxiv_id":"1201.0490","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1201.0490"},"call":"get_harvested_code_for_paper(arxiv_id=\"1201.0490\")"}]}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"bc588209516456a7c60524fbda1ce37f95e17b9e46d5b7ff8bb233f48112490a","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}