{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:6SPZ3MXHIMJ6HQV2HH4HHJPUKB","short_pith_number":"pith:6SPZ3MXH","schema_version":"1.0","canonical_sha256":"f49f9db2e74313e3c2ba39f873a5f45050e0710a67734c9268f4f2dc0d6fb284","source":{"kind":"arxiv","id":"2302.04987","version":2},"attestation_state":"computed","paper":{"title":"Cubic Regularization is the Key! The First Accelerated Quasi-Newton Method with a Global Convergence Rate of $O(k^{-2})$ for Convex Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Artem Agafonov, Dmitry Kamzolov, Klea Ziu, Martin Tak\\'a\\v{c}","submitted_at":"2023-02-10T00:21:14Z","abstract_excerpt":"In this paper, we propose the first Quasi-Newton method with a global convergence rate of $O(k^{-1})$ for general convex functions. Quasi-Newton methods, such as BFGS, SR-1, are well-known for their impressive practical performance. However, they may be slower than gradient descent for general convex functions, with the best theoretical rate of $O(k^{-1/3})$. This gap between impressive practical performance and poor theoretical guarantees was an open question for a long period of time. In this paper, we make a significant step to close this gap. We improve upon the existing rate and propose t"},"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":"2302.04987","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-02-10T00:21:14Z","cross_cats_sorted":[],"title_canon_sha256":"68691b14b460599617279190910320abe5441a2c34f9941e9601b61c4b4a61dd","abstract_canon_sha256":"bf7ce2781a6628ee42ae782746609fd29afe46d180498b3cb9a4a784758ef864"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:14:40.658794Z","signature_b64":"KYA09w20EdwQ/XI3W7jrot2GpbRgErB1c3ELkG3zGGiRgTzhiOor1ea9yTsUJKDiDcpKGh4HT6OtySh95o0VDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f49f9db2e74313e3c2ba39f873a5f45050e0710a67734c9268f4f2dc0d6fb284","last_reissued_at":"2026-07-05T06:14:40.658233Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:14:40.658233Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cubic Regularization is the Key! The First Accelerated Quasi-Newton Method with a Global Convergence Rate of $O(k^{-2})$ for Convex Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Artem Agafonov, Dmitry Kamzolov, Klea Ziu, Martin Tak\\'a\\v{c}","submitted_at":"2023-02-10T00:21:14Z","abstract_excerpt":"In this paper, we propose the first Quasi-Newton method with a global convergence rate of $O(k^{-1})$ for general convex functions. Quasi-Newton methods, such as BFGS, SR-1, are well-known for their impressive practical performance. However, they may be slower than gradient descent for general convex functions, with the best theoretical rate of $O(k^{-1/3})$. This gap between impressive practical performance and poor theoretical guarantees was an open question for a long period of time. In this paper, we make a significant step to close this gap. We improve upon the existing rate and propose t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.04987","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2302.04987/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":"2302.04987","created_at":"2026-07-05T06:14:40.658296+00:00"},{"alias_kind":"arxiv_version","alias_value":"2302.04987v2","created_at":"2026-07-05T06:14:40.658296+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.04987","created_at":"2026-07-05T06:14:40.658296+00:00"},{"alias_kind":"pith_short_12","alias_value":"6SPZ3MXHIMJ6","created_at":"2026-07-05T06:14:40.658296+00:00"},{"alias_kind":"pith_short_16","alias_value":"6SPZ3MXHIMJ6HQV2","created_at":"2026-07-05T06:14:40.658296+00:00"},{"alias_kind":"pith_short_8","alias_value":"6SPZ3MXH","created_at":"2026-07-05T06:14:40.658296+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":10,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6SPZ3MXHIMJ6HQV2HH4HHJPUKB","json":"https://pith.science/pith/6SPZ3MXHIMJ6HQV2HH4HHJPUKB.json","graph_json":"https://pith.science/api/pith-number/6SPZ3MXHIMJ6HQV2HH4HHJPUKB/graph.json","events_json":"https://pith.science/api/pith-number/6SPZ3MXHIMJ6HQV2HH4HHJPUKB/events.json","paper":"https://pith.science/paper/6SPZ3MXH"},"agent_actions":{"view_html":"https://pith.science/pith/6SPZ3MXHIMJ6HQV2HH4HHJPUKB","download_json":"https://pith.science/pith/6SPZ3MXHIMJ6HQV2HH4HHJPUKB.json","view_paper":"https://pith.science/paper/6SPZ3MXH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2302.04987&json=true","fetch_graph":"https://pith.science/api/pith-number/6SPZ3MXHIMJ6HQV2HH4HHJPUKB/graph.json","fetch_events":"https://pith.science/api/pith-number/6SPZ3MXHIMJ6HQV2HH4HHJPUKB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6SPZ3MXHIMJ6HQV2HH4HHJPUKB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6SPZ3MXHIMJ6HQV2HH4HHJPUKB/action/storage_attestation","attest_author":"https://pith.science/pith/6SPZ3MXHIMJ6HQV2HH4HHJPUKB/action/author_attestation","sign_citation":"https://pith.science/pith/6SPZ3MXHIMJ6HQV2HH4HHJPUKB/action/citation_signature","submit_replication":"https://pith.science/pith/6SPZ3MXHIMJ6HQV2HH4HHJPUKB/action/replication_record"}},"created_at":"2026-07-05T06:14:40.658296+00:00","updated_at":"2026-07-05T06:14:40.658296+00:00"}