{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:FFX57ECPSR2VNE2HAREUGRORRY","short_pith_number":"pith:FFX57ECP","schema_version":"1.0","canonical_sha256":"296fdf904f947556934704494345d18e2c316d55aa7dcd3aab7ec967c5dc584b","source":{"kind":"arxiv","id":"2202.00255","version":2},"attestation_state":"computed","paper":{"title":"DoCoM: Compressed Decentralized Optimization with Near-Optimal Sample Complexity","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DC","cs.DS","math.OC"],"primary_cat":"cs.LG","authors_text":"Chung-Yiu Yau, Hoi-To Wai","submitted_at":"2022-02-01T07:27:34Z","abstract_excerpt":"This paper proposes the Doubly Compressed Momentum-assisted stochastic gradient tracking algorithm $\\texttt{DoCoM}$ for communication-efficient decentralized optimization. The algorithm features two main ingredients to achieve a near-optimal sample complexity while allowing for communication compression. First, the algorithm tracks both the averaged iterate and stochastic gradient using compressed gossiping consensus. Second, a momentum step is incorporated for adaptive variance reduction with the local gradient estimates. We show that $\\texttt{DoCoM}$ finds a near-stationary solution at all p"},"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":"2202.00255","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-02-01T07:27:34Z","cross_cats_sorted":["cs.DC","cs.DS","math.OC"],"title_canon_sha256":"3afe0b4458bc4676c59787a4e1848496f7d86ef1e71da12ea1248612fa9830b9","abstract_canon_sha256":"ffbafcae78930dec90ffcdf1af6859992da28da2a7bfe8d91d4b41f90c5651d9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:35:43.008923Z","signature_b64":"XR7QgQ0zYv9Opmwjh0qexiRDabswICQiW+ndPWGA07bIcPRVm9sdwI3ye97BftwU8g/aplhEBOQ0IO0agFwBDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"296fdf904f947556934704494345d18e2c316d55aa7dcd3aab7ec967c5dc584b","last_reissued_at":"2026-07-05T06:35:43.008438Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:35:43.008438Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"DoCoM: Compressed Decentralized Optimization with Near-Optimal Sample Complexity","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DC","cs.DS","math.OC"],"primary_cat":"cs.LG","authors_text":"Chung-Yiu Yau, Hoi-To Wai","submitted_at":"2022-02-01T07:27:34Z","abstract_excerpt":"This paper proposes the Doubly Compressed Momentum-assisted stochastic gradient tracking algorithm $\\texttt{DoCoM}$ for communication-efficient decentralized optimization. The algorithm features two main ingredients to achieve a near-optimal sample complexity while allowing for communication compression. First, the algorithm tracks both the averaged iterate and stochastic gradient using compressed gossiping consensus. Second, a momentum step is incorporated for adaptive variance reduction with the local gradient estimates. We show that $\\texttt{DoCoM}$ finds a near-stationary solution at all p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2202.00255","kind":"arxiv","version":2},"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/2202.00255/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":"2202.00255","created_at":"2026-07-05T06:35:43.008489+00:00"},{"alias_kind":"arxiv_version","alias_value":"2202.00255v2","created_at":"2026-07-05T06:35:43.008489+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.00255","created_at":"2026-07-05T06:35:43.008489+00:00"},{"alias_kind":"pith_short_12","alias_value":"FFX57ECPSR2V","created_at":"2026-07-05T06:35:43.008489+00:00"},{"alias_kind":"pith_short_16","alias_value":"FFX57ECPSR2VNE2H","created_at":"2026-07-05T06:35:43.008489+00:00"},{"alias_kind":"pith_short_8","alias_value":"FFX57ECP","created_at":"2026-07-05T06:35:43.008489+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2607.01755","citing_title":"Decentralized Stochastic Subgradient-type Methods with Communication Compression for Nonsmooth Nonconvex Optimization","ref_index":69,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FFX57ECPSR2VNE2HAREUGRORRY","json":"https://pith.science/pith/FFX57ECPSR2VNE2HAREUGRORRY.json","graph_json":"https://pith.science/api/pith-number/FFX57ECPSR2VNE2HAREUGRORRY/graph.json","events_json":"https://pith.science/api/pith-number/FFX57ECPSR2VNE2HAREUGRORRY/events.json","paper":"https://pith.science/paper/FFX57ECP"},"agent_actions":{"view_html":"https://pith.science/pith/FFX57ECPSR2VNE2HAREUGRORRY","download_json":"https://pith.science/pith/FFX57ECPSR2VNE2HAREUGRORRY.json","view_paper":"https://pith.science/paper/FFX57ECP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2202.00255&json=true","fetch_graph":"https://pith.science/api/pith-number/FFX57ECPSR2VNE2HAREUGRORRY/graph.json","fetch_events":"https://pith.science/api/pith-number/FFX57ECPSR2VNE2HAREUGRORRY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FFX57ECPSR2VNE2HAREUGRORRY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FFX57ECPSR2VNE2HAREUGRORRY/action/storage_attestation","attest_author":"https://pith.science/pith/FFX57ECPSR2VNE2HAREUGRORRY/action/author_attestation","sign_citation":"https://pith.science/pith/FFX57ECPSR2VNE2HAREUGRORRY/action/citation_signature","submit_replication":"https://pith.science/pith/FFX57ECPSR2VNE2HAREUGRORRY/action/replication_record"}},"created_at":"2026-07-05T06:35:43.008489+00:00","updated_at":"2026-07-05T06:35:43.008489+00:00"}