{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:4AIMN27TGXF475F4ROIRS3NV5H","short_pith_number":"pith:4AIMN27T","schema_version":"1.0","canonical_sha256":"e010c6ebf335cbcff4bc8b91196db5e9d9b25f0a17a37f094705760ac2017d91","source":{"kind":"arxiv","id":"2006.01512","version":4},"attestation_state":"computed","paper":{"title":"A fast and simple modification of Newton's method helping to avoid saddle points","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NA","math.DS","math.NA","stat.ML"],"primary_cat":"math.OC","authors_text":"Hoang Phuong Nguyen, Maged Helmy, Tat Dat To, Thu Hang Nguyen, Tuan Hang Nguyen, Tuyen Trung Truong","submitted_at":"2020-06-02T10:38:00Z","abstract_excerpt":"We propose in this paper New Q-Newton's method. The update rule is very simple conceptually, for example $x_{n+1}=x_n-w_n$ where $w_n=pr_{A_n,+}(v_n)-pr_{A_n,-}(v_n)$, with $A_n=\\nabla ^2f(x_n)+\\delta _n||\\nabla f(x_n)||^2.Id$ and $v_n=A_n^{-1}.\\nabla f(x_n)$. Here $\\delta _n$ is an appropriate real number so that $A_n$ is invertible, and $pr_{A_n,\\pm}$ are projections to the vector subspaces generated by eigenvectors of positive (correspondingly negative) eigenvalues of $A_n$.\n  The main result of this paper roughly says that if $f$ is $C^3$ (can be unbounded from below) and a sequence $\\{x_n"},"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":"2006.01512","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-06-02T10:38:00Z","cross_cats_sorted":["cs.LG","cs.NA","math.DS","math.NA","stat.ML"],"title_canon_sha256":"0b763328f976a76dfa834f8bd6bca1ecc62ede882ba9c8e6f8ff2fa91ed0c34f","abstract_canon_sha256":"a0f12bdb5cc2957286754940743fda3e3f53719d3bd09d9a3524d36287231d01"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:12:44.866602Z","signature_b64":"fUg69NcQsJL8z74zwApwxDm/Xa50Ioy2FRR00q8kZY3MxnBJN0ECDuxnhn515F6ChXUpBSDpIy7blI0HDZvhBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e010c6ebf335cbcff4bc8b91196db5e9d9b25f0a17a37f094705760ac2017d91","last_reissued_at":"2026-07-05T03:12:44.865997Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:12:44.865997Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A fast and simple modification of Newton's method helping to avoid saddle points","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NA","math.DS","math.NA","stat.ML"],"primary_cat":"math.OC","authors_text":"Hoang Phuong Nguyen, Maged Helmy, Tat Dat To, Thu Hang Nguyen, Tuan Hang Nguyen, Tuyen Trung Truong","submitted_at":"2020-06-02T10:38:00Z","abstract_excerpt":"We propose in this paper New Q-Newton's method. The update rule is very simple conceptually, for example $x_{n+1}=x_n-w_n$ where $w_n=pr_{A_n,+}(v_n)-pr_{A_n,-}(v_n)$, with $A_n=\\nabla ^2f(x_n)+\\delta _n||\\nabla f(x_n)||^2.Id$ and $v_n=A_n^{-1}.\\nabla f(x_n)$. Here $\\delta _n$ is an appropriate real number so that $A_n$ is invertible, and $pr_{A_n,\\pm}$ are projections to the vector subspaces generated by eigenvectors of positive (correspondingly negative) eigenvalues of $A_n$.\n  The main result of this paper roughly says that if $f$ is $C^3$ (can be unbounded from below) and a sequence $\\{x_n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.01512","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/2006.01512/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":"2006.01512","created_at":"2026-07-05T03:12:44.866060+00:00"},{"alias_kind":"arxiv_version","alias_value":"2006.01512v4","created_at":"2026-07-05T03:12:44.866060+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.01512","created_at":"2026-07-05T03:12:44.866060+00:00"},{"alias_kind":"pith_short_12","alias_value":"4AIMN27TGXF4","created_at":"2026-07-05T03:12:44.866060+00:00"},{"alias_kind":"pith_short_16","alias_value":"4AIMN27TGXF475F4","created_at":"2026-07-05T03:12:44.866060+00:00"},{"alias_kind":"pith_short_8","alias_value":"4AIMN27T","created_at":"2026-07-05T03:12:44.866060+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.22180","citing_title":"Some iterative algorithms on Riemannian manifolds and Banach spaces with good global convergence guarantee","ref_index":45,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4AIMN27TGXF475F4ROIRS3NV5H","json":"https://pith.science/pith/4AIMN27TGXF475F4ROIRS3NV5H.json","graph_json":"https://pith.science/api/pith-number/4AIMN27TGXF475F4ROIRS3NV5H/graph.json","events_json":"https://pith.science/api/pith-number/4AIMN27TGXF475F4ROIRS3NV5H/events.json","paper":"https://pith.science/paper/4AIMN27T"},"agent_actions":{"view_html":"https://pith.science/pith/4AIMN27TGXF475F4ROIRS3NV5H","download_json":"https://pith.science/pith/4AIMN27TGXF475F4ROIRS3NV5H.json","view_paper":"https://pith.science/paper/4AIMN27T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2006.01512&json=true","fetch_graph":"https://pith.science/api/pith-number/4AIMN27TGXF475F4ROIRS3NV5H/graph.json","fetch_events":"https://pith.science/api/pith-number/4AIMN27TGXF475F4ROIRS3NV5H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4AIMN27TGXF475F4ROIRS3NV5H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4AIMN27TGXF475F4ROIRS3NV5H/action/storage_attestation","attest_author":"https://pith.science/pith/4AIMN27TGXF475F4ROIRS3NV5H/action/author_attestation","sign_citation":"https://pith.science/pith/4AIMN27TGXF475F4ROIRS3NV5H/action/citation_signature","submit_replication":"https://pith.science/pith/4AIMN27TGXF475F4ROIRS3NV5H/action/replication_record"}},"created_at":"2026-07-05T03:12:44.866060+00:00","updated_at":"2026-07-05T03:12:44.866060+00:00"}