{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:ANUMLCDGDXZVYOFQOVKVTRWCFG","short_pith_number":"pith:ANUMLCDG","schema_version":"1.0","canonical_sha256":"0368c588661df35c38b0755559c6c229923ff537840c95d36fb0bb965e683713","source":{"kind":"arxiv","id":"2002.09539","version":1},"attestation_state":"computed","paper":{"title":"Overlap Local-SGD: An Algorithmic Approach to Hide Communication Delays in Distributed SGD","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Gauri Joshi, Hao Liang, Jianyu Wang","submitted_at":"2020-02-21T20:33:49Z","abstract_excerpt":"Distributed stochastic gradient descent (SGD) is essential for scaling the machine learning algorithms to a large number of computing nodes. However, the infrastructures variability such as high communication delay or random node slowdown greatly impedes the performance of distributed SGD algorithm, especially in a wireless system or sensor networks. In this paper, we propose an algorithmic approach named Overlap-Local-SGD (and its momentum variant) to overlap the communication and computation so as to speedup the distributed training procedure. The approach can help to mitigate the straggler "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2002.09539","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-02-21T20:33:49Z","cross_cats_sorted":["cs.DC","math.OC","stat.ML"],"title_canon_sha256":"2a3773875ace3fc13b731ce80af7bcdcd49852475ecc68183519f823dbee7862","abstract_canon_sha256":"7d4ada4be43fdbafc2c421a8c2c744c1c0bfb4fc5ec7ed472992198afda7bebe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:43:08.756338Z","signature_b64":"g2F+WMu1c1k3cdMLp8qIjOC40KLRgmNkZysI14y2weJI4df3FopXRYeGo4YGQPxHJvfBeXpkoD0A+pbUS/E0Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0368c588661df35c38b0755559c6c229923ff537840c95d36fb0bb965e683713","last_reissued_at":"2026-07-05T00:43:08.755855Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:43:08.755855Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Overlap Local-SGD: An Algorithmic Approach to Hide Communication Delays in Distributed SGD","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Gauri Joshi, Hao Liang, Jianyu Wang","submitted_at":"2020-02-21T20:33:49Z","abstract_excerpt":"Distributed stochastic gradient descent (SGD) is essential for scaling the machine learning algorithms to a large number of computing nodes. However, the infrastructures variability such as high communication delay or random node slowdown greatly impedes the performance of distributed SGD algorithm, especially in a wireless system or sensor networks. In this paper, we propose an algorithmic approach named Overlap-Local-SGD (and its momentum variant) to overlap the communication and computation so as to speedup the distributed training procedure. The approach can help to mitigate the straggler "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.09539","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2002.09539/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2002.09539","created_at":"2026-07-05T00:43:08.755906+00:00"},{"alias_kind":"arxiv_version","alias_value":"2002.09539v1","created_at":"2026-07-05T00:43:08.755906+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.09539","created_at":"2026-07-05T00:43:08.755906+00:00"},{"alias_kind":"pith_short_12","alias_value":"ANUMLCDGDXZV","created_at":"2026-07-05T00:43:08.755906+00:00"},{"alias_kind":"pith_short_16","alias_value":"ANUMLCDGDXZVYOFQ","created_at":"2026-07-05T00:43:08.755906+00:00"},{"alias_kind":"pith_short_8","alias_value":"ANUMLCDG","created_at":"2026-07-05T00:43:08.755906+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ANUMLCDGDXZVYOFQOVKVTRWCFG","json":"https://pith.science/pith/ANUMLCDGDXZVYOFQOVKVTRWCFG.json","graph_json":"https://pith.science/api/pith-number/ANUMLCDGDXZVYOFQOVKVTRWCFG/graph.json","events_json":"https://pith.science/api/pith-number/ANUMLCDGDXZVYOFQOVKVTRWCFG/events.json","paper":"https://pith.science/paper/ANUMLCDG"},"agent_actions":{"view_html":"https://pith.science/pith/ANUMLCDGDXZVYOFQOVKVTRWCFG","download_json":"https://pith.science/pith/ANUMLCDGDXZVYOFQOVKVTRWCFG.json","view_paper":"https://pith.science/paper/ANUMLCDG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2002.09539&json=true","fetch_graph":"https://pith.science/api/pith-number/ANUMLCDGDXZVYOFQOVKVTRWCFG/graph.json","fetch_events":"https://pith.science/api/pith-number/ANUMLCDGDXZVYOFQOVKVTRWCFG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ANUMLCDGDXZVYOFQOVKVTRWCFG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ANUMLCDGDXZVYOFQOVKVTRWCFG/action/storage_attestation","attest_author":"https://pith.science/pith/ANUMLCDGDXZVYOFQOVKVTRWCFG/action/author_attestation","sign_citation":"https://pith.science/pith/ANUMLCDGDXZVYOFQOVKVTRWCFG/action/citation_signature","submit_replication":"https://pith.science/pith/ANUMLCDGDXZVYOFQOVKVTRWCFG/action/replication_record"}},"created_at":"2026-07-05T00:43:08.755906+00:00","updated_at":"2026-07-05T00:43:08.755906+00:00"}