{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:WNQEBVOC2ZPH6SPSTWSNQCXGKA","short_pith_number":"pith:WNQEBVOC","schema_version":"1.0","canonical_sha256":"b36040d5c2d65e7f49f29da4d80ae65039a441a29470035bd713171505f9f697","source":{"kind":"arxiv","id":"2211.01832","version":2},"attestation_state":"computed","paper":{"title":"Extra-Newton: A First Approach to Noise-Adaptive Accelerated Second-Order Methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Ali Kavis, Kimon Antonakopoulos, Volkan Cevher","submitted_at":"2022-11-03T14:12:51Z","abstract_excerpt":"This work proposes a universal and adaptive second-order method for minimizing second-order smooth, convex functions. Our algorithm achieves $O(\\sigma / \\sqrt{T})$ convergence when the oracle feedback is stochastic with variance $\\sigma^2$, and improves its convergence to $O( 1 / T^3)$ with deterministic oracles, where $T$ is the number of iterations. Our method also interpolates these rates without knowing the nature of the oracle apriori, which is enabled by a parameter-free adaptive step-size that is oblivious to the knowledge of smoothness modulus, variance bounds and the diameter of the c"},"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":"2211.01832","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-11-03T14:12:51Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"7cf91381a7dbf7d7cdd56407ab8633433600002a2d3ba782c204546476d8aa12","abstract_canon_sha256":"a6f3ce402626f06bfb31db0d4a3cf49fecb65ac73b73911717dc3b078fe26a8b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:24:14.964929Z","signature_b64":"hdAWwRmiFVTh/aT252+uuOvj5LJ2rSexsUfDYAEUsMtvuTXDI+LKDWv2jczJbE+9pfyOu14dxJHNLKxq7yhDDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b36040d5c2d65e7f49f29da4d80ae65039a441a29470035bd713171505f9f697","last_reissued_at":"2026-07-05T05:24:14.964582Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:24:14.964582Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Extra-Newton: A First Approach to Noise-Adaptive Accelerated Second-Order Methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Ali Kavis, Kimon Antonakopoulos, Volkan Cevher","submitted_at":"2022-11-03T14:12:51Z","abstract_excerpt":"This work proposes a universal and adaptive second-order method for minimizing second-order smooth, convex functions. Our algorithm achieves $O(\\sigma / \\sqrt{T})$ convergence when the oracle feedback is stochastic with variance $\\sigma^2$, and improves its convergence to $O( 1 / T^3)$ with deterministic oracles, where $T$ is the number of iterations. Our method also interpolates these rates without knowing the nature of the oracle apriori, which is enabled by a parameter-free adaptive step-size that is oblivious to the knowledge of smoothness modulus, variance bounds and the diameter of the c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.01832","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/2211.01832/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":"2211.01832","created_at":"2026-07-05T05:24:14.964640+00:00"},{"alias_kind":"arxiv_version","alias_value":"2211.01832v2","created_at":"2026-07-05T05:24:14.964640+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.01832","created_at":"2026-07-05T05:24:14.964640+00:00"},{"alias_kind":"pith_short_12","alias_value":"WNQEBVOC2ZPH","created_at":"2026-07-05T05:24:14.964640+00:00"},{"alias_kind":"pith_short_16","alias_value":"WNQEBVOC2ZPH6SPS","created_at":"2026-07-05T05:24:14.964640+00:00"},{"alias_kind":"pith_short_8","alias_value":"WNQEBVOC","created_at":"2026-07-05T05:24:14.964640+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":2023,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WNQEBVOC2ZPH6SPSTWSNQCXGKA","json":"https://pith.science/pith/WNQEBVOC2ZPH6SPSTWSNQCXGKA.json","graph_json":"https://pith.science/api/pith-number/WNQEBVOC2ZPH6SPSTWSNQCXGKA/graph.json","events_json":"https://pith.science/api/pith-number/WNQEBVOC2ZPH6SPSTWSNQCXGKA/events.json","paper":"https://pith.science/paper/WNQEBVOC"},"agent_actions":{"view_html":"https://pith.science/pith/WNQEBVOC2ZPH6SPSTWSNQCXGKA","download_json":"https://pith.science/pith/WNQEBVOC2ZPH6SPSTWSNQCXGKA.json","view_paper":"https://pith.science/paper/WNQEBVOC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2211.01832&json=true","fetch_graph":"https://pith.science/api/pith-number/WNQEBVOC2ZPH6SPSTWSNQCXGKA/graph.json","fetch_events":"https://pith.science/api/pith-number/WNQEBVOC2ZPH6SPSTWSNQCXGKA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WNQEBVOC2ZPH6SPSTWSNQCXGKA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WNQEBVOC2ZPH6SPSTWSNQCXGKA/action/storage_attestation","attest_author":"https://pith.science/pith/WNQEBVOC2ZPH6SPSTWSNQCXGKA/action/author_attestation","sign_citation":"https://pith.science/pith/WNQEBVOC2ZPH6SPSTWSNQCXGKA/action/citation_signature","submit_replication":"https://pith.science/pith/WNQEBVOC2ZPH6SPSTWSNQCXGKA/action/replication_record"}},"created_at":"2026-07-05T05:24:14.964640+00:00","updated_at":"2026-07-05T05:24:14.964640+00:00"}