{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:HLIWINTNJE47ABJ2CWAEHEKVNW","short_pith_number":"pith:HLIWINTN","schema_version":"1.0","canonical_sha256":"3ad164366d4939f0053a15804391556d993289b32300874c92aef343dc9b6bdf","source":{"kind":"arxiv","id":"1906.07355","version":1},"attestation_state":"computed","paper":{"title":"Escaping from saddle points on Riemannian manifolds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Maryam Fazel, Nicolas Flammarion, Yue Sun","submitted_at":"2019-06-18T03:02:56Z","abstract_excerpt":"We consider minimizing a nonconvex, smooth function $f$ on a Riemannian manifold $\\mathcal{M}$. We show that a perturbed version of Riemannian gradient descent algorithm converges to a second-order stationary point (and hence is able to escape saddle points on the manifold). The rate of convergence depends as $1/\\epsilon^2$ on the accuracy $\\epsilon$, which matches a rate known only for unconstrained smooth minimization. The convergence rate depends polylogarithmically on the manifold dimension $d$, hence is almost dimension-free. The rate also has a polynomial dependence on the parameters des"},"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":"1906.07355","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-06-18T03:02:56Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"6abe598642e2f048f6fd75b1d6269bd61fa76eef674bbe74329dcec15fc5d8e8","abstract_canon_sha256":"81c432e17168a8c98f9d838dff90eea263b20655a7bc3d6e00497a3c111653f4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:08.118393Z","signature_b64":"Q4l3mK+6Jpy4RFixJDz0eE3aS95JCTdaJOC+d6BRr49B5GUxGFf7uyB3fYVU77Pdhi906RLysufXJlIGq+28BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3ad164366d4939f0053a15804391556d993289b32300874c92aef343dc9b6bdf","last_reissued_at":"2026-05-17T23:43:08.117816Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:08.117816Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Escaping from saddle points on Riemannian manifolds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Maryam Fazel, Nicolas Flammarion, Yue Sun","submitted_at":"2019-06-18T03:02:56Z","abstract_excerpt":"We consider minimizing a nonconvex, smooth function $f$ on a Riemannian manifold $\\mathcal{M}$. We show that a perturbed version of Riemannian gradient descent algorithm converges to a second-order stationary point (and hence is able to escape saddle points on the manifold). The rate of convergence depends as $1/\\epsilon^2$ on the accuracy $\\epsilon$, which matches a rate known only for unconstrained smooth minimization. The convergence rate depends polylogarithmically on the manifold dimension $d$, hence is almost dimension-free. The rate also has a polynomial dependence on the parameters des"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.07355","kind":"arxiv","version":1},"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":"1906.07355","created_at":"2026-05-17T23:43:08.117917+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.07355v1","created_at":"2026-05-17T23:43:08.117917+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.07355","created_at":"2026-05-17T23:43:08.117917+00:00"},{"alias_kind":"pith_short_12","alias_value":"HLIWINTNJE47","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"HLIWINTNJE47ABJ2","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"HLIWINTN","created_at":"2026-05-18T12:33:18.533446+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/HLIWINTNJE47ABJ2CWAEHEKVNW","json":"https://pith.science/pith/HLIWINTNJE47ABJ2CWAEHEKVNW.json","graph_json":"https://pith.science/api/pith-number/HLIWINTNJE47ABJ2CWAEHEKVNW/graph.json","events_json":"https://pith.science/api/pith-number/HLIWINTNJE47ABJ2CWAEHEKVNW/events.json","paper":"https://pith.science/paper/HLIWINTN"},"agent_actions":{"view_html":"https://pith.science/pith/HLIWINTNJE47ABJ2CWAEHEKVNW","download_json":"https://pith.science/pith/HLIWINTNJE47ABJ2CWAEHEKVNW.json","view_paper":"https://pith.science/paper/HLIWINTN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.07355&json=true","fetch_graph":"https://pith.science/api/pith-number/HLIWINTNJE47ABJ2CWAEHEKVNW/graph.json","fetch_events":"https://pith.science/api/pith-number/HLIWINTNJE47ABJ2CWAEHEKVNW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HLIWINTNJE47ABJ2CWAEHEKVNW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HLIWINTNJE47ABJ2CWAEHEKVNW/action/storage_attestation","attest_author":"https://pith.science/pith/HLIWINTNJE47ABJ2CWAEHEKVNW/action/author_attestation","sign_citation":"https://pith.science/pith/HLIWINTNJE47ABJ2CWAEHEKVNW/action/citation_signature","submit_replication":"https://pith.science/pith/HLIWINTNJE47ABJ2CWAEHEKVNW/action/replication_record"}},"created_at":"2026-05-17T23:43:08.117917+00:00","updated_at":"2026-05-17T23:43:08.117917+00:00"}