{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:LUYXU3EQ5KWQWQP7VWMZ53N3UX","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":"0587203a2565ba919ec98a7ea1c39e0d90e7382b13ce65d85724343bd74439c5","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-04T21:12:30Z","title_canon_sha256":"eadc54a8433b8bc2469ff5eed98b8fd8059c619d9d2a55ce5ab8bac49d352469"},"schema_version":"1.0","source":{"id":"1903.01540","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.01540","created_at":"2026-05-17T23:52:00Z"},{"alias_kind":"arxiv_version","alias_value":"1903.01540v1","created_at":"2026-05-17T23:52:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.01540","created_at":"2026-05-17T23:52:00Z"},{"alias_kind":"pith_short_12","alias_value":"LUYXU3EQ5KWQ","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"LUYXU3EQ5KWQWQP7","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"LUYXU3EQ","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:b0b449695d181f322c1d37b0afa1b1301c9deb5c11d5b95af84f31d454592256","target":"graph","created_at":"2026-05-17T23:52:00Z","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"},"paper":{"abstract_excerpt":"We target the problem of finding a local minimum in non-convex finite-sum minimization. Towards this goal, we first prove that the trust region method with inexact gradient and Hessian estimation can achieve a convergence rate of order $\\mathcal{O}(1/{k^{2/3}})$ as long as those differential estimations are sufficiently accurate. Combining such result with a novel Hessian estimator, we propose the sample-efficient stochastic trust region (STR) algorithm which finds an $(\\epsilon, \\sqrt{\\epsilon})$-approximate local minimum within $\\mathcal{O}({\\sqrt{n}}/{\\epsilon^{1.5}})$ stochastic Hessian or","authors_text":"Alejandro Ribeiro, Cong Fang, Pan Zhou, Zebang Shen","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-04T21:12:30Z","title":"A Stochastic Trust Region Method for Non-convex Minimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.01540","kind":"arxiv","version":1},"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:acfb5935d65954a4b879da43ba97d3edd86fc3f6874dd495bd03801154c8b839","target":"record","created_at":"2026-05-17T23:52:00Z","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":"0587203a2565ba919ec98a7ea1c39e0d90e7382b13ce65d85724343bd74439c5","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-04T21:12:30Z","title_canon_sha256":"eadc54a8433b8bc2469ff5eed98b8fd8059c619d9d2a55ce5ab8bac49d352469"},"schema_version":"1.0","source":{"id":"1903.01540","kind":"arxiv","version":1}},"canonical_sha256":"5d317a6c90eaad0b41ffad999eedbba5c3979a9265020960b014e142758623fd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5d317a6c90eaad0b41ffad999eedbba5c3979a9265020960b014e142758623fd","first_computed_at":"2026-05-17T23:52:00.365987Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:52:00.365987Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7h56UnXJjEnP3sL4p7MsFjGWZoFtFsdf/0f6q3eLIBdEH4F1ADogu3h69fN+LqGrW3zNMqZTilcOhmEQ8vsfCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:52:00.366474Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.01540","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:acfb5935d65954a4b879da43ba97d3edd86fc3f6874dd495bd03801154c8b839","sha256:b0b449695d181f322c1d37b0afa1b1301c9deb5c11d5b95af84f31d454592256"],"state_sha256":"c4c58c48011dac3d13e07617eb1e8e74df810cc036f512372db94e6570a501a2"}