{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:SPEIT5LQ5YXVLXGLAUUVEYQWMD","short_pith_number":"pith:SPEIT5LQ","schema_version":"1.0","canonical_sha256":"93c889f570ee2f55dccb052952621660ceb9a43404ae625d13429a855e720de5","source":{"kind":"arxiv","id":"2604.23436","version":2},"attestation_state":"computed","paper":{"title":"Inference of Online Newton Methods with Nesterov's Accelerated Sketching","license":"http://creativecommons.org/licenses/by/4.0/","headline":"An online Newton method with Nesterov-accelerated sketching provides global convergence and asymptotic normality for inference on streaming data at first-order complexity.","cross_cats":["cs.LG","math.OC","stat.CO"],"primary_cat":"stat.ML","authors_text":"Haoxuan Wang, Sen Na, Xinchen Du","submitted_at":"2026-04-25T20:43:17Z","abstract_excerpt":"Reliable decision-making with streaming data requires principled uncertainty quantification of online methods. While first-order methods enable efficient iterate updates, their inference procedures still require updating proper (covariance) matrices, incurring $O(d^2)$ time and memory complexity, and are sensitive to ill-conditioning and noise heterogeneity of the problem. This costly inference task offers an opportunity for more robust second-order methods, which are, however, bottlenecked by solving Newton systems with $O(d^3)$ complexity. In this paper, we address this gap by studying an on"},"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":"2604.23436","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2026-04-25T20:43:17Z","cross_cats_sorted":["cs.LG","math.OC","stat.CO"],"title_canon_sha256":"d5c1d5af7abd0b36a2e899bbd79b0737d5eaaa792d3d8872f06ef191477270ce","abstract_canon_sha256":"4696375392698ea4bb7e0fcffce67f185b60a5ed857959a5fc3bc57a71d4afe1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-01T01:02:40.652744Z","signature_b64":"Wv1BNTkUzV9BglcCaOJZKLno5PT3lEuMB58bktYVYrEa1luBOU6JsZOldJhos44GQqkUaLVhhCg62on/0Iy1Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"93c889f570ee2f55dccb052952621660ceb9a43404ae625d13429a855e720de5","last_reissued_at":"2026-06-01T01:02:40.651720Z","signature_status":"signed_v1","first_computed_at":"2026-06-01T01:02:40.651720Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Inference of Online Newton Methods with Nesterov's Accelerated Sketching","license":"http://creativecommons.org/licenses/by/4.0/","headline":"An online Newton method with Nesterov-accelerated sketching provides global convergence and asymptotic normality for inference on streaming data at first-order complexity.","cross_cats":["cs.LG","math.OC","stat.CO"],"primary_cat":"stat.ML","authors_text":"Haoxuan Wang, Sen Na, Xinchen Du","submitted_at":"2026-04-25T20:43:17Z","abstract_excerpt":"Reliable decision-making with streaming data requires principled uncertainty quantification of online methods. While first-order methods enable efficient iterate updates, their inference procedures still require updating proper (covariance) matrices, incurring $O(d^2)$ time and memory complexity, and are sensitive to ill-conditioning and noise heterogeneity of the problem. This costly inference task offers an opportunity for more robust second-order methods, which are, however, bottlenecked by solving Newton systems with $O(d^3)$ complexity. In this paper, we address this gap by studying an on"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"we establish global almost-sure convergence, prove asymptotic normality of the last iterate with a limiting covariance characterized by a Lyapunov equation, and develop a fully online covariance estimator with non-asymptotic convergence guarantees.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"Under standard smoothness and moment conditions","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"An accelerated sketched online Newton method with Hessian averaging achieves global almost-sure convergence, asymptotic normality via a Lyapunov covariance, and a fully online covariance estimator under standard conditions.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"An online Newton method with Nesterov-accelerated sketching provides global convergence and asymptotic normality for inference on streaming data at first-order complexity.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"c287889e72629a17fbf970f31da6f2e71b3f30268a40d16fa8711e052550c65f"},"source":{"id":"2604.23436","kind":"arxiv","version":2},"verdict":{"id":"c001442f-8280-44a2-a495-37e53224a965","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-08T07:11:48.723007Z","strongest_claim":"we establish global almost-sure convergence, prove asymptotic normality of the last iterate with a limiting covariance characterized by a Lyapunov equation, and develop a fully online covariance estimator with non-asymptotic convergence guarantees.","one_line_summary":"An accelerated sketched online Newton method with Hessian averaging achieves global almost-sure convergence, asymptotic normality via a Lyapunov covariance, and a fully online covariance estimator under standard conditions.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"Under standard smoothness and moment conditions","pith_extraction_headline":"An online Newton method with Nesterov-accelerated sketching provides global convergence and asymptotic normality for inference on streaming data at first-order complexity."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2604.23436/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"ai_meta_artifact","ran_at":"2026-05-21T08:40:58.818825Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T23:05:34.142085Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"7e93bc226ce9fa6c2a8c4a2d38bc21a81d40a4d70a132d299fd1b5a69520e820"},"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":"2604.23436","created_at":"2026-06-01T01:02:40.651829+00:00"},{"alias_kind":"arxiv_version","alias_value":"2604.23436v2","created_at":"2026-06-01T01:02:40.651829+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.23436","created_at":"2026-06-01T01:02:40.651829+00:00"},{"alias_kind":"pith_short_12","alias_value":"SPEIT5LQ5YXV","created_at":"2026-06-01T01:02:40.651829+00:00"},{"alias_kind":"pith_short_16","alias_value":"SPEIT5LQ5YXVLXGL","created_at":"2026-06-01T01:02:40.651829+00:00"},{"alias_kind":"pith_short_8","alias_value":"SPEIT5LQ","created_at":"2026-06-01T01:02:40.651829+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SPEIT5LQ5YXVLXGLAUUVEYQWMD","json":"https://pith.science/pith/SPEIT5LQ5YXVLXGLAUUVEYQWMD.json","graph_json":"https://pith.science/api/pith-number/SPEIT5LQ5YXVLXGLAUUVEYQWMD/graph.json","events_json":"https://pith.science/api/pith-number/SPEIT5LQ5YXVLXGLAUUVEYQWMD/events.json","paper":"https://pith.science/paper/SPEIT5LQ"},"agent_actions":{"view_html":"https://pith.science/pith/SPEIT5LQ5YXVLXGLAUUVEYQWMD","download_json":"https://pith.science/pith/SPEIT5LQ5YXVLXGLAUUVEYQWMD.json","view_paper":"https://pith.science/paper/SPEIT5LQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2604.23436&json=true","fetch_graph":"https://pith.science/api/pith-number/SPEIT5LQ5YXVLXGLAUUVEYQWMD/graph.json","fetch_events":"https://pith.science/api/pith-number/SPEIT5LQ5YXVLXGLAUUVEYQWMD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SPEIT5LQ5YXVLXGLAUUVEYQWMD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SPEIT5LQ5YXVLXGLAUUVEYQWMD/action/storage_attestation","attest_author":"https://pith.science/pith/SPEIT5LQ5YXVLXGLAUUVEYQWMD/action/author_attestation","sign_citation":"https://pith.science/pith/SPEIT5LQ5YXVLXGLAUUVEYQWMD/action/citation_signature","submit_replication":"https://pith.science/pith/SPEIT5LQ5YXVLXGLAUUVEYQWMD/action/replication_record"}},"created_at":"2026-06-01T01:02:40.651829+00:00","updated_at":"2026-06-01T01:02:40.651829+00:00"}