{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:RKHUL4N53UG5Q2MZQKBEKRSQFV","short_pith_number":"pith:RKHUL4N5","schema_version":"1.0","canonical_sha256":"8a8f45f1bddd0dd8699982824546502d4a181ad7b1ad1bd80fe6099982eb3bf4","source":{"kind":"arxiv","id":"1809.02162","version":2},"attestation_state":"computed","paper":{"title":"Escaping Saddle Points in Constrained Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Ali Jadbabaie, Aryan Mokhtari, Asuman Ozdaglar","submitted_at":"2018-09-06T18:34:36Z","abstract_excerpt":"In this paper, we study the problem of escaping from saddle points in smooth nonconvex optimization problems subject to a convex set $\\mathcal{C}$. We propose a generic framework that yields convergence to a second-order stationary point of the problem, if the convex set $\\mathcal{C}$ is simple for a quadratic objective function. Specifically, our results hold if one can find a $\\rho$-approximate solution of a quadratic program subject to $\\mathcal{C}$ in polynomial time, where $\\rho<1$ is a positive constant that depends on the structure of the set $\\mathcal{C}$. Under this condition, we show"},"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":"1809.02162","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-09-06T18:34:36Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"e2fde8e23628e843a7722e27f22535b6176c724b3fdbc3b98557a4bf017f50c6","abstract_canon_sha256":"041e37979932dcb8ca503a9e93a677dcf2c939739f505852f511341685d73fce"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:45.296270Z","signature_b64":"KMfQZnn12d11JXCV8va/5co7Cm2pjc85wWzn1OdUPoMr8xXwFYfm4deFrgr6qgqiVIM8+Fg1UrguWzRyAarRAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8a8f45f1bddd0dd8699982824546502d4a181ad7b1ad1bd80fe6099982eb3bf4","last_reissued_at":"2026-05-18T00:03:45.295771Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:45.295771Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Escaping Saddle Points in Constrained Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Ali Jadbabaie, Aryan Mokhtari, Asuman Ozdaglar","submitted_at":"2018-09-06T18:34:36Z","abstract_excerpt":"In this paper, we study the problem of escaping from saddle points in smooth nonconvex optimization problems subject to a convex set $\\mathcal{C}$. We propose a generic framework that yields convergence to a second-order stationary point of the problem, if the convex set $\\mathcal{C}$ is simple for a quadratic objective function. Specifically, our results hold if one can find a $\\rho$-approximate solution of a quadratic program subject to $\\mathcal{C}$ in polynomial time, where $\\rho<1$ is a positive constant that depends on the structure of the set $\\mathcal{C}$. Under this condition, we show"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.02162","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":"1809.02162","created_at":"2026-05-18T00:03:45.295859+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.02162v2","created_at":"2026-05-18T00:03:45.295859+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.02162","created_at":"2026-05-18T00:03:45.295859+00:00"},{"alias_kind":"pith_short_12","alias_value":"RKHUL4N53UG5","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_16","alias_value":"RKHUL4N53UG5Q2MZ","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_8","alias_value":"RKHUL4N5","created_at":"2026-05-18T12:32:50.500415+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.24488","citing_title":"Scalable First-Order Interior Point Trust Region Algorithms for Linearly Constrained Optimization","ref_index":34,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RKHUL4N53UG5Q2MZQKBEKRSQFV","json":"https://pith.science/pith/RKHUL4N53UG5Q2MZQKBEKRSQFV.json","graph_json":"https://pith.science/api/pith-number/RKHUL4N53UG5Q2MZQKBEKRSQFV/graph.json","events_json":"https://pith.science/api/pith-number/RKHUL4N53UG5Q2MZQKBEKRSQFV/events.json","paper":"https://pith.science/paper/RKHUL4N5"},"agent_actions":{"view_html":"https://pith.science/pith/RKHUL4N53UG5Q2MZQKBEKRSQFV","download_json":"https://pith.science/pith/RKHUL4N53UG5Q2MZQKBEKRSQFV.json","view_paper":"https://pith.science/paper/RKHUL4N5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.02162&json=true","fetch_graph":"https://pith.science/api/pith-number/RKHUL4N53UG5Q2MZQKBEKRSQFV/graph.json","fetch_events":"https://pith.science/api/pith-number/RKHUL4N53UG5Q2MZQKBEKRSQFV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RKHUL4N53UG5Q2MZQKBEKRSQFV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RKHUL4N53UG5Q2MZQKBEKRSQFV/action/storage_attestation","attest_author":"https://pith.science/pith/RKHUL4N53UG5Q2MZQKBEKRSQFV/action/author_attestation","sign_citation":"https://pith.science/pith/RKHUL4N53UG5Q2MZQKBEKRSQFV/action/citation_signature","submit_replication":"https://pith.science/pith/RKHUL4N53UG5Q2MZQKBEKRSQFV/action/replication_record"}},"created_at":"2026-05-18T00:03:45.295859+00:00","updated_at":"2026-05-18T00:03:45.295859+00:00"}