{"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/an-accelerated-communication-efficient-primal","title":"An Accelerated Communication-Efficient Primal-Dual Optimization Framework for Structured Machine Learning","arxiv_id":"1711.05305","date":"2017-11-14","proceeding":null,"authors":["Chenxin Ma","Martin Jaggi","Frank E. Curtis","Nathan Srebro","Martin Takáč"],"abstract":"Distributed optimization algorithms are essential for training machine\nlearning models on very large-scale datasets. However, they often suffer from\ncommunication bottlenecks. Confronting this issue, a communication-efficient\nprimal-dual coordinate ascent framework (CoCoA) and its improved variant CoCoA+\nhave been proposed, achieving a convergence rate of $\\mathcal{O}(1/t)$ for\nsolving empirical risk minimization problems with Lipschitz continuous losses.\nIn this paper, an accelerated variant of CoCoA+ is proposed and shown to\npossess a convergence rate of $\\mathcal{O}(1/t^2)$ in terms of reducing\nsuboptimality. The analysis of this rate is also notable in that the\nconvergence rate bounds involve constants that, except in extreme cases, are\nsignificantly reduced compared to those previously provided for CoCoA+. The\nresults of numerical experiments are provided to show that acceleration can\nlead to significant performance gains.","url_abs":"http://arxiv.org/abs/1711.05305v1","url_pdf":"http://arxiv.org/pdf/1711.05305v1.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":"an-accelerated-communication-efficient-primal","repo_url":"https://github.com/schemmy/CoCoA-Experiments","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"machine-learning","task_name":"BIG-bench Machine Learning"},{"task_slug":"distributed-optimization","task_name":"Distributed Optimization"}],"methods":[],"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":"schemmy/CoCoA-Experiments","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":"e80b2bbff29d24238137a05ed4bf857d9c239c41c2ee5b7bd5e936fa4f94b5a4","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}