{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:PLONZ4ZTOPUBBHMHU6EDSC27D6","short_pith_number":"pith:PLONZ4ZT","schema_version":"1.0","canonical_sha256":"7adcdcf33373e8109d87a788390b5f1fa8762e445511ed45411d38591cb1fba8","source":{"kind":"arxiv","id":"2112.02089","version":3},"attestation_state":"computed","paper":{"title":"Regularized Newton Method with Global $O(1/k^2)$ Convergence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Konstantin Mishchenko","submitted_at":"2021-12-03T18:55:50Z","abstract_excerpt":"We present a Newton-type method that converges fast from any initialization and for arbitrary convex objectives with Lipschitz Hessians. We achieve this by merging the ideas of cubic regularization with a certain adaptive Levenberg--Marquardt penalty. In particular, we show that the iterates given by $x^{k+1}=x^k - \\bigl(\\nabla^2 f(x^k) + \\sqrt{H\\|\\nabla f(x^k)\\|} \\mathbf{I}\\bigr)^{-1}\\nabla f(x^k)$, where $H>0$ is a constant, converge globally with a $\\mathcal{O}(\\frac{1}{k^2})$ rate. Our method is the first variant of Newton's method that has both cheap iterations and provably fast global co"},"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":"2112.02089","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-12-03T18:55:50Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"ffc57be00affffac56ac9a763f9abe8ae384861db9bd532ba0565c5ab7bb7b82","abstract_canon_sha256":"0aea306aacb2f55427e325f8e5d7115546eccf626dff5454eb7995301d38816d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:47:01.416486Z","signature_b64":"UVbSmy69Yym7otiPbqCrkqkl1HVnxs06mVjJ/+bw6YniALHIB97Zvcz3vdexuGV56Omrq4c8jptruEMes4RmCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7adcdcf33373e8109d87a788390b5f1fa8762e445511ed45411d38591cb1fba8","last_reissued_at":"2026-07-05T05:47:01.416070Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:47:01.416070Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Regularized Newton Method with Global $O(1/k^2)$ Convergence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Konstantin Mishchenko","submitted_at":"2021-12-03T18:55:50Z","abstract_excerpt":"We present a Newton-type method that converges fast from any initialization and for arbitrary convex objectives with Lipschitz Hessians. We achieve this by merging the ideas of cubic regularization with a certain adaptive Levenberg--Marquardt penalty. In particular, we show that the iterates given by $x^{k+1}=x^k - \\bigl(\\nabla^2 f(x^k) + \\sqrt{H\\|\\nabla f(x^k)\\|} \\mathbf{I}\\bigr)^{-1}\\nabla f(x^k)$, where $H>0$ is a constant, converge globally with a $\\mathcal{O}(\\frac{1}{k^2})$ rate. Our method is the first variant of Newton's method that has both cheap iterations and provably fast global co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.02089","kind":"arxiv","version":3},"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/2112.02089/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":"2112.02089","created_at":"2026-07-05T05:47:01.416130+00:00"},{"alias_kind":"arxiv_version","alias_value":"2112.02089v3","created_at":"2026-07-05T05:47:01.416130+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.02089","created_at":"2026-07-05T05:47:01.416130+00:00"},{"alias_kind":"pith_short_12","alias_value":"PLONZ4ZTOPUB","created_at":"2026-07-05T05:47:01.416130+00:00"},{"alias_kind":"pith_short_16","alias_value":"PLONZ4ZTOPUBBHMH","created_at":"2026-07-05T05:47:01.416130+00:00"},{"alias_kind":"pith_short_8","alias_value":"PLONZ4ZT","created_at":"2026-07-05T05:47:01.416130+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.19712","citing_title":"Simple Stepsize for Quasi-Newton Methods with Global Convergence Guarantees","ref_index":2007,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PLONZ4ZTOPUBBHMHU6EDSC27D6","json":"https://pith.science/pith/PLONZ4ZTOPUBBHMHU6EDSC27D6.json","graph_json":"https://pith.science/api/pith-number/PLONZ4ZTOPUBBHMHU6EDSC27D6/graph.json","events_json":"https://pith.science/api/pith-number/PLONZ4ZTOPUBBHMHU6EDSC27D6/events.json","paper":"https://pith.science/paper/PLONZ4ZT"},"agent_actions":{"view_html":"https://pith.science/pith/PLONZ4ZTOPUBBHMHU6EDSC27D6","download_json":"https://pith.science/pith/PLONZ4ZTOPUBBHMHU6EDSC27D6.json","view_paper":"https://pith.science/paper/PLONZ4ZT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2112.02089&json=true","fetch_graph":"https://pith.science/api/pith-number/PLONZ4ZTOPUBBHMHU6EDSC27D6/graph.json","fetch_events":"https://pith.science/api/pith-number/PLONZ4ZTOPUBBHMHU6EDSC27D6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PLONZ4ZTOPUBBHMHU6EDSC27D6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PLONZ4ZTOPUBBHMHU6EDSC27D6/action/storage_attestation","attest_author":"https://pith.science/pith/PLONZ4ZTOPUBBHMHU6EDSC27D6/action/author_attestation","sign_citation":"https://pith.science/pith/PLONZ4ZTOPUBBHMHU6EDSC27D6/action/citation_signature","submit_replication":"https://pith.science/pith/PLONZ4ZTOPUBBHMHU6EDSC27D6/action/replication_record"}},"created_at":"2026-07-05T05:47:01.416130+00:00","updated_at":"2026-07-05T05:47:01.416130+00:00"}