{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:7WRJJTPCDRUCRSRX6HCV23T5N5","short_pith_number":"pith:7WRJJTPC","schema_version":"1.0","canonical_sha256":"fda294cde21c6828ca37f1c55d6e7d6f53276409581a330620713ce2a842fb14","source":{"kind":"arxiv","id":"2402.06412","version":2},"attestation_state":"computed","paper":{"title":"Improving the Worst-Case Bidirectional Communication Complexity for Nonconvex Distributed Optimization under Function Similarity","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Alexander Tyurin, Kaja Gruntkowska, Peter Richt\\'arik","submitted_at":"2024-02-09T13:58:33Z","abstract_excerpt":"Effective communication between the server and workers plays a key role in distributed optimization. In this paper, we focus on optimizing the server-to-worker communication, uncovering inefficiencies in prevalent downlink compression approaches. Considering first the pure setup where the uplink communication costs are negligible, we introduce MARINA-P, a novel method for downlink compression, employing a collection of correlated compressors. Theoretical analyses demonstrates that MARINA-P with permutation compressors can achieve a server-to-worker communication complexity improving with the n"},"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":"2402.06412","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.OC","submitted_at":"2024-02-09T13:58:33Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"9dd63b7751701585a86f48812e3434764f89bfc56e21ad852471e51265c82338","abstract_canon_sha256":"25d96bcf554e976f762fe53e9f77e8fb83707fad0d7eb82af225e0bbba5cc73b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:30:07.454086Z","signature_b64":"laCtPo4Pn7jz2RwTUv+5tJo5222DI1eckT35x5GhY/9WYmvFxG7eIASip6N40gg+TH1+dom4l1edp/GEDyhiBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fda294cde21c6828ca37f1c55d6e7d6f53276409581a330620713ce2a842fb14","last_reissued_at":"2026-07-05T09:30:07.453639Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:30:07.453639Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improving the Worst-Case Bidirectional Communication Complexity for Nonconvex Distributed Optimization under Function Similarity","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Alexander Tyurin, Kaja Gruntkowska, Peter Richt\\'arik","submitted_at":"2024-02-09T13:58:33Z","abstract_excerpt":"Effective communication between the server and workers plays a key role in distributed optimization. In this paper, we focus on optimizing the server-to-worker communication, uncovering inefficiencies in prevalent downlink compression approaches. Considering first the pure setup where the uplink communication costs are negligible, we introduce MARINA-P, a novel method for downlink compression, employing a collection of correlated compressors. Theoretical analyses demonstrates that MARINA-P with permutation compressors can achieve a server-to-worker communication complexity improving with the n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.06412","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/2402.06412/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":"2402.06412","created_at":"2026-07-05T09:30:07.453696+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.06412v2","created_at":"2026-07-05T09:30:07.453696+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.06412","created_at":"2026-07-05T09:30:07.453696+00:00"},{"alias_kind":"pith_short_12","alias_value":"7WRJJTPCDRUC","created_at":"2026-07-05T09:30:07.453696+00:00"},{"alias_kind":"pith_short_16","alias_value":"7WRJJTPCDRUCRSRX","created_at":"2026-07-05T09:30:07.453696+00:00"},{"alias_kind":"pith_short_8","alias_value":"7WRJJTPC","created_at":"2026-07-05T09:30:07.453696+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2410.15368","citing_title":"Tighter Performance Theory of FedExProx","ref_index":9,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7WRJJTPCDRUCRSRX6HCV23T5N5","json":"https://pith.science/pith/7WRJJTPCDRUCRSRX6HCV23T5N5.json","graph_json":"https://pith.science/api/pith-number/7WRJJTPCDRUCRSRX6HCV23T5N5/graph.json","events_json":"https://pith.science/api/pith-number/7WRJJTPCDRUCRSRX6HCV23T5N5/events.json","paper":"https://pith.science/paper/7WRJJTPC"},"agent_actions":{"view_html":"https://pith.science/pith/7WRJJTPCDRUCRSRX6HCV23T5N5","download_json":"https://pith.science/pith/7WRJJTPCDRUCRSRX6HCV23T5N5.json","view_paper":"https://pith.science/paper/7WRJJTPC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.06412&json=true","fetch_graph":"https://pith.science/api/pith-number/7WRJJTPCDRUCRSRX6HCV23T5N5/graph.json","fetch_events":"https://pith.science/api/pith-number/7WRJJTPCDRUCRSRX6HCV23T5N5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7WRJJTPCDRUCRSRX6HCV23T5N5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7WRJJTPCDRUCRSRX6HCV23T5N5/action/storage_attestation","attest_author":"https://pith.science/pith/7WRJJTPCDRUCRSRX6HCV23T5N5/action/author_attestation","sign_citation":"https://pith.science/pith/7WRJJTPCDRUCRSRX6HCV23T5N5/action/citation_signature","submit_replication":"https://pith.science/pith/7WRJJTPCDRUCRSRX6HCV23T5N5/action/replication_record"}},"created_at":"2026-07-05T09:30:07.453696+00:00","updated_at":"2026-07-05T09:30:07.453696+00:00"}