{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:VTP3PFM5MI6BBSZLYRB5GW3CDD","short_pith_number":"pith:VTP3PFM5","schema_version":"1.0","canonical_sha256":"acdfb7959d623c10cb2bc443d35b6218cf083604a984b3f7d364e5ecf0d08280","source":{"kind":"arxiv","id":"2211.00188","version":1},"attestation_state":"computed","paper":{"title":"Adaptive Compression for Communication-Efficient Distributed Training","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DC","cs.IT","math.IT"],"primary_cat":"cs.LG","authors_text":"Abdurakhmon Sadiev, Elnur Gasanov, Maksim Makarenko, Peter Richtarik, Rustem Islamov","submitted_at":"2022-10-31T23:09:01Z","abstract_excerpt":"We propose Adaptive Compressed Gradient Descent (AdaCGD) - a novel optimization algorithm for communication-efficient training of supervised machine learning models with adaptive compression level. Our approach is inspired by the recently proposed three point compressor (3PC) framework of Richtarik et al. (2022), which includes error feedback (EF21), lazily aggregated gradient (LAG), and their combination as special cases, and offers the current state-of-the-art rates for these methods under weak assumptions. While the above mechanisms offer a fixed compression level, or adapt between two extr"},"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":"2211.00188","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-10-31T23:09:01Z","cross_cats_sorted":["cs.DC","cs.IT","math.IT"],"title_canon_sha256":"ef621dc174def8d59d20279543b55746bf43f57ba69db51920084065613daa84","abstract_canon_sha256":"9ed6fd5684260ed78ed12d2e04b679981201f519aaa90207172e7ef3315ee994"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:12:19.596908Z","signature_b64":"nDWrdVi0574wvI8oxd6VR52Wyl8Yht58RgY9PtxinA8+NKJKC1gh8/nIQZbcFLR5i2JPLgvgMlAeTcY95LkIAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"acdfb7959d623c10cb2bc443d35b6218cf083604a984b3f7d364e5ecf0d08280","last_reissued_at":"2026-07-05T05:12:19.596457Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:12:19.596457Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adaptive Compression for Communication-Efficient Distributed Training","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DC","cs.IT","math.IT"],"primary_cat":"cs.LG","authors_text":"Abdurakhmon Sadiev, Elnur Gasanov, Maksim Makarenko, Peter Richtarik, Rustem Islamov","submitted_at":"2022-10-31T23:09:01Z","abstract_excerpt":"We propose Adaptive Compressed Gradient Descent (AdaCGD) - a novel optimization algorithm for communication-efficient training of supervised machine learning models with adaptive compression level. Our approach is inspired by the recently proposed three point compressor (3PC) framework of Richtarik et al. (2022), which includes error feedback (EF21), lazily aggregated gradient (LAG), and their combination as special cases, and offers the current state-of-the-art rates for these methods under weak assumptions. While the above mechanisms offer a fixed compression level, or adapt between two extr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.00188","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/2211.00188/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":"2211.00188","created_at":"2026-07-05T05:12:19.596517+00:00"},{"alias_kind":"arxiv_version","alias_value":"2211.00188v1","created_at":"2026-07-05T05:12:19.596517+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.00188","created_at":"2026-07-05T05:12:19.596517+00:00"},{"alias_kind":"pith_short_12","alias_value":"VTP3PFM5MI6B","created_at":"2026-07-05T05:12:19.596517+00:00"},{"alias_kind":"pith_short_16","alias_value":"VTP3PFM5MI6BBSZL","created_at":"2026-07-05T05:12:19.596517+00:00"},{"alias_kind":"pith_short_8","alias_value":"VTP3PFM5","created_at":"2026-07-05T05:12:19.596517+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.14371","citing_title":"Layer-wise Quantization for Quantized Optimistic Dual Averaging","ref_index":57,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VTP3PFM5MI6BBSZLYRB5GW3CDD","json":"https://pith.science/pith/VTP3PFM5MI6BBSZLYRB5GW3CDD.json","graph_json":"https://pith.science/api/pith-number/VTP3PFM5MI6BBSZLYRB5GW3CDD/graph.json","events_json":"https://pith.science/api/pith-number/VTP3PFM5MI6BBSZLYRB5GW3CDD/events.json","paper":"https://pith.science/paper/VTP3PFM5"},"agent_actions":{"view_html":"https://pith.science/pith/VTP3PFM5MI6BBSZLYRB5GW3CDD","download_json":"https://pith.science/pith/VTP3PFM5MI6BBSZLYRB5GW3CDD.json","view_paper":"https://pith.science/paper/VTP3PFM5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2211.00188&json=true","fetch_graph":"https://pith.science/api/pith-number/VTP3PFM5MI6BBSZLYRB5GW3CDD/graph.json","fetch_events":"https://pith.science/api/pith-number/VTP3PFM5MI6BBSZLYRB5GW3CDD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VTP3PFM5MI6BBSZLYRB5GW3CDD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VTP3PFM5MI6BBSZLYRB5GW3CDD/action/storage_attestation","attest_author":"https://pith.science/pith/VTP3PFM5MI6BBSZLYRB5GW3CDD/action/author_attestation","sign_citation":"https://pith.science/pith/VTP3PFM5MI6BBSZLYRB5GW3CDD/action/citation_signature","submit_replication":"https://pith.science/pith/VTP3PFM5MI6BBSZLYRB5GW3CDD/action/replication_record"}},"created_at":"2026-07-05T05:12:19.596517+00:00","updated_at":"2026-07-05T05:12:19.596517+00:00"}