{"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/l1-regularized-distributed-optimization-a","title":"L1-Regularized Distributed Optimization: A Communication-Efficient Primal-Dual Framework","arxiv_id":"1512.04011","date":"2015-12-13","proceeding":null,"authors":["Virginia Smith","Simone Forte","Michael. I. Jordan","Martin Jaggi"],"abstract":"Despite the importance of sparsity in many large-scale applications, there\nare few methods for distributed optimization of sparsity-inducing objectives.\nIn this paper, we present a communication-efficient framework for\nL1-regularized optimization in the distributed environment. By viewing\nclassical objectives in a more general primal-dual setting, we develop a new\nclass of methods that can be efficiently distributed and applied to common\nsparsity-inducing models, such as Lasso, sparse logistic regression, and\nelastic net-regularized problems. We provide theoretical convergence guarantees\nfor our framework, and demonstrate its efficiency and flexibility with a\nthorough experimental comparison on Amazon EC2. Our proposed framework yields\nspeedups of up to 50x as compared to current state-of-the-art methods for\ndistributed L1-regularized optimization.","url_abs":"http://arxiv.org/abs/1512.04011v2","url_pdf":"http://arxiv.org/pdf/1512.04011v2.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":"l1-regularized-distributed-optimization-a","repo_url":"https://github.com/gingsmith/proxcocoa","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"l1-regularized-distributed-optimization-a","repo_url":"https://github.com/gingsmith/cocoa","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"Apache-2.0"}}],"tasks":[{"task_slug":"distributed-optimization","task_name":"Distributed Optimization"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1512.04011","atlas_url":"https://app.syntology.ai/?focus=1512.04011","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":"1512.04011"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1512.04011\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1512.04011"},"call":"get_concepts_for_paper(arxiv_id=\"1512.04011\")"}],"by_repo":[{"repo":"gingsmith/proxcocoa","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"gingsmith/cocoa","kind":"listed","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":"8c09b4a4def8177690cef2acc545eaa84e233ad7deb2ad780abc08d04a31c66b","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}