{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:WOTQKYY23I6LG2LOWI2I5IGS3H","short_pith_number":"pith:WOTQKYY2","schema_version":"1.0","canonical_sha256":"b3a705631ada3cb3696eb2348ea0d2d9c3be7af7278922557cde5351354bb97c","source":{"kind":"arxiv","id":"2207.03957","version":1},"attestation_state":"computed","paper":{"title":"Communication Acceleration of Local Gradient Methods via an Accelerated Primal-Dual Algorithm with Inexact Prox","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DC","math.OC"],"primary_cat":"cs.LG","authors_text":"Abdurakhmon Sadiev, Dmitry Kovalev, Peter Richt\\'arik","submitted_at":"2022-07-08T15:24:13Z","abstract_excerpt":"Inspired by a recent breakthrough of Mishchenko et al (2022), who for the first time showed that local gradient steps can lead to provable communication acceleration, we propose an alternative algorithm which obtains the same communication acceleration as their method (ProxSkip). Our approach is very different, however: it is based on the celebrated method of Chambolle and Pock (2011), with several nontrivial modifications: i) we allow for an inexact computation of the prox operator of a certain smooth strongly convex function via a suitable gradient-based method (e.g., GD, Fast GD or FSFOM), "},"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":"2207.03957","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-07-08T15:24:13Z","cross_cats_sorted":["cs.DC","math.OC"],"title_canon_sha256":"95ca1f52f0b4fa9f6fea0eb6712b96e96812ad9e854271f0e062565c920b4af6","abstract_canon_sha256":"0b51fe053bb01f45ff3b14ca937820a38a93dec963097a72dfca233d1d7a6396"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:38:38.516258Z","signature_b64":"LMg2MTBO1PvGjgHguC0ZvKy1XUanZtETVQQcF2SfQ2Smc1hy7IsZtdHoE8DZERQvCroLFDr6BsdwM/m4tPHQAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b3a705631ada3cb3696eb2348ea0d2d9c3be7af7278922557cde5351354bb97c","last_reissued_at":"2026-07-05T04:38:38.515839Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:38:38.515839Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Communication Acceleration of Local Gradient Methods via an Accelerated Primal-Dual Algorithm with Inexact Prox","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DC","math.OC"],"primary_cat":"cs.LG","authors_text":"Abdurakhmon Sadiev, Dmitry Kovalev, Peter Richt\\'arik","submitted_at":"2022-07-08T15:24:13Z","abstract_excerpt":"Inspired by a recent breakthrough of Mishchenko et al (2022), who for the first time showed that local gradient steps can lead to provable communication acceleration, we propose an alternative algorithm which obtains the same communication acceleration as their method (ProxSkip). Our approach is very different, however: it is based on the celebrated method of Chambolle and Pock (2011), with several nontrivial modifications: i) we allow for an inexact computation of the prox operator of a certain smooth strongly convex function via a suitable gradient-based method (e.g., GD, Fast GD or FSFOM), "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.03957","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/2207.03957/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":"2207.03957","created_at":"2026-07-05T04:38:38.515898+00:00"},{"alias_kind":"arxiv_version","alias_value":"2207.03957v1","created_at":"2026-07-05T04:38:38.515898+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.03957","created_at":"2026-07-05T04:38:38.515898+00:00"},{"alias_kind":"pith_short_12","alias_value":"WOTQKYY23I6L","created_at":"2026-07-05T04:38:38.515898+00:00"},{"alias_kind":"pith_short_16","alias_value":"WOTQKYY23I6LG2LO","created_at":"2026-07-05T04:38:38.515898+00:00"},{"alias_kind":"pith_short_8","alias_value":"WOTQKYY2","created_at":"2026-07-05T04:38:38.515898+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.13434","citing_title":"Rescaled Asynchronous SGD: Optimal Distributed Optimization under Data and System Heterogeneity","ref_index":47,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WOTQKYY23I6LG2LOWI2I5IGS3H","json":"https://pith.science/pith/WOTQKYY23I6LG2LOWI2I5IGS3H.json","graph_json":"https://pith.science/api/pith-number/WOTQKYY23I6LG2LOWI2I5IGS3H/graph.json","events_json":"https://pith.science/api/pith-number/WOTQKYY23I6LG2LOWI2I5IGS3H/events.json","paper":"https://pith.science/paper/WOTQKYY2"},"agent_actions":{"view_html":"https://pith.science/pith/WOTQKYY23I6LG2LOWI2I5IGS3H","download_json":"https://pith.science/pith/WOTQKYY23I6LG2LOWI2I5IGS3H.json","view_paper":"https://pith.science/paper/WOTQKYY2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2207.03957&json=true","fetch_graph":"https://pith.science/api/pith-number/WOTQKYY23I6LG2LOWI2I5IGS3H/graph.json","fetch_events":"https://pith.science/api/pith-number/WOTQKYY23I6LG2LOWI2I5IGS3H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WOTQKYY23I6LG2LOWI2I5IGS3H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WOTQKYY23I6LG2LOWI2I5IGS3H/action/storage_attestation","attest_author":"https://pith.science/pith/WOTQKYY23I6LG2LOWI2I5IGS3H/action/author_attestation","sign_citation":"https://pith.science/pith/WOTQKYY23I6LG2LOWI2I5IGS3H/action/citation_signature","submit_replication":"https://pith.science/pith/WOTQKYY23I6LG2LOWI2I5IGS3H/action/replication_record"}},"created_at":"2026-07-05T04:38:38.515898+00:00","updated_at":"2026-07-05T04:38:38.515898+00:00"}