{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:3UPPGLSCSTEXK6XENDXNUKMZIS","short_pith_number":"pith:3UPPGLSC","schema_version":"1.0","canonical_sha256":"dd1ef32e4294c9757ae468eeda299944a181863de4c7f4b7aa20e371354ad5c6","source":{"kind":"arxiv","id":"2410.02626","version":1},"attestation_state":"computed","paper":{"title":"Online Learning Guided Quasi-Newton Methods with Global Non-Asymptotic Convergence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Aryan Mokhtari, Ruichen Jiang","submitted_at":"2024-10-03T16:08:16Z","abstract_excerpt":"In this paper, we propose a quasi-Newton method for solving smooth and monotone nonlinear equations, including unconstrained minimization and minimax optimization as special cases. For the strongly monotone setting, we establish two global convergence bounds: (i) a linear convergence rate that matches the rate of the celebrated extragradient method, and (ii) an explicit global superlinear convergence rate that provably surpasses the linear convergence rate after at most ${O}(d)$ iterations, where $d$ is the problem's dimension. In addition, for the case where the operator is only monotone, we "},"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":"2410.02626","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-10-03T16:08:16Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"249387ff3b27f4d78f54b4bf3026c6e57287f888a85663e6a11eca39c858d3d9","abstract_canon_sha256":"552620dc048a131c5cccf0b683671241081251d9219c041430d566f6f3e3e130"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:15:23.614859Z","signature_b64":"n9F1A7bEprJ0aafNjsJrazcqHRqNhK5xRYmtKfZ62DBaP2FgT/ME9oyvnmgEuROpxjE5BWgMxyNqV64TjXhoDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dd1ef32e4294c9757ae468eeda299944a181863de4c7f4b7aa20e371354ad5c6","last_reissued_at":"2026-07-05T09:15:23.614443Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:15:23.614443Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Online Learning Guided Quasi-Newton Methods with Global Non-Asymptotic Convergence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Aryan Mokhtari, Ruichen Jiang","submitted_at":"2024-10-03T16:08:16Z","abstract_excerpt":"In this paper, we propose a quasi-Newton method for solving smooth and monotone nonlinear equations, including unconstrained minimization and minimax optimization as special cases. For the strongly monotone setting, we establish two global convergence bounds: (i) a linear convergence rate that matches the rate of the celebrated extragradient method, and (ii) an explicit global superlinear convergence rate that provably surpasses the linear convergence rate after at most ${O}(d)$ iterations, where $d$ is the problem's dimension. In addition, for the case where the operator is only monotone, we "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.02626","kind":"arxiv","version":1},"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/2410.02626/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":"2410.02626","created_at":"2026-07-05T09:15:23.614506+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.02626v1","created_at":"2026-07-05T09:15:23.614506+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.02626","created_at":"2026-07-05T09:15:23.614506+00:00"},{"alias_kind":"pith_short_12","alias_value":"3UPPGLSCSTEX","created_at":"2026-07-05T09:15:23.614506+00:00"},{"alias_kind":"pith_short_16","alias_value":"3UPPGLSCSTEXK6XE","created_at":"2026-07-05T09:15:23.614506+00:00"},{"alias_kind":"pith_short_8","alias_value":"3UPPGLSC","created_at":"2026-07-05T09:15:23.614506+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.23081","citing_title":"Gradient Methods with Online Scaling Part I. Theoretical Foundations","ref_index":27,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3UPPGLSCSTEXK6XENDXNUKMZIS","json":"https://pith.science/pith/3UPPGLSCSTEXK6XENDXNUKMZIS.json","graph_json":"https://pith.science/api/pith-number/3UPPGLSCSTEXK6XENDXNUKMZIS/graph.json","events_json":"https://pith.science/api/pith-number/3UPPGLSCSTEXK6XENDXNUKMZIS/events.json","paper":"https://pith.science/paper/3UPPGLSC"},"agent_actions":{"view_html":"https://pith.science/pith/3UPPGLSCSTEXK6XENDXNUKMZIS","download_json":"https://pith.science/pith/3UPPGLSCSTEXK6XENDXNUKMZIS.json","view_paper":"https://pith.science/paper/3UPPGLSC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.02626&json=true","fetch_graph":"https://pith.science/api/pith-number/3UPPGLSCSTEXK6XENDXNUKMZIS/graph.json","fetch_events":"https://pith.science/api/pith-number/3UPPGLSCSTEXK6XENDXNUKMZIS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3UPPGLSCSTEXK6XENDXNUKMZIS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3UPPGLSCSTEXK6XENDXNUKMZIS/action/storage_attestation","attest_author":"https://pith.science/pith/3UPPGLSCSTEXK6XENDXNUKMZIS/action/author_attestation","sign_citation":"https://pith.science/pith/3UPPGLSCSTEXK6XENDXNUKMZIS/action/citation_signature","submit_replication":"https://pith.science/pith/3UPPGLSCSTEXK6XENDXNUKMZIS/action/replication_record"}},"created_at":"2026-07-05T09:15:23.614506+00:00","updated_at":"2026-07-05T09:15:23.614506+00:00"}