{"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/slowmo-improving-communication-efficient","title":"SlowMo: Improving Communication-Efficient Distributed SGD with Slow Momentum","arxiv_id":"1910.00643","date":"2019-10-01","proceeding":"ICLR 2020 1","authors":["Jianyu Wang","Vinayak Tantia","Nicolas Ballas","Michael Rabbat"],"abstract":"Distributed optimization is essential for training large models on large datasets. Multiple approaches have been proposed to reduce the communication overhead in distributed training, such as synchronizing only after performing multiple local SGD steps, and decentralized methods (e.g., using gossip algorithms) to decouple communications among workers. Although these methods run faster than AllReduce-based methods, which use blocking communication before every update, the resulting models may be less accurate after the same number of updates. Inspired by the BMUF method of Chen & Huo (2016), we propose a slow momentum (SlowMo) framework, where workers periodically synchronize and perform a momentum update, after multiple iterations of a base optimization algorithm. Experiments on image classification and machine translation tasks demonstrate that SlowMo consistently yields improvements in optimization and generalization performance relative to the base optimizer, even when the additional overhead is amortized over many updates so that the SlowMo runtime is on par with that of the base optimizer. We provide theoretical convergence guarantees showing that SlowMo converges to a stationary point of smooth non-convex losses. Since BMUF can be expressed through the SlowMo framework, our results also correspond to the first theoretical convergence guarantees for BMUF.","url_abs":"https://arxiv.org/abs/1910.00643v2","url_pdf":"https://arxiv.org/pdf/1910.00643v2.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":"slowmo-improving-communication-efficient","repo_url":"https://github.com/facebookresearch/fairscale/blob/main/fairscale/experimental/nn/data_parallel/gossip/distributed.py","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":null},{"paper_slug":"slowmo-improving-communication-efficient","repo_url":"https://github.com/shuhuayu/dist-sign-momentum","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"Apache-2.0"}}],"tasks":[{"task_slug":"blocking","task_name":"Blocking"},{"task_slug":"distributed-optimization","task_name":"Distributed Optimization"},{"task_slug":"image-classification","task_name":"Image Classification"},{"task_slug":"machine-translation","task_name":"Machine Translation"},{"task_slug":"translation","task_name":"Translation"},{"task_slug":"image-classification","task_name":"image-classification"}],"methods":[{"method_slug":"local-sgd","method_name":"Local SGD"},{"method_slug":"sgd","method_name":"SGD"},{"method_slug":"slowmo","method_name":"SlowMo"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1910.00643","atlas_url":"https://app.syntology.ai/?focus=1910.00643","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.00643"},"calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1910.00643"},"returns":"the samples harvested from this paper, each with its run record; it does not verify the paper"},{"tool":"get_code","arguments_in":"samples[].code_sha256","returns":"one stored sample by its code_sha256; not shown on this site"}]},"developers":"https://syntology.ai/developers","held":true,"reason":"in_graph_layer","checked_against":null,"agent_calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1910.00643"},"call":"get_harvested_code_for_paper(arxiv_id=\"1910.00643\")"},{"tool":"get_code","arguments_in":{"code_sha256":"syntology.samples[].code_sha256"},"call":"get_code(code_sha256=\"…\")"},{"tool":"get_citation_path","arguments":{"paper_1":"1910.00643"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1910.00643\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1910.00643"},"call":"get_concepts_for_paper(arxiv_id=\"1910.00643\")"}],"by_repo":[{"repo":"facebookresearch/fairscale","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1909.08053"],"harvested_for_calls":[{"arxiv_id":"1909.08053","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1909.08053"},"call":"get_harvested_code_for_paper(arxiv_id=\"1909.08053\")"}]},{"repo":"shuhuayu/dist-sign-momentum","kind":"listed","samples":3,"ran":0,"instrument":0,"unverified":3}],"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","read_at":"2026-10-05T00:36:11+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","ran_record":{"url":"https://syntology.ai/api/ran/1910.00643.json","schema":"syntology.ran_record/1","counts_crosswalk":{"n_samples":"syntology.counts.lifted","n_ran":"syntology.counts.executed","n_ran_checked":"syntology.counts.checked","n_instrument":"syntology.counts.instrument_failures","n_unverified":"syntology.counts.no_recorded_run"},"note":"live record, measured at request time; may be newer than this page's graph read","badge":"https://syntology.ai/api/ran/1910.00643.svg"},"claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/shuhuayu/dist-sign-momentum","reach":{"status":"ok","spdx":"Apache-2.0"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/facebookresearch/fairscale/blob/main/fairscale/experimental/nn/data_parallel/gossip/distributed.py","reach":null}],"summary":{"unverified":3},"n_samples":3,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":3,"n_instrument_is":"failures of Syntology's instrument, not of the code","every_run_is_an_instrument_failure":false,"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"by_repo_kind":{"listed":{"samples":3,"ran":0,"n_ran_checked":0,"n_instrument":0,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"official_not_harvested":{"repositories":["facebookresearch/fairscale"],"harvested_for_other_papers":[1],"samples_from_other_repositories":3,"other_repositories":1,"samples_unlocated":0},"n_pointer_only_for_licence":1,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_pointer_only_for_licence counts samples with inline_ok false (both gates), n_pointer_only_link_allows those of them whose inline_ok_link is true","n_pointer_only_link_allows":1,"code_page_min_papers":5,"code_page_is":"a page for the entry name across every paper's harvested code; the name is a string, not an identity","samples":[{"code_sha256":"6531ba0f0e98d838","code_sha256_prefix":"6531ba0f0e98d838","entry":"get_batch","repo":"shuhuayu/dist-sign-momentum","repo_kind":"listed","path":"nanoGPT/train_ddp.py","file_url":"https://github.com/shuhuayu/dist-sign-momentum/blob/HEAD/nanoGPT/train_ddp.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":"/code/get-batch","census":null,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"6531ba0f0e98d838"}},{"code_sha256":"a45844bbbc818cb3","code_sha256_prefix":"a45844bbbc818cb3","entry":"get_device","repo":"shuhuayu/dist-sign-momentum","repo_kind":"listed","path":"fairscale/benchmarks/fsdp.py","file_url":"https://github.com/shuhuayu/dist-sign-momentum/blob/HEAD/fairscale/benchmarks/fsdp.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":"/code/get-device","census":null,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"a45844bbbc818cb3"}},{"code_sha256":"bdf4c696b10f184e","code_sha256_prefix":"bdf4c696b10f184e","entry":"get_lr","repo":"shuhuayu/dist-sign-momentum","repo_kind":"listed","path":"nanoGPT/train_ddp.py","file_url":"https://github.com/shuhuayu/dist-sign-momentum/blob/HEAD/nanoGPT/train_ddp.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":"/code/get-lr","census":null,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from epflneuroailab/topolm, and GitHub detected no licence in that repository when it was checked","mcp_get_code":{"code_sha256":"bdf4c696b10f184e"}}]},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"2ab08e0f29ac65d052d7de61b662789fc4d2caff7e001d694787cb2709598fe3","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}