{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:FRFLYW4C4FA4GG6KPTNB3EMPN6","short_pith_number":"pith:FRFLYW4C","schema_version":"1.0","canonical_sha256":"2c4abc5b82e141c31bca7cda1d918f6f97b29f54c097547e608d2bd2ce748b20","source":{"kind":"arxiv","id":"1702.08704","version":2},"attestation_state":"computed","paper":{"title":"Optimal algorithms for smooth and strongly convex distributed optimization in networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"math.OC","authors_text":"Francis Bach (SIERRA), Kevin Scaman (MSR - INRIA), Laurent Massouli\\'e (MSR - INRIA), S\\'ebastien Bubeck, Yin Tat Lee","submitted_at":"2017-02-28T09:09:04Z","abstract_excerpt":"In this paper, we determine the optimal convergence rates for strongly convex and smooth distributed optimization in two settings: centralized and decentralized communications over a network. For centralized (i.e. master/slave) algorithms, we show that distributing Nesterov's accelerated gradient descent is optimal and achieves a precision $\\varepsilon > 0$ in time $O(\\sqrt{\\kappa_g}(1+\\Delta\\tau)\\ln(1/\\varepsilon))$, where $\\kappa_g$ is the condition number of the (global) function to optimize, $\\Delta$ is the diameter of the network, and $\\tau$ (resp. $1$) is the time needed to communicate v"},"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":"1702.08704","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-02-28T09:09:04Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"7608d5e29b17bb32a80e56fee1699a2b3ab72513a2ecd77cf725410a809709f1","abstract_canon_sha256":"fd920591ac552cac7ecaa1019620b01303df37952306dcd78439b50ec38f0a73"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:51.270293Z","signature_b64":"9c5CgRc6z1hhGBqTXOzqtxSnoPISLG1rMe87R1pdxiup5v6/r6SzVhTsBjpT2UZvTFkH2O8RmLjlUVrKbQ/JAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2c4abc5b82e141c31bca7cda1d918f6f97b29f54c097547e608d2bd2ce748b20","last_reissued_at":"2026-05-18T00:46:51.269737Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:51.269737Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal algorithms for smooth and strongly convex distributed optimization in networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"math.OC","authors_text":"Francis Bach (SIERRA), Kevin Scaman (MSR - INRIA), Laurent Massouli\\'e (MSR - INRIA), S\\'ebastien Bubeck, Yin Tat Lee","submitted_at":"2017-02-28T09:09:04Z","abstract_excerpt":"In this paper, we determine the optimal convergence rates for strongly convex and smooth distributed optimization in two settings: centralized and decentralized communications over a network. For centralized (i.e. master/slave) algorithms, we show that distributing Nesterov's accelerated gradient descent is optimal and achieves a precision $\\varepsilon > 0$ in time $O(\\sqrt{\\kappa_g}(1+\\Delta\\tau)\\ln(1/\\varepsilon))$, where $\\kappa_g$ is the condition number of the (global) function to optimize, $\\Delta$ is the diameter of the network, and $\\tau$ (resp. $1$) is the time needed to communicate v"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.08704","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":""},"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":"1702.08704","created_at":"2026-05-18T00:46:51.269810+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.08704v2","created_at":"2026-05-18T00:46:51.269810+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.08704","created_at":"2026-05-18T00:46:51.269810+00:00"},{"alias_kind":"pith_short_12","alias_value":"FRFLYW4C4FA4","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_16","alias_value":"FRFLYW4C4FA4GG6K","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_8","alias_value":"FRFLYW4C","created_at":"2026-05-18T12:31:15.632608+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/FRFLYW4C4FA4GG6KPTNB3EMPN6","json":"https://pith.science/pith/FRFLYW4C4FA4GG6KPTNB3EMPN6.json","graph_json":"https://pith.science/api/pith-number/FRFLYW4C4FA4GG6KPTNB3EMPN6/graph.json","events_json":"https://pith.science/api/pith-number/FRFLYW4C4FA4GG6KPTNB3EMPN6/events.json","paper":"https://pith.science/paper/FRFLYW4C"},"agent_actions":{"view_html":"https://pith.science/pith/FRFLYW4C4FA4GG6KPTNB3EMPN6","download_json":"https://pith.science/pith/FRFLYW4C4FA4GG6KPTNB3EMPN6.json","view_paper":"https://pith.science/paper/FRFLYW4C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.08704&json=true","fetch_graph":"https://pith.science/api/pith-number/FRFLYW4C4FA4GG6KPTNB3EMPN6/graph.json","fetch_events":"https://pith.science/api/pith-number/FRFLYW4C4FA4GG6KPTNB3EMPN6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FRFLYW4C4FA4GG6KPTNB3EMPN6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FRFLYW4C4FA4GG6KPTNB3EMPN6/action/storage_attestation","attest_author":"https://pith.science/pith/FRFLYW4C4FA4GG6KPTNB3EMPN6/action/author_attestation","sign_citation":"https://pith.science/pith/FRFLYW4C4FA4GG6KPTNB3EMPN6/action/citation_signature","submit_replication":"https://pith.science/pith/FRFLYW4C4FA4GG6KPTNB3EMPN6/action/replication_record"}},"created_at":"2026-05-18T00:46:51.269810+00:00","updated_at":"2026-05-18T00:46:51.269810+00:00"}