{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:KCEDUUXMKMQOLRDN2XAIIVFNB4","short_pith_number":"pith:KCEDUUXM","schema_version":"1.0","canonical_sha256":"50883a52ec5320e5c46dd5c08454ad0f18e39e268313e63e2c661a452d5e34b0","source":{"kind":"arxiv","id":"1904.09265","version":2},"attestation_state":"computed","paper":{"title":"SSRGD: Simple Stochastic Recursive Gradient Descent for Escaping Saddle Points","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Zhize Li","submitted_at":"2019-04-19T16:59:46Z","abstract_excerpt":"We analyze stochastic gradient algorithms for optimizing nonconvex problems. In particular, our goal is to find local minima (second-order stationary points) instead of just finding first-order stationary points which may be some bad unstable saddle points. We show that a simple perturbed version of stochastic recursive gradient descent algorithm (called SSRGD) can find an $(\\epsilon,\\delta)$-second-order stationary point with $\\widetilde{O}(\\sqrt{n}/\\epsilon^2 + \\sqrt{n}/\\delta^4 + n/\\delta^3)$ stochastic gradient complexity for nonconvex finite-sum problems. As a by-product, SSRGD finds an $"},"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":"1904.09265","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-19T16:59:46Z","cross_cats_sorted":["cs.DS","math.OC","stat.ML"],"title_canon_sha256":"6d6677c621829d7cf7a4e6bcbd35f7282f651164d4fc207359da40a1c5d02dad","abstract_canon_sha256":"4554f222bb25cec7b246ce36b38db31840ee78ce679f9db5fb657175668a6cb8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:48.182964Z","signature_b64":"wUQltnsoqoK3rQThT6Jwke8kMhPY8B11LEv6zmkE7l7NzgSj6GmHxfupAs39cFgjC5P/L7ZigL3ayh65auL8Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"50883a52ec5320e5c46dd5c08454ad0f18e39e268313e63e2c661a452d5e34b0","last_reissued_at":"2026-05-17T23:42:48.182236Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:48.182236Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SSRGD: Simple Stochastic Recursive Gradient Descent for Escaping Saddle Points","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Zhize Li","submitted_at":"2019-04-19T16:59:46Z","abstract_excerpt":"We analyze stochastic gradient algorithms for optimizing nonconvex problems. In particular, our goal is to find local minima (second-order stationary points) instead of just finding first-order stationary points which may be some bad unstable saddle points. We show that a simple perturbed version of stochastic recursive gradient descent algorithm (called SSRGD) can find an $(\\epsilon,\\delta)$-second-order stationary point with $\\widetilde{O}(\\sqrt{n}/\\epsilon^2 + \\sqrt{n}/\\delta^4 + n/\\delta^3)$ stochastic gradient complexity for nonconvex finite-sum problems. As a by-product, SSRGD finds an $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.09265","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":"1904.09265","created_at":"2026-05-17T23:42:48.182373+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.09265v2","created_at":"2026-05-17T23:42:48.182373+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.09265","created_at":"2026-05-17T23:42:48.182373+00:00"},{"alias_kind":"pith_short_12","alias_value":"KCEDUUXMKMQO","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_16","alias_value":"KCEDUUXMKMQOLRDN","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_8","alias_value":"KCEDUUXM","created_at":"2026-05-18T12:33:21.387695+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/KCEDUUXMKMQOLRDN2XAIIVFNB4","json":"https://pith.science/pith/KCEDUUXMKMQOLRDN2XAIIVFNB4.json","graph_json":"https://pith.science/api/pith-number/KCEDUUXMKMQOLRDN2XAIIVFNB4/graph.json","events_json":"https://pith.science/api/pith-number/KCEDUUXMKMQOLRDN2XAIIVFNB4/events.json","paper":"https://pith.science/paper/KCEDUUXM"},"agent_actions":{"view_html":"https://pith.science/pith/KCEDUUXMKMQOLRDN2XAIIVFNB4","download_json":"https://pith.science/pith/KCEDUUXMKMQOLRDN2XAIIVFNB4.json","view_paper":"https://pith.science/paper/KCEDUUXM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.09265&json=true","fetch_graph":"https://pith.science/api/pith-number/KCEDUUXMKMQOLRDN2XAIIVFNB4/graph.json","fetch_events":"https://pith.science/api/pith-number/KCEDUUXMKMQOLRDN2XAIIVFNB4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KCEDUUXMKMQOLRDN2XAIIVFNB4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KCEDUUXMKMQOLRDN2XAIIVFNB4/action/storage_attestation","attest_author":"https://pith.science/pith/KCEDUUXMKMQOLRDN2XAIIVFNB4/action/author_attestation","sign_citation":"https://pith.science/pith/KCEDUUXMKMQOLRDN2XAIIVFNB4/action/citation_signature","submit_replication":"https://pith.science/pith/KCEDUUXMKMQOLRDN2XAIIVFNB4/action/replication_record"}},"created_at":"2026-05-17T23:42:48.182373+00:00","updated_at":"2026-05-17T23:42:48.182373+00:00"}