{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:GLV6UFOM72WH2FG6DUNDC5EEQR","short_pith_number":"pith:GLV6UFOM","schema_version":"1.0","canonical_sha256":"32ebea15ccfeac7d14de1d1a317484845aef4d1a50751d56790b6379369d3bc4","source":{"kind":"arxiv","id":"2302.07475","version":1},"attestation_state":"computed","paper":{"title":"Sparse-SignSGD with Majority Vote for Communication-Efficient Distributed Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Chanho Park, Namyoon Lee","submitted_at":"2023-02-15T05:36:41Z","abstract_excerpt":"The training efficiency of complex deep learning models can be significantly improved through the use of distributed optimization. However, this process is often hindered by a large amount of communication cost between workers and a parameter server during iterations. To address this bottleneck, in this paper, we present a new communication-efficient algorithm that offers the synergistic benefits of both sparsification and sign quantization, called ${\\sf S}^3$GD-MV. The workers in ${\\sf S}^3$GD-MV select the top-$K$ magnitude components of their local gradient vector and only send the signs of"},"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":"2302.07475","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-02-15T05:36:41Z","cross_cats_sorted":["cs.DC","math.OC","stat.ML"],"title_canon_sha256":"aba66d5fee1fb29ecf45cf4d77560299c589b41b5083f9de163b5e524a3a68a0","abstract_canon_sha256":"1ee2652e18850f0f043b1e125206b2bd2708829356aee4708b23de7c626ea213"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:41:54.461247Z","signature_b64":"HdqH9DCUMAjDe5LbvcGONMmUCKyRKLyj9PECvpAFcHd1ZcyzSSLKtwRkaRaGybpBar1cJ3YiIU18IiVHCmcJAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"32ebea15ccfeac7d14de1d1a317484845aef4d1a50751d56790b6379369d3bc4","last_reissued_at":"2026-07-05T05:41:54.460803Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:41:54.460803Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sparse-SignSGD with Majority Vote for Communication-Efficient Distributed Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Chanho Park, Namyoon Lee","submitted_at":"2023-02-15T05:36:41Z","abstract_excerpt":"The training efficiency of complex deep learning models can be significantly improved through the use of distributed optimization. However, this process is often hindered by a large amount of communication cost between workers and a parameter server during iterations. To address this bottleneck, in this paper, we present a new communication-efficient algorithm that offers the synergistic benefits of both sparsification and sign quantization, called ${\\sf S}^3$GD-MV. The workers in ${\\sf S}^3$GD-MV select the top-$K$ magnitude components of their local gradient vector and only send the signs of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.07475","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/2302.07475/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":"2302.07475","created_at":"2026-07-05T05:41:54.460866+00:00"},{"alias_kind":"arxiv_version","alias_value":"2302.07475v1","created_at":"2026-07-05T05:41:54.460866+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.07475","created_at":"2026-07-05T05:41:54.460866+00:00"},{"alias_kind":"pith_short_12","alias_value":"GLV6UFOM72WH","created_at":"2026-07-05T05:41:54.460866+00:00"},{"alias_kind":"pith_short_16","alias_value":"GLV6UFOM72WH2FG6","created_at":"2026-07-05T05:41:54.460866+00:00"},{"alias_kind":"pith_short_8","alias_value":"GLV6UFOM","created_at":"2026-07-05T05:41:54.460866+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/GLV6UFOM72WH2FG6DUNDC5EEQR","json":"https://pith.science/pith/GLV6UFOM72WH2FG6DUNDC5EEQR.json","graph_json":"https://pith.science/api/pith-number/GLV6UFOM72WH2FG6DUNDC5EEQR/graph.json","events_json":"https://pith.science/api/pith-number/GLV6UFOM72WH2FG6DUNDC5EEQR/events.json","paper":"https://pith.science/paper/GLV6UFOM"},"agent_actions":{"view_html":"https://pith.science/pith/GLV6UFOM72WH2FG6DUNDC5EEQR","download_json":"https://pith.science/pith/GLV6UFOM72WH2FG6DUNDC5EEQR.json","view_paper":"https://pith.science/paper/GLV6UFOM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2302.07475&json=true","fetch_graph":"https://pith.science/api/pith-number/GLV6UFOM72WH2FG6DUNDC5EEQR/graph.json","fetch_events":"https://pith.science/api/pith-number/GLV6UFOM72WH2FG6DUNDC5EEQR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GLV6UFOM72WH2FG6DUNDC5EEQR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GLV6UFOM72WH2FG6DUNDC5EEQR/action/storage_attestation","attest_author":"https://pith.science/pith/GLV6UFOM72WH2FG6DUNDC5EEQR/action/author_attestation","sign_citation":"https://pith.science/pith/GLV6UFOM72WH2FG6DUNDC5EEQR/action/citation_signature","submit_replication":"https://pith.science/pith/GLV6UFOM72WH2FG6DUNDC5EEQR/action/replication_record"}},"created_at":"2026-07-05T05:41:54.460866+00:00","updated_at":"2026-07-05T05:41:54.460866+00:00"}