{"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/decentralized-stochastic-optimization-and","title":"Decentralized Stochastic Optimization and Gossip Algorithms with Compressed Communication","arxiv_id":"1902.00340","date":"2019-02-01","proceeding":null,"authors":["Anastasia Koloskova","Sebastian U. Stich","Martin Jaggi"],"abstract":"We consider decentralized stochastic optimization with the objective function\n(e.g. data samples for machine learning task) being distributed over $n$\nmachines that can only communicate to their neighbors on a fixed communication\ngraph. To reduce the communication bottleneck, the nodes compress (e.g.\nquantize or sparsify) their model updates. We cover both unbiased and biased\ncompression operators with quality denoted by $\\omega \\leq 1$ ($\\omega=1$\nmeaning no compression). We (i) propose a novel gossip-based stochastic\ngradient descent algorithm, CHOCO-SGD, that converges at rate\n$\\mathcal{O}\\left(1/(nT) + 1/(T \\delta^2 \\omega)^2\\right)$ for strongly convex\nobjectives, where $T$ denotes the number of iterations and $\\delta$ the\neigengap of the connectivity matrix. Despite compression quality and network\nconnectivity affecting the higher order terms, the first term in the rate,\n$\\mathcal{O}(1/(nT))$, is the same as for the centralized baseline with exact\ncommunication. We (ii) present a novel gossip algorithm, CHOCO-GOSSIP, for the\naverage consensus problem that converges in time\n$\\mathcal{O}(1/(\\delta^2\\omega) \\log (1/\\epsilon))$ for accuracy $\\epsilon >\n0$. This is (up to our knowledge) the first gossip algorithm that supports\narbitrary compressed messages for $\\omega > 0$ and still exhibits linear\nconvergence. We (iii) show in experiments that both of our algorithms do\noutperform the respective state-of-the-art baselines and CHOCO-SGD can reduce\ncommunication by at least two orders of magnitudes.","url_abs":"http://arxiv.org/abs/1902.00340v1","url_pdf":"http://arxiv.org/pdf/1902.00340v1.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":"decentralized-stochastic-optimization-and","repo_url":"https://github.com/Adirlou/OptML_Project","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok"}},{"paper_slug":"decentralized-stochastic-optimization-and","repo_url":"https://github.com/JYWa/MATCHA","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}},{"paper_slug":"decentralized-stochastic-optimization-and","repo_url":"https://github.com/epfml/ChocoSGD","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"Apache-2.0"}}],"tasks":[{"task_slug":"stochastic-optimization","task_name":"Stochastic Optimization"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1902.00340","atlas_url":"https://app.syntology.ai/?focus=1902.00340","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":"1902.00340"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1902.00340\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1902.00340"},"call":"get_concepts_for_paper(arxiv_id=\"1902.00340\")"}],"by_repo":[{"repo":"Adirlou/OptML_Project","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"JYWa/MATCHA","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"epfml/ChocoSGD","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1907.09356"],"harvested_for_calls":[{"arxiv_id":"1907.09356","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1907.09356"},"call":"get_harvested_code_for_paper(arxiv_id=\"1907.09356\")"}]}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","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":"c6fc992648308a07d661672b819c33828bcc4a05e419b0463a0624ec1ba14df5","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}