{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:KWL4CYOX6ZORHFMXL2CFKH7C7L","short_pith_number":"pith:KWL4CYOX","schema_version":"1.0","canonical_sha256":"5597c161d7f65d1395975e84551fe2faf5c7d6dd87f8c61cf1769062941a9c9f","source":{"kind":"arxiv","id":"2006.14591","version":4},"attestation_state":"computed","paper":{"title":"Bidirectional compression in heterogeneous settings for distributed or federated learning with partial participation: tight convergence guarantees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Aymeric Dieuleveut, Constantin Philippenko","submitted_at":"2020-06-25T17:37:45Z","abstract_excerpt":"We introduce a framework - Artemis - to tackle the problem of learning in a distributed or federated setting with communication constraints and device partial participation. Several workers (randomly sampled) perform the optimization process using a central server to aggregate their computations. To alleviate the communication cost, Artemis allows to compress the information sent in both directions (from the workers to the server and conversely) combined with a memory mechanism. It improves on existing algorithms that only consider unidirectional compression (to the server), or use very strong"},"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":"2006.14591","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-06-25T17:37:45Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"5dc269ed492ac018f10b03e4ee2feb9869fd4f0b45b9ced3a8ff7ed732fa2110","abstract_canon_sha256":"30143e8ec41c8ef1640cacbbb3ee27023692800b022252d824ec8506d9eb7441"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:32:47.545037Z","signature_b64":"pR5HK5e2BKyjxvSLrSYKGuoMgcCoDE4xaPPLMPWbBA+ZuuikB5OE39+j17aWMloeIefszWlFi2zxO3wt/pmSBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5597c161d7f65d1395975e84551fe2faf5c7d6dd87f8c61cf1769062941a9c9f","last_reissued_at":"2026-07-05T04:32:47.544522Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:32:47.544522Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bidirectional compression in heterogeneous settings for distributed or federated learning with partial participation: tight convergence guarantees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Aymeric Dieuleveut, Constantin Philippenko","submitted_at":"2020-06-25T17:37:45Z","abstract_excerpt":"We introduce a framework - Artemis - to tackle the problem of learning in a distributed or federated setting with communication constraints and device partial participation. Several workers (randomly sampled) perform the optimization process using a central server to aggregate their computations. To alleviate the communication cost, Artemis allows to compress the information sent in both directions (from the workers to the server and conversely) combined with a memory mechanism. It improves on existing algorithms that only consider unidirectional compression (to the server), or use very strong"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.14591","kind":"arxiv","version":4},"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/2006.14591/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":"2006.14591","created_at":"2026-07-05T04:32:47.544585+00:00"},{"alias_kind":"arxiv_version","alias_value":"2006.14591v4","created_at":"2026-07-05T04:32:47.544585+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.14591","created_at":"2026-07-05T04:32:47.544585+00:00"},{"alias_kind":"pith_short_12","alias_value":"KWL4CYOX6ZOR","created_at":"2026-07-05T04:32:47.544585+00:00"},{"alias_kind":"pith_short_16","alias_value":"KWL4CYOX6ZORHFMX","created_at":"2026-07-05T04:32:47.544585+00:00"},{"alias_kind":"pith_short_8","alias_value":"KWL4CYOX","created_at":"2026-07-05T04:32:47.544585+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.31594","citing_title":"A Tight Theory of Error Feedback Algorithms in Distributed Optimization","ref_index":31,"is_internal_anchor":false},{"citing_arxiv_id":"2605.20866","citing_title":"LOSCAR-SGD: Local SGD with Communication-Computation Overlap and Delay-Corrected Sparse Model Averaging","ref_index":190,"is_internal_anchor":false},{"citing_arxiv_id":"2605.18174","citing_title":"Ringmaster LMO: Asynchronous Linear Minimization Oracle Momentum Method","ref_index":189,"is_internal_anchor":false},{"citing_arxiv_id":"2605.08871","citing_title":"Rennala MVR: Improved Time Complexity for Parallel Stochastic Optimization via Momentum-Based Variance Reduction","ref_index":187,"is_internal_anchor":false},{"citing_arxiv_id":"2605.07795","citing_title":"Scalable Distributed Stochastic Optimization via Bidirectional Compression: Beyond Pessimistic Limits","ref_index":104,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KWL4CYOX6ZORHFMXL2CFKH7C7L","json":"https://pith.science/pith/KWL4CYOX6ZORHFMXL2CFKH7C7L.json","graph_json":"https://pith.science/api/pith-number/KWL4CYOX6ZORHFMXL2CFKH7C7L/graph.json","events_json":"https://pith.science/api/pith-number/KWL4CYOX6ZORHFMXL2CFKH7C7L/events.json","paper":"https://pith.science/paper/KWL4CYOX"},"agent_actions":{"view_html":"https://pith.science/pith/KWL4CYOX6ZORHFMXL2CFKH7C7L","download_json":"https://pith.science/pith/KWL4CYOX6ZORHFMXL2CFKH7C7L.json","view_paper":"https://pith.science/paper/KWL4CYOX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2006.14591&json=true","fetch_graph":"https://pith.science/api/pith-number/KWL4CYOX6ZORHFMXL2CFKH7C7L/graph.json","fetch_events":"https://pith.science/api/pith-number/KWL4CYOX6ZORHFMXL2CFKH7C7L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KWL4CYOX6ZORHFMXL2CFKH7C7L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KWL4CYOX6ZORHFMXL2CFKH7C7L/action/storage_attestation","attest_author":"https://pith.science/pith/KWL4CYOX6ZORHFMXL2CFKH7C7L/action/author_attestation","sign_citation":"https://pith.science/pith/KWL4CYOX6ZORHFMXL2CFKH7C7L/action/citation_signature","submit_replication":"https://pith.science/pith/KWL4CYOX6ZORHFMXL2CFKH7C7L/action/replication_record"}},"created_at":"2026-07-05T04:32:47.544585+00:00","updated_at":"2026-07-05T04:32:47.544585+00:00"}