{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:KR7TS42RHNXVFXM2LVKNIGQPXA","short_pith_number":"pith:KR7TS42R","schema_version":"1.0","canonical_sha256":"547f3973513b6f52dd9a5d54d41a0fb82d6123b2ed5c9e1fe7003c3714b1d00b","source":{"kind":"arxiv","id":"1910.09126","version":5},"attestation_state":"computed","paper":{"title":"Communication-Efficient Local Decentralized SGD Methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"stat.ML","authors_text":"Shusen Wang, Wenhao Yang, Xiang Li, Zhihua Zhang","submitted_at":"2019-10-21T02:51:54Z","abstract_excerpt":"Recently, the technique of local updates is a powerful tool in centralized settings to improve communication efficiency via periodical communication. For decentralized settings, it is still unclear how to efficiently combine local updates and decentralized communication. In this work, we propose an algorithm named as LD-SGD, which incorporates arbitrary update schemes that alternate between multiple Local updates and multiple Decentralized SGDs, and provide an analytical framework for LD-SGD. Under the framework, we present a sufficient condition to guarantee the convergence. We show that LD-S"},"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":"1910.09126","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-10-21T02:51:54Z","cross_cats_sorted":["cs.LG","math.OC"],"title_canon_sha256":"4169f76718853156765479073c99071259f11ee0dc604f24a7cc6f5a5a296e79","abstract_canon_sha256":"84fa4eb1f26365294e0dd7692226cdd0f59a50efc93f74fb1b94a5541599ed42"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:28:47.766880Z","signature_b64":"bp5oP4nkndnPWaKtHXPVAiATU70xnQT8tQnm566PkOQzAQ4dh0bn+DFT4zTnxcHFm3JZE/B53EYjYv3soNCRAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"547f3973513b6f52dd9a5d54d41a0fb82d6123b2ed5c9e1fe7003c3714b1d00b","last_reissued_at":"2026-07-05T02:28:47.766396Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:28:47.766396Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Communication-Efficient Local Decentralized SGD Methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"stat.ML","authors_text":"Shusen Wang, Wenhao Yang, Xiang Li, Zhihua Zhang","submitted_at":"2019-10-21T02:51:54Z","abstract_excerpt":"Recently, the technique of local updates is a powerful tool in centralized settings to improve communication efficiency via periodical communication. For decentralized settings, it is still unclear how to efficiently combine local updates and decentralized communication. In this work, we propose an algorithm named as LD-SGD, which incorporates arbitrary update schemes that alternate between multiple Local updates and multiple Decentralized SGDs, and provide an analytical framework for LD-SGD. Under the framework, we present a sufficient condition to guarantee the convergence. We show that LD-S"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1910.09126","kind":"arxiv","version":5},"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/1910.09126/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":"1910.09126","created_at":"2026-07-05T02:28:47.766450+00:00"},{"alias_kind":"arxiv_version","alias_value":"1910.09126v5","created_at":"2026-07-05T02:28:47.766450+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.09126","created_at":"2026-07-05T02:28:47.766450+00:00"},{"alias_kind":"pith_short_12","alias_value":"KR7TS42RHNXV","created_at":"2026-07-05T02:28:47.766450+00:00"},{"alias_kind":"pith_short_16","alias_value":"KR7TS42RHNXVFXM2","created_at":"2026-07-05T02:28:47.766450+00:00"},{"alias_kind":"pith_short_8","alias_value":"KR7TS42R","created_at":"2026-07-05T02:28:47.766450+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.04757","citing_title":"Near-Optimal Decentralized Stochastic Convex Optimization over Networks","ref_index":15,"is_internal_anchor":false},{"citing_arxiv_id":"2605.10205","citing_title":"Unveiling High-Probability Generalization in Decentralized SGD","ref_index":47,"is_internal_anchor":false},{"citing_arxiv_id":"2605.01701","citing_title":"Stability and Generalization for Decentralized Markov SGD","ref_index":67,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KR7TS42RHNXVFXM2LVKNIGQPXA","json":"https://pith.science/pith/KR7TS42RHNXVFXM2LVKNIGQPXA.json","graph_json":"https://pith.science/api/pith-number/KR7TS42RHNXVFXM2LVKNIGQPXA/graph.json","events_json":"https://pith.science/api/pith-number/KR7TS42RHNXVFXM2LVKNIGQPXA/events.json","paper":"https://pith.science/paper/KR7TS42R"},"agent_actions":{"view_html":"https://pith.science/pith/KR7TS42RHNXVFXM2LVKNIGQPXA","download_json":"https://pith.science/pith/KR7TS42RHNXVFXM2LVKNIGQPXA.json","view_paper":"https://pith.science/paper/KR7TS42R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1910.09126&json=true","fetch_graph":"https://pith.science/api/pith-number/KR7TS42RHNXVFXM2LVKNIGQPXA/graph.json","fetch_events":"https://pith.science/api/pith-number/KR7TS42RHNXVFXM2LVKNIGQPXA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KR7TS42RHNXVFXM2LVKNIGQPXA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KR7TS42RHNXVFXM2LVKNIGQPXA/action/storage_attestation","attest_author":"https://pith.science/pith/KR7TS42RHNXVFXM2LVKNIGQPXA/action/author_attestation","sign_citation":"https://pith.science/pith/KR7TS42RHNXVFXM2LVKNIGQPXA/action/citation_signature","submit_replication":"https://pith.science/pith/KR7TS42RHNXVFXM2LVKNIGQPXA/action/replication_record"}},"created_at":"2026-07-05T02:28:47.766450+00:00","updated_at":"2026-07-05T02:28:47.766450+00:00"}