{"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/optimal-algorithms-for-smooth-and-strongly","title":"Optimal algorithms for smooth and strongly convex distributed optimization in networks","arxiv_id":"1702.08704","date":"2017-02-28","proceeding":"ICML 2017 8","authors":["Kevin Scaman","Francis Bach","Sébastien Bubeck","Yin Tat Lee","Laurent Massoulié"],"abstract":"In this paper, we determine the optimal convergence rates for strongly convex\nand smooth distributed optimization in two settings: centralized and\ndecentralized communications over a network. For centralized (i.e.\nmaster/slave) algorithms, we show that distributing Nesterov's accelerated\ngradient descent is optimal and achieves a precision $\\varepsilon > 0$ in time\n$O(\\sqrt{\\kappa_g}(1+\\Delta\\tau)\\ln(1/\\varepsilon))$, where $\\kappa_g$ is the\ncondition number of the (global) function to optimize, $\\Delta$ is the diameter\nof the network, and $\\tau$ (resp. $1$) is the time needed to communicate values\nbetween two neighbors (resp. perform local computations). For decentralized\nalgorithms based on gossip, we provide the first optimal algorithm, called the\nmulti-step dual accelerated (MSDA) method, that achieves a precision\n$\\varepsilon > 0$ in time\n$O(\\sqrt{\\kappa_l}(1+\\frac{\\tau}{\\sqrt{\\gamma}})\\ln(1/\\varepsilon))$, where\n$\\kappa_l$ is the condition number of the local functions and $\\gamma$ is the\n(normalized) eigengap of the gossip matrix used for communication between\nnodes. We then verify the efficiency of MSDA against state-of-the-art methods\nfor two problems: least-squares regression and classification by logistic\nregression.","url_abs":"http://arxiv.org/abs/1702.08704v2","url_pdf":"http://arxiv.org/pdf/1702.08704v2.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":"optimal-algorithms-for-smooth-and-strongly","repo_url":"https://github.com/adelnabli/dadao","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}}],"tasks":[{"task_slug":"distributed-optimization","task_name":"Distributed Optimization"},{"task_slug":"regression-1","task_name":"regression"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1702.08704","atlas_url":"https://app.syntology.ai/?focus=1702.08704","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":"1702.08704"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1702.08704\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1702.08704"},"call":"get_concepts_for_paper(arxiv_id=\"1702.08704\")"}],"by_repo":[{"repo":"adelnabli/dadao","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":"9b927a60812c3a81d8c41755dc58981738c655def88af2bfa32d0b15f2ddd379","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}