{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:I3YPB4XA4JR4HW3P7I7XCTLSST","short_pith_number":"pith:I3YPB4XA","schema_version":"1.0","canonical_sha256":"46f0f0f2e0e263c3db6ffa3f714d7294c62d16e1e440ee8193342e8d41612a1d","source":{"kind":"arxiv","id":"2209.15218","version":2},"attestation_state":"computed","paper":{"title":"EF21-P and Friends: Improved Theoretical Communication Complexity for Distributed Optimization with Bidirectional Compression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"math.OC","authors_text":"Alexander Tyurin, Kaja Gruntkowska, Peter Richt\\'arik","submitted_at":"2022-09-30T04:14:49Z","abstract_excerpt":"In this work we focus our attention on distributed optimization problems in the context where the communication time between the server and the workers is non-negligible. We obtain novel methods supporting bidirectional compression (both from the server to the workers and vice versa) that enjoy new state-of-the-art theoretical communication complexity for convex and nonconvex problems. Our bounds are the first that manage to decouple the variance/error coming from the workers-to-server and server-to-workers compression, transforming a multiplicative dependence to an additive one. Moreover, in "},"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":"2209.15218","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-09-30T04:14:49Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"c5d019be037cb68891d9407d0e428a05eb318017764129887f7209e7069d9de7","abstract_canon_sha256":"948d8686829675c0f18802db62d96662fae7ae8a0349270e78a387ab6df5aa38"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:11:57.244423Z","signature_b64":"h2ANpD7RcTOpM8AY4vjaSQ9G8JjT3w6YoK1izKfXly0+lrez43r344MGEbGQC82xUX+zX6iGZs66blX3Wcp2DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"46f0f0f2e0e263c3db6ffa3f714d7294c62d16e1e440ee8193342e8d41612a1d","last_reissued_at":"2026-07-05T06:11:57.244047Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:11:57.244047Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"EF21-P and Friends: Improved Theoretical Communication Complexity for Distributed Optimization with Bidirectional Compression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"math.OC","authors_text":"Alexander Tyurin, Kaja Gruntkowska, Peter Richt\\'arik","submitted_at":"2022-09-30T04:14:49Z","abstract_excerpt":"In this work we focus our attention on distributed optimization problems in the context where the communication time between the server and the workers is non-negligible. We obtain novel methods supporting bidirectional compression (both from the server to the workers and vice versa) that enjoy new state-of-the-art theoretical communication complexity for convex and nonconvex problems. Our bounds are the first that manage to decouple the variance/error coming from the workers-to-server and server-to-workers compression, transforming a multiplicative dependence to an additive one. Moreover, in "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2209.15218","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/2209.15218/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":"2209.15218","created_at":"2026-07-05T06:11:57.244112+00:00"},{"alias_kind":"arxiv_version","alias_value":"2209.15218v2","created_at":"2026-07-05T06:11:57.244112+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.15218","created_at":"2026-07-05T06:11:57.244112+00:00"},{"alias_kind":"pith_short_12","alias_value":"I3YPB4XA4JR4","created_at":"2026-07-05T06:11:57.244112+00:00"},{"alias_kind":"pith_short_16","alias_value":"I3YPB4XA4JR4HW3P","created_at":"2026-07-05T06:11:57.244112+00:00"},{"alias_kind":"pith_short_8","alias_value":"I3YPB4XA","created_at":"2026-07-05T06:11:57.244112+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/I3YPB4XA4JR4HW3P7I7XCTLSST","json":"https://pith.science/pith/I3YPB4XA4JR4HW3P7I7XCTLSST.json","graph_json":"https://pith.science/api/pith-number/I3YPB4XA4JR4HW3P7I7XCTLSST/graph.json","events_json":"https://pith.science/api/pith-number/I3YPB4XA4JR4HW3P7I7XCTLSST/events.json","paper":"https://pith.science/paper/I3YPB4XA"},"agent_actions":{"view_html":"https://pith.science/pith/I3YPB4XA4JR4HW3P7I7XCTLSST","download_json":"https://pith.science/pith/I3YPB4XA4JR4HW3P7I7XCTLSST.json","view_paper":"https://pith.science/paper/I3YPB4XA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2209.15218&json=true","fetch_graph":"https://pith.science/api/pith-number/I3YPB4XA4JR4HW3P7I7XCTLSST/graph.json","fetch_events":"https://pith.science/api/pith-number/I3YPB4XA4JR4HW3P7I7XCTLSST/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I3YPB4XA4JR4HW3P7I7XCTLSST/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I3YPB4XA4JR4HW3P7I7XCTLSST/action/storage_attestation","attest_author":"https://pith.science/pith/I3YPB4XA4JR4HW3P7I7XCTLSST/action/author_attestation","sign_citation":"https://pith.science/pith/I3YPB4XA4JR4HW3P7I7XCTLSST/action/citation_signature","submit_replication":"https://pith.science/pith/I3YPB4XA4JR4HW3P7I7XCTLSST/action/replication_record"}},"created_at":"2026-07-05T06:11:57.244112+00:00","updated_at":"2026-07-05T06:11:57.244112+00:00"}