{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:26W2AGKDDY5BRPY7C45AICKJMC","short_pith_number":"pith:26W2AGKD","schema_version":"1.0","canonical_sha256":"d7ada019431e3a18bf1f173a04094960ac7e0ac889656703e87c893201d7b650","source":{"kind":"arxiv","id":"2305.15264","version":1},"attestation_state":"computed","paper":{"title":"Error Feedback Shines when Features are Rare","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Elnur Gasanov, Konstantin Burlachenko, Peter Richt\\'arik","submitted_at":"2023-05-24T15:52:07Z","abstract_excerpt":"We provide the first proof that gradient descent $\\left({\\color{green}\\sf GD}\\right)$ with greedy sparsification $\\left({\\color{green}\\sf TopK}\\right)$ and error feedback $\\left({\\color{green}\\sf EF}\\right)$ can obtain better communication complexity than vanilla ${\\color{green}\\sf GD}$ when solving the distributed optimization problem $\\min_{x\\in \\mathbb{R}^d} {f(x)=\\frac{1}{n}\\sum_{i=1}^n f_i(x)}$, where $n$ = # of clients, $d$ = # of features, and $f_1,\\dots,f_n$ are smooth nonconvex functions. Despite intensive research since 2014 when ${\\color{green}\\sf EF}$ was first proposed by Seide et"},"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":"2305.15264","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-05-24T15:52:07Z","cross_cats_sorted":["cs.DC","cs.LG","stat.ML"],"title_canon_sha256":"14ad0125dcade7e5b3cf35bb1f02cdaa118810b5ee896738adc0935f55092154","abstract_canon_sha256":"9989cdbdbbc994dc431968db749abf91b594270ddc07c065d93f61e80c1906ac"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:13:33.124579Z","signature_b64":"07x6TIUab/e2rUoWy+i+ZGo/fhlX/E0T+sQnyQcP0OLS69XiKfGLLNtKDJqkMmLypOnE5l/TurVxFww18xGICg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d7ada019431e3a18bf1f173a04094960ac7e0ac889656703e87c893201d7b650","last_reissued_at":"2026-07-05T06:13:33.124111Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:13:33.124111Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Error Feedback Shines when Features are Rare","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Elnur Gasanov, Konstantin Burlachenko, Peter Richt\\'arik","submitted_at":"2023-05-24T15:52:07Z","abstract_excerpt":"We provide the first proof that gradient descent $\\left({\\color{green}\\sf GD}\\right)$ with greedy sparsification $\\left({\\color{green}\\sf TopK}\\right)$ and error feedback $\\left({\\color{green}\\sf EF}\\right)$ can obtain better communication complexity than vanilla ${\\color{green}\\sf GD}$ when solving the distributed optimization problem $\\min_{x\\in \\mathbb{R}^d} {f(x)=\\frac{1}{n}\\sum_{i=1}^n f_i(x)}$, where $n$ = # of clients, $d$ = # of features, and $f_1,\\dots,f_n$ are smooth nonconvex functions. Despite intensive research since 2014 when ${\\color{green}\\sf EF}$ was first proposed by Seide et"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.15264","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/2305.15264/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":"2305.15264","created_at":"2026-07-05T06:13:33.124163+00:00"},{"alias_kind":"arxiv_version","alias_value":"2305.15264v1","created_at":"2026-07-05T06:13:33.124163+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.15264","created_at":"2026-07-05T06:13:33.124163+00:00"},{"alias_kind":"pith_short_12","alias_value":"26W2AGKDDY5B","created_at":"2026-07-05T06:13:33.124163+00:00"},{"alias_kind":"pith_short_16","alias_value":"26W2AGKDDY5BRPY7","created_at":"2026-07-05T06:13:33.124163+00:00"},{"alias_kind":"pith_short_8","alias_value":"26W2AGKD","created_at":"2026-07-05T06:13:33.124163+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/26W2AGKDDY5BRPY7C45AICKJMC","json":"https://pith.science/pith/26W2AGKDDY5BRPY7C45AICKJMC.json","graph_json":"https://pith.science/api/pith-number/26W2AGKDDY5BRPY7C45AICKJMC/graph.json","events_json":"https://pith.science/api/pith-number/26W2AGKDDY5BRPY7C45AICKJMC/events.json","paper":"https://pith.science/paper/26W2AGKD"},"agent_actions":{"view_html":"https://pith.science/pith/26W2AGKDDY5BRPY7C45AICKJMC","download_json":"https://pith.science/pith/26W2AGKDDY5BRPY7C45AICKJMC.json","view_paper":"https://pith.science/paper/26W2AGKD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2305.15264&json=true","fetch_graph":"https://pith.science/api/pith-number/26W2AGKDDY5BRPY7C45AICKJMC/graph.json","fetch_events":"https://pith.science/api/pith-number/26W2AGKDDY5BRPY7C45AICKJMC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/26W2AGKDDY5BRPY7C45AICKJMC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/26W2AGKDDY5BRPY7C45AICKJMC/action/storage_attestation","attest_author":"https://pith.science/pith/26W2AGKDDY5BRPY7C45AICKJMC/action/author_attestation","sign_citation":"https://pith.science/pith/26W2AGKDDY5BRPY7C45AICKJMC/action/citation_signature","submit_replication":"https://pith.science/pith/26W2AGKDDY5BRPY7C45AICKJMC/action/replication_record"}},"created_at":"2026-07-05T06:13:33.124163+00:00","updated_at":"2026-07-05T06:13:33.124163+00:00"}