{"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/distributed-optimization-with-arbitrary-local","title":"Distributed Optimization with Arbitrary Local Solvers","arxiv_id":"1512.04039","date":"2015-12-13","proceeding":null,"authors":["Chenxin Ma","Jakub Konečný","Martin Jaggi","Virginia Smith","Michael. I. Jordan","Peter Richtárik","Martin Takáč"],"abstract":"With the growth of data and necessity for distributed optimization methods,\nsolvers that work well on a single machine must be re-designed to leverage\ndistributed computation. Recent work in this area has been limited by focusing\nheavily on developing highly specific methods for the distributed environment.\nThese special-purpose methods are often unable to fully leverage the\ncompetitive performance of their well-tuned and customized single machine\ncounterparts. Further, they are unable to easily integrate improvements that\ncontinue to be made to single machine methods. To this end, we present a\nframework for distributed optimization that both allows the flexibility of\narbitrary solvers to be used on each (single) machine locally, and yet\nmaintains competitive performance against other state-of-the-art\nspecial-purpose distributed methods. We give strong primal-dual convergence\nrate guarantees for our framework that hold for arbitrary local solvers. We\ndemonstrate the impact of local solver selection both theoretically and in an\nextensive experimental comparison. Finally, we provide thorough implementation\ndetails for our framework, highlighting areas for practical performance gains.","url_abs":"http://arxiv.org/abs/1512.04039v2","url_pdf":"http://arxiv.org/pdf/1512.04039v2.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":"distributed-optimization-with-arbitrary-local","repo_url":"https://github.com/optml/CoCoA","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"GPL-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.04039","atlas_url":"https://app.syntology.ai/?focus=1512.04039","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.04039"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1512.04039\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1512.04039"},"call":"get_concepts_for_paper(arxiv_id=\"1512.04039\")"}],"by_repo":[{"repo":"optml/CoCoA","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":"f4a1e776425d7da8144292de42c1905662b7ace43a1247461fde09b290c6ff63","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}