{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:B45IXS4K3J3EP5XEFSQ5IQFPKW","short_pith_number":"pith:B45IXS4K","schema_version":"1.0","canonical_sha256":"0f3a8bcb8ada7647f6e42ca1d440af5586b6129a78ccfbd8c6a56a6bfe788f55","source":{"kind":"arxiv","id":"1810.02660","version":3},"attestation_state":"computed","paper":{"title":"Accelerated Decentralized Optimization with Local Updates for Smooth and Strongly Convex Objectives","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.LG"],"primary_cat":"math.OC","authors_text":"Francis Bach, Hadrien Hendrikx, Laurent Massouli\\'e","submitted_at":"2018-10-05T13:06:43Z","abstract_excerpt":"In this paper, we study the problem of minimizing a sum of smooth and strongly convex functions split over the nodes of a network in a decentralized fashion. We propose the algorithm $ESDACD$, a decentralized accelerated algorithm that only requires local synchrony. Its rate depends on the condition number $\\kappa$ of the local functions as well as the network topology and delays. Under mild assumptions on the topology of the graph, $ESDACD$ takes a time $O((\\tau_{\\max} + \\Delta_{\\max})\\sqrt{{\\kappa}/{\\gamma}}\\ln(\\epsilon^{-1}))$ to reach a precision $\\epsilon$ where $\\gamma$ is the spectral g"},"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":"1810.02660","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-10-05T13:06:43Z","cross_cats_sorted":["cs.DC","cs.LG"],"title_canon_sha256":"0f574ff4f247ea12b56d653c9d82c8f9d84ceaa9ea037a1327dd17e736752fb4","abstract_canon_sha256":"626d6a356cdf6b548b8671b60c2123bfe4a540ef26bf49b9a093478a0269a6a1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:58.724229Z","signature_b64":"mL3TvpbqTmqMHXXaSWpt3lk2HoJuNtEp/Xq+pWijO++EoRm2u8cTPVWPhn1twT3tORmJccMqxUVL9+2GFK75Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0f3a8bcb8ada7647f6e42ca1d440af5586b6129a78ccfbd8c6a56a6bfe788f55","last_reissued_at":"2026-05-17T23:52:58.723632Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:58.723632Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Accelerated Decentralized Optimization with Local Updates for Smooth and Strongly Convex Objectives","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.LG"],"primary_cat":"math.OC","authors_text":"Francis Bach, Hadrien Hendrikx, Laurent Massouli\\'e","submitted_at":"2018-10-05T13:06:43Z","abstract_excerpt":"In this paper, we study the problem of minimizing a sum of smooth and strongly convex functions split over the nodes of a network in a decentralized fashion. We propose the algorithm $ESDACD$, a decentralized accelerated algorithm that only requires local synchrony. Its rate depends on the condition number $\\kappa$ of the local functions as well as the network topology and delays. Under mild assumptions on the topology of the graph, $ESDACD$ takes a time $O((\\tau_{\\max} + \\Delta_{\\max})\\sqrt{{\\kappa}/{\\gamma}}\\ln(\\epsilon^{-1}))$ to reach a precision $\\epsilon$ where $\\gamma$ is the spectral g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.02660","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1810.02660","created_at":"2026-05-17T23:52:58.723734+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.02660v3","created_at":"2026-05-17T23:52:58.723734+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.02660","created_at":"2026-05-17T23:52:58.723734+00:00"},{"alias_kind":"pith_short_12","alias_value":"B45IXS4K3J3E","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_16","alias_value":"B45IXS4K3J3EP5XE","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_8","alias_value":"B45IXS4K","created_at":"2026-05-18T12:32:13.499390+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/B45IXS4K3J3EP5XEFSQ5IQFPKW","json":"https://pith.science/pith/B45IXS4K3J3EP5XEFSQ5IQFPKW.json","graph_json":"https://pith.science/api/pith-number/B45IXS4K3J3EP5XEFSQ5IQFPKW/graph.json","events_json":"https://pith.science/api/pith-number/B45IXS4K3J3EP5XEFSQ5IQFPKW/events.json","paper":"https://pith.science/paper/B45IXS4K"},"agent_actions":{"view_html":"https://pith.science/pith/B45IXS4K3J3EP5XEFSQ5IQFPKW","download_json":"https://pith.science/pith/B45IXS4K3J3EP5XEFSQ5IQFPKW.json","view_paper":"https://pith.science/paper/B45IXS4K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.02660&json=true","fetch_graph":"https://pith.science/api/pith-number/B45IXS4K3J3EP5XEFSQ5IQFPKW/graph.json","fetch_events":"https://pith.science/api/pith-number/B45IXS4K3J3EP5XEFSQ5IQFPKW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B45IXS4K3J3EP5XEFSQ5IQFPKW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B45IXS4K3J3EP5XEFSQ5IQFPKW/action/storage_attestation","attest_author":"https://pith.science/pith/B45IXS4K3J3EP5XEFSQ5IQFPKW/action/author_attestation","sign_citation":"https://pith.science/pith/B45IXS4K3J3EP5XEFSQ5IQFPKW/action/citation_signature","submit_replication":"https://pith.science/pith/B45IXS4K3J3EP5XEFSQ5IQFPKW/action/replication_record"}},"created_at":"2026-05-17T23:52:58.723734+00:00","updated_at":"2026-05-17T23:52:58.723734+00:00"}