{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:WV7AQW53DGCLNO4TSFGXZJXGFJ","short_pith_number":"pith:WV7AQW53","schema_version":"1.0","canonical_sha256":"b57e085bbb1984b6bb93914d7ca6e62a6eb347a72e5706aa63bd60b6fd34f196","source":{"kind":"arxiv","id":"2201.02664","version":3},"attestation_state":"computed","paper":{"title":"Optimizing the Communication-Accuracy Trade-off in Federated Learning with Rate-Distortion Theory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.IT","math.IT","stat.ML"],"primary_cat":"cs.LG","authors_text":"Jakub Kone\\v{c}n\\'y, Johannes Ball\\'e, Nicole Mitchell, Zachary Charles","submitted_at":"2022-01-07T20:17:33Z","abstract_excerpt":"A significant bottleneck in federated learning (FL) is the network communication cost of sending model updates from client devices to the central server. We present a comprehensive empirical study of the statistics of model updates in FL, as well as the role and benefits of various compression techniques. Motivated by these observations, we propose a novel method to reduce the average communication cost, which is near-optimal in many use cases, and outperforms Top-K, DRIVE, 3LC and QSGD on Stack Overflow next-word prediction, a realistic and challenging FL benchmark. This is achieved by examin"},"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":"2201.02664","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-01-07T20:17:33Z","cross_cats_sorted":["cs.DC","cs.IT","math.IT","stat.ML"],"title_canon_sha256":"60b54cea96a5f750623e25143b883663d944677075e0e8ce14552c69f56958fa","abstract_canon_sha256":"e9eafcc72ce7793b66f5b38c99ecaf547578b0cfa14a45f174f1ccd2e95b9147"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:24:57.972961Z","signature_b64":"ZeLuBZWHSplCjUddkRk3tkC/hQ2AdvBQF8XlO20/1oqgL/8+1H5GoDioeRXS9MyrdEozkeNGru5iWEPKj547CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b57e085bbb1984b6bb93914d7ca6e62a6eb347a72e5706aa63bd60b6fd34f196","last_reissued_at":"2026-07-05T04:24:57.972513Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:24:57.972513Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimizing the Communication-Accuracy Trade-off in Federated Learning with Rate-Distortion Theory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.IT","math.IT","stat.ML"],"primary_cat":"cs.LG","authors_text":"Jakub Kone\\v{c}n\\'y, Johannes Ball\\'e, Nicole Mitchell, Zachary Charles","submitted_at":"2022-01-07T20:17:33Z","abstract_excerpt":"A significant bottleneck in federated learning (FL) is the network communication cost of sending model updates from client devices to the central server. We present a comprehensive empirical study of the statistics of model updates in FL, as well as the role and benefits of various compression techniques. Motivated by these observations, we propose a novel method to reduce the average communication cost, which is near-optimal in many use cases, and outperforms Top-K, DRIVE, 3LC and QSGD on Stack Overflow next-word prediction, a realistic and challenging FL benchmark. This is achieved by examin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.02664","kind":"arxiv","version":3},"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/2201.02664/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":"2201.02664","created_at":"2026-07-05T04:24:57.972567+00:00"},{"alias_kind":"arxiv_version","alias_value":"2201.02664v3","created_at":"2026-07-05T04:24:57.972567+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.02664","created_at":"2026-07-05T04:24:57.972567+00:00"},{"alias_kind":"pith_short_12","alias_value":"WV7AQW53DGCL","created_at":"2026-07-05T04:24:57.972567+00:00"},{"alias_kind":"pith_short_16","alias_value":"WV7AQW53DGCLNO4T","created_at":"2026-07-05T04:24:57.972567+00:00"},{"alias_kind":"pith_short_8","alias_value":"WV7AQW53","created_at":"2026-07-05T04:24:57.972567+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.15706","citing_title":"Overcoming the Communication-Performance Tradeoff in LLM Pretraining","ref_index":2017,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WV7AQW53DGCLNO4TSFGXZJXGFJ","json":"https://pith.science/pith/WV7AQW53DGCLNO4TSFGXZJXGFJ.json","graph_json":"https://pith.science/api/pith-number/WV7AQW53DGCLNO4TSFGXZJXGFJ/graph.json","events_json":"https://pith.science/api/pith-number/WV7AQW53DGCLNO4TSFGXZJXGFJ/events.json","paper":"https://pith.science/paper/WV7AQW53"},"agent_actions":{"view_html":"https://pith.science/pith/WV7AQW53DGCLNO4TSFGXZJXGFJ","download_json":"https://pith.science/pith/WV7AQW53DGCLNO4TSFGXZJXGFJ.json","view_paper":"https://pith.science/paper/WV7AQW53","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2201.02664&json=true","fetch_graph":"https://pith.science/api/pith-number/WV7AQW53DGCLNO4TSFGXZJXGFJ/graph.json","fetch_events":"https://pith.science/api/pith-number/WV7AQW53DGCLNO4TSFGXZJXGFJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WV7AQW53DGCLNO4TSFGXZJXGFJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WV7AQW53DGCLNO4TSFGXZJXGFJ/action/storage_attestation","attest_author":"https://pith.science/pith/WV7AQW53DGCLNO4TSFGXZJXGFJ/action/author_attestation","sign_citation":"https://pith.science/pith/WV7AQW53DGCLNO4TSFGXZJXGFJ/action/citation_signature","submit_replication":"https://pith.science/pith/WV7AQW53DGCLNO4TSFGXZJXGFJ/action/replication_record"}},"created_at":"2026-07-05T04:24:57.972567+00:00","updated_at":"2026-07-05T04:24:57.972567+00:00"}