{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/paper/finito-a-faster-permutable-incremental","title":"Finito: A Faster, Permutable Incremental Gradient Method for Big Data Problems","arxiv_id":"1407.2710","date":"2014-07-10","proceeding":null,"authors":["Aaron J. Defazio","Tibério S. Caetano","Justin Domke"],"abstract":"Recent advances in optimization theory have shown that smooth strongly convex\nfinite sums can be minimized faster than by treating them as a black box\n\"batch\" problem. In this work we introduce a new method in this class with a\ntheoretical convergence rate four times faster than existing methods, for sums\nwith sufficiently many terms. This method is also amendable to a sampling\nwithout replacement scheme that in practice gives further speed-ups. We give\nempirical results showing state of the art performance.","url_abs":"http://arxiv.org/abs/1407.2710v1","url_pdf":"http://arxiv.org/pdf/1407.2710v1.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":"finito-a-faster-permutable-incremental","repo_url":"https://github.com/kul-forbes/CIAOAlgorithms","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"NOASSERTION"}},{"paper_slug":"finito-a-faster-permutable-incremental","repo_url":"https://github.com/kul-forbes/CIAOAlgorithms.jl","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"NOASSERTION"}},{"paper_slug":"finito-a-faster-permutable-incremental","repo_url":"https://github.com/kul-optec/CIAOAlgorithms.jl","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"NOASSERTION"}}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=1407.2710","mcp":null,"developers":"https://syntology.ai/developers"},"arxiv_metadata":null,"syntology_extracted_results":null}