{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:25UHMCGDSECCPUY4LHE4ON7CTK","short_pith_number":"pith:25UHMCGD","schema_version":"1.0","canonical_sha256":"d7687608c3910427d31c59c9c737e29a8b67b73bf21ab6bf0a3a95657c3d904b","source":{"kind":"arxiv","id":"1901.09865","version":3},"attestation_state":"computed","paper":{"title":"Asynchronous Accelerated Proximal Stochastic Gradient for Strongly Convex Distributed Finite Sums","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"math.OC","authors_text":"Francis Bach, Hadrien Hendrikx, Laurent Massouli\\'e","submitted_at":"2019-01-28T18:12:37Z","abstract_excerpt":"In this work, we study the problem of minimizing the sum of strongly convex functions split over a network of $n$ nodes. We propose the decentralized and asynchronous algorithm ADFS to tackle the case when local functions are themselves finite sums with $m$ components. ADFS converges linearly when local functions are smooth, and matches the rates of the best known finite sum algorithms when executed on a single machine. On several machines, ADFS enjoys a $O (\\sqrt{n})$ or $O(n)$ speed-up depending on the leading complexity term as long as the diameter of the network is not too big with respect"},"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":"1901.09865","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-01-28T18:12:37Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"53f395886ebcb1300433a96b728886e0cdf7439d27c0c947555d92b754881d24","abstract_canon_sha256":"f6c50292393982206929e811bf99065c9482f411e05c444f6f812b45f8055167"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:23.708641Z","signature_b64":"lGiCJl13HXMvVH3USJb6qD1jrTP+guQHeXWkKJNySLWw28Toh8rhjaIQHWsqPBAAIg4ahIcF2+E2KA5d3+zaBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d7687608c3910427d31c59c9c737e29a8b67b73bf21ab6bf0a3a95657c3d904b","last_reissued_at":"2026-05-17T23:40:23.707974Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:23.707974Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Asynchronous Accelerated Proximal Stochastic Gradient for Strongly Convex Distributed Finite Sums","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"math.OC","authors_text":"Francis Bach, Hadrien Hendrikx, Laurent Massouli\\'e","submitted_at":"2019-01-28T18:12:37Z","abstract_excerpt":"In this work, we study the problem of minimizing the sum of strongly convex functions split over a network of $n$ nodes. We propose the decentralized and asynchronous algorithm ADFS to tackle the case when local functions are themselves finite sums with $m$ components. ADFS converges linearly when local functions are smooth, and matches the rates of the best known finite sum algorithms when executed on a single machine. On several machines, ADFS enjoys a $O (\\sqrt{n})$ or $O(n)$ speed-up depending on the leading complexity term as long as the diameter of the network is not too big with respect"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.09865","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":"1901.09865","created_at":"2026-05-17T23:40:23.708080+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.09865v3","created_at":"2026-05-17T23:40:23.708080+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.09865","created_at":"2026-05-17T23:40:23.708080+00:00"},{"alias_kind":"pith_short_12","alias_value":"25UHMCGDSECC","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_16","alias_value":"25UHMCGDSECCPUY4","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_8","alias_value":"25UHMCGD","created_at":"2026-05-18T12:33:07.085635+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/25UHMCGDSECCPUY4LHE4ON7CTK","json":"https://pith.science/pith/25UHMCGDSECCPUY4LHE4ON7CTK.json","graph_json":"https://pith.science/api/pith-number/25UHMCGDSECCPUY4LHE4ON7CTK/graph.json","events_json":"https://pith.science/api/pith-number/25UHMCGDSECCPUY4LHE4ON7CTK/events.json","paper":"https://pith.science/paper/25UHMCGD"},"agent_actions":{"view_html":"https://pith.science/pith/25UHMCGDSECCPUY4LHE4ON7CTK","download_json":"https://pith.science/pith/25UHMCGDSECCPUY4LHE4ON7CTK.json","view_paper":"https://pith.science/paper/25UHMCGD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.09865&json=true","fetch_graph":"https://pith.science/api/pith-number/25UHMCGDSECCPUY4LHE4ON7CTK/graph.json","fetch_events":"https://pith.science/api/pith-number/25UHMCGDSECCPUY4LHE4ON7CTK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/25UHMCGDSECCPUY4LHE4ON7CTK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/25UHMCGDSECCPUY4LHE4ON7CTK/action/storage_attestation","attest_author":"https://pith.science/pith/25UHMCGDSECCPUY4LHE4ON7CTK/action/author_attestation","sign_citation":"https://pith.science/pith/25UHMCGDSECCPUY4LHE4ON7CTK/action/citation_signature","submit_replication":"https://pith.science/pith/25UHMCGDSECCPUY4LHE4ON7CTK/action/replication_record"}},"created_at":"2026-05-17T23:40:23.708080+00:00","updated_at":"2026-05-17T23:40:23.708080+00:00"}