{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:TMAUMPVI5Q5SUSFDWLKCQGSPQE","short_pith_number":"pith:TMAUMPVI","schema_version":"1.0","canonical_sha256":"9b01463ea8ec3b2a48a3b2d4281a4f812bd26f0170a10f0f3775cd94d031faba","source":{"kind":"arxiv","id":"2210.13931","version":4},"attestation_state":"computed","paper":{"title":"On the Complexity of Decentralized Smooth Nonconvex Finite-Sum Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Haishan Ye, Lesi Chen, Luo Luo, Yunyan Bai, Yuxing Liu","submitted_at":"2022-10-25T11:37:11Z","abstract_excerpt":"We study the decentralized optimization problem $\\min_{{\\bf x}\\in{\\mathbb R}^d} f({\\bf x})\\triangleq \\frac{1}{m}\\sum_{i=1}^m f_i({\\bf x})$, where the local function on the $i$-th agent has the form of $f_i({\\bf x})\\triangleq \\frac{1}{n}\\sum_{j=1}^n f_{i,j}({\\bf x})$ and every individual $f_{i,j}$ is smooth but possibly nonconvex. We propose a stochastic algorithm called DEcentralized probAbilistic Recursive gradiEnt deScenT (DEAREST) method, which achieves an $\\epsilon$-stationary point at each agent with the communication rounds of $\\tilde{\\mathcal O}(L\\epsilon^{-2}/\\sqrt{\\gamma}\\,)$, the com"},"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":"2210.13931","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2022-10-25T11:37:11Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"66d2de14a24fbac063bf780a94860e75e4d2b218f2c212b9e765d2722e489f6c","abstract_canon_sha256":"c7e7bba06b71e34bfa2c942956429a51cf6992e32d76ab8aff014fdfa4987e69"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:59:41.033182Z","signature_b64":"qhuIcIIfAMp8LYGfpMoFiar+XWwVlMYh76J5UNwBWmZRtrhthkiSikoXH2WysHUfqI7QMdz/QXJkRBzqfCGiDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9b01463ea8ec3b2a48a3b2d4281a4f812bd26f0170a10f0f3775cd94d031faba","last_reissued_at":"2026-07-05T09:59:41.032708Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:59:41.032708Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Complexity of Decentralized Smooth Nonconvex Finite-Sum Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Haishan Ye, Lesi Chen, Luo Luo, Yunyan Bai, Yuxing Liu","submitted_at":"2022-10-25T11:37:11Z","abstract_excerpt":"We study the decentralized optimization problem $\\min_{{\\bf x}\\in{\\mathbb R}^d} f({\\bf x})\\triangleq \\frac{1}{m}\\sum_{i=1}^m f_i({\\bf x})$, where the local function on the $i$-th agent has the form of $f_i({\\bf x})\\triangleq \\frac{1}{n}\\sum_{j=1}^n f_{i,j}({\\bf x})$ and every individual $f_{i,j}$ is smooth but possibly nonconvex. We propose a stochastic algorithm called DEcentralized probAbilistic Recursive gradiEnt deScenT (DEAREST) method, which achieves an $\\epsilon$-stationary point at each agent with the communication rounds of $\\tilde{\\mathcal O}(L\\epsilon^{-2}/\\sqrt{\\gamma}\\,)$, the com"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.13931","kind":"arxiv","version":4},"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/2210.13931/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":"2210.13931","created_at":"2026-07-05T09:59:41.032772+00:00"},{"alias_kind":"arxiv_version","alias_value":"2210.13931v4","created_at":"2026-07-05T09:59:41.032772+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.13931","created_at":"2026-07-05T09:59:41.032772+00:00"},{"alias_kind":"pith_short_12","alias_value":"TMAUMPVI5Q5S","created_at":"2026-07-05T09:59:41.032772+00:00"},{"alias_kind":"pith_short_16","alias_value":"TMAUMPVI5Q5SUSFD","created_at":"2026-07-05T09:59:41.032772+00:00"},{"alias_kind":"pith_short_8","alias_value":"TMAUMPVI","created_at":"2026-07-05T09:59:41.032772+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.08726","citing_title":"Decentralized Stochastic Nonconvex Optimization under the $(L_0,L_1)$-Smoothness","ref_index":34,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TMAUMPVI5Q5SUSFDWLKCQGSPQE","json":"https://pith.science/pith/TMAUMPVI5Q5SUSFDWLKCQGSPQE.json","graph_json":"https://pith.science/api/pith-number/TMAUMPVI5Q5SUSFDWLKCQGSPQE/graph.json","events_json":"https://pith.science/api/pith-number/TMAUMPVI5Q5SUSFDWLKCQGSPQE/events.json","paper":"https://pith.science/paper/TMAUMPVI"},"agent_actions":{"view_html":"https://pith.science/pith/TMAUMPVI5Q5SUSFDWLKCQGSPQE","download_json":"https://pith.science/pith/TMAUMPVI5Q5SUSFDWLKCQGSPQE.json","view_paper":"https://pith.science/paper/TMAUMPVI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2210.13931&json=true","fetch_graph":"https://pith.science/api/pith-number/TMAUMPVI5Q5SUSFDWLKCQGSPQE/graph.json","fetch_events":"https://pith.science/api/pith-number/TMAUMPVI5Q5SUSFDWLKCQGSPQE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TMAUMPVI5Q5SUSFDWLKCQGSPQE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TMAUMPVI5Q5SUSFDWLKCQGSPQE/action/storage_attestation","attest_author":"https://pith.science/pith/TMAUMPVI5Q5SUSFDWLKCQGSPQE/action/author_attestation","sign_citation":"https://pith.science/pith/TMAUMPVI5Q5SUSFDWLKCQGSPQE/action/citation_signature","submit_replication":"https://pith.science/pith/TMAUMPVI5Q5SUSFDWLKCQGSPQE/action/replication_record"}},"created_at":"2026-07-05T09:59:41.032772+00:00","updated_at":"2026-07-05T09:59:41.032772+00:00"}