{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:SDFVBILRSS7ACKHGVJCVBGII4Q","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"e46b64783e24fa4e71b3ecb7b4f206ef6445e6108a3577cbad2637bd168e1826","cross_cats_sorted":["cs.NA","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-08-19T05:36:00Z","title_canon_sha256":"55d50022c1f4f6058d6f222e03947d3708d1dae109bd5e88727d04f0b4833e9a"},"schema_version":"1.0","source":{"id":"2308.09912","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2308.09912","created_at":"2026-07-05T09:06:24Z"},{"alias_kind":"arxiv_version","alias_value":"2308.09912v2","created_at":"2026-07-05T09:06:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.09912","created_at":"2026-07-05T09:06:24Z"},{"alias_kind":"pith_short_12","alias_value":"SDFVBILRSS7A","created_at":"2026-07-05T09:06:24Z"},{"alias_kind":"pith_short_16","alias_value":"SDFVBILRSS7ACKHG","created_at":"2026-07-05T09:06:24Z"},{"alias_kind":"pith_short_8","alias_value":"SDFVBILR","created_at":"2026-07-05T09:06:24Z"}],"graph_snapshots":[{"event_id":"sha256:ee4b67cca7970232b4b12bd606ae80a71d2271cfdfdb8dcd852da5a4af8eea7b","target":"graph","created_at":"2026-07-05T09:06:24Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2308.09912/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider an extension of the Newton-MR algorithm for nonconvex unconstrained optimization to the settings where Hessian information is approximated. Under a particular noise model on the Hessian matrix, we investigate the iteration and operation complexities of this variant to achieve appropriate sub-optimality criteria in several nonconvex settings. We do this by first considering functions that satisfy the (generalized) Polyak-\\L ojasiewicz condition, a special sub-class of nonconvex functions. We show that, under certain conditions, our algorithm achieves global linear convergence rate. ","authors_text":"Alexander Lim, Fred Roosta","cross_cats":["cs.NA","math.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-08-19T05:36:00Z","title":"Complexity Guarantees for Nonconvex Newton-MR Under Inexact Hessian Information"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.09912","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:02c82e5ea52a51f38ddaa10bdd1b6d92b6aa60779c041ecffe752ed7f8e29d3f","target":"record","created_at":"2026-07-05T09:06:24Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"e46b64783e24fa4e71b3ecb7b4f206ef6445e6108a3577cbad2637bd168e1826","cross_cats_sorted":["cs.NA","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-08-19T05:36:00Z","title_canon_sha256":"55d50022c1f4f6058d6f222e03947d3708d1dae109bd5e88727d04f0b4833e9a"},"schema_version":"1.0","source":{"id":"2308.09912","kind":"arxiv","version":2}},"canonical_sha256":"90cb50a17194be0128e6aa45509908e4015fdcf21920e3b3abd8239b2ba4ff5b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"90cb50a17194be0128e6aa45509908e4015fdcf21920e3b3abd8239b2ba4ff5b","first_computed_at":"2026-07-05T09:06:24.073520Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:06:24.073520Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1f6OiQVu7pbk0pZONIsHNvAu9DgGbUh6vbA//r/o/Vrkbgs2/jAG7vHQ6QCnlzt6Fq5IN3Vt4N1LkmG3uylfDw==","signature_status":"signed_v1","signed_at":"2026-07-05T09:06:24.073943Z","signed_message":"canonical_sha256_bytes"},"source_id":"2308.09912","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:02c82e5ea52a51f38ddaa10bdd1b6d92b6aa60779c041ecffe752ed7f8e29d3f","sha256:ee4b67cca7970232b4b12bd606ae80a71d2271cfdfdb8dcd852da5a4af8eea7b"],"state_sha256":"fd5c67e74f521a415dd6d10dc28b408ff9fd01be56ef146b8b65fa5213f068c3"}