{"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/breaking-the-nonsmooth-barrier-a-scalable","title":"Breaking the Nonsmooth Barrier: A Scalable Parallel Method for Composite Optimization","arxiv_id":"1707.06468","date":"2017-07-20","proceeding":"NeurIPS 2017 12","authors":["Fabian Pedregosa","Rémi Leblond","Simon Lacoste-Julien"],"abstract":"Due to their simplicity and excellent performance, parallel asynchronous\nvariants of stochastic gradient descent have become popular methods to solve a\nwide range of large-scale optimization problems on multi-core architectures.\nYet, despite their practical success, support for nonsmooth objectives is still\nlacking, making them unsuitable for many problems of interest in machine\nlearning, such as the Lasso, group Lasso or empirical risk minimization with\nconvex constraints.\n  In this work, we propose and analyze ProxASAGA, a fully asynchronous sparse\nmethod inspired by SAGA, a variance reduced incremental gradient algorithm. The\nproposed method is easy to implement and significantly outperforms the state of\nthe art on several nonsmooth, large-scale problems. We prove that our method\nachieves a theoretical linear speedup with respect to the sequential version\nunder assumptions on the sparsity of gradients and block-separability of the\nproximal term. Empirical benchmarks on a multi-core architecture illustrate\npractical speedups of up to 12x on a 20-core machine.","url_abs":"http://arxiv.org/abs/1707.06468v3","url_pdf":"http://arxiv.org/pdf/1707.06468v3.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":"breaking-the-nonsmooth-barrier-a-scalable","repo_url":"https://github.com/fabianp/ProxASAGA","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[],"methods":[{"method_slug":"saga","method_name":"SAGA"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"fabianp/ProxASAGA","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"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":"0c134fbf682b2d79f78637a93834b06a89d71e0f510b26bd6387a40a40b8d9e3","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}