{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:LUYXU3EQ5KWQWQP7VWMZ53N3UX","short_pith_number":"pith:LUYXU3EQ","schema_version":"1.0","canonical_sha256":"5d317a6c90eaad0b41ffad999eedbba5c3979a9265020960b014e142758623fd","source":{"kind":"arxiv","id":"1903.01540","version":1},"attestation_state":"computed","paper":{"title":"A Stochastic Trust Region Method for Non-convex Minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"math.OC","authors_text":"Alejandro Ribeiro, Cong Fang, Pan Zhou, Zebang Shen","submitted_at":"2019-03-04T21:12:30Z","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"},"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":"1903.01540","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-04T21:12:30Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"eadc54a8433b8bc2469ff5eed98b8fd8059c619d9d2a55ce5ab8bac49d352469","abstract_canon_sha256":"0587203a2565ba919ec98a7ea1c39e0d90e7382b13ce65d85724343bd74439c5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:00.366474Z","signature_b64":"7h56UnXJjEnP3sL4p7MsFjGWZoFtFsdf/0f6q3eLIBdEH4F1ADogu3h69fN+LqGrW3zNMqZTilcOhmEQ8vsfCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5d317a6c90eaad0b41ffad999eedbba5c3979a9265020960b014e142758623fd","last_reissued_at":"2026-05-17T23:52:00.365987Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:00.365987Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Stochastic Trust Region Method for Non-convex Minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"math.OC","authors_text":"Alejandro Ribeiro, Cong Fang, Pan Zhou, Zebang Shen","submitted_at":"2019-03-04T21:12:30Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.01540","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":""},"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":"1903.01540","created_at":"2026-05-17T23:52:00.366053+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.01540v1","created_at":"2026-05-17T23:52:00.366053+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.01540","created_at":"2026-05-17T23:52:00.366053+00:00"},{"alias_kind":"pith_short_12","alias_value":"LUYXU3EQ5KWQ","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_16","alias_value":"LUYXU3EQ5KWQWQP7","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_8","alias_value":"LUYXU3EQ","created_at":"2026-05-18T12:33:21.387695+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/LUYXU3EQ5KWQWQP7VWMZ53N3UX","json":"https://pith.science/pith/LUYXU3EQ5KWQWQP7VWMZ53N3UX.json","graph_json":"https://pith.science/api/pith-number/LUYXU3EQ5KWQWQP7VWMZ53N3UX/graph.json","events_json":"https://pith.science/api/pith-number/LUYXU3EQ5KWQWQP7VWMZ53N3UX/events.json","paper":"https://pith.science/paper/LUYXU3EQ"},"agent_actions":{"view_html":"https://pith.science/pith/LUYXU3EQ5KWQWQP7VWMZ53N3UX","download_json":"https://pith.science/pith/LUYXU3EQ5KWQWQP7VWMZ53N3UX.json","view_paper":"https://pith.science/paper/LUYXU3EQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.01540&json=true","fetch_graph":"https://pith.science/api/pith-number/LUYXU3EQ5KWQWQP7VWMZ53N3UX/graph.json","fetch_events":"https://pith.science/api/pith-number/LUYXU3EQ5KWQWQP7VWMZ53N3UX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LUYXU3EQ5KWQWQP7VWMZ53N3UX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LUYXU3EQ5KWQWQP7VWMZ53N3UX/action/storage_attestation","attest_author":"https://pith.science/pith/LUYXU3EQ5KWQWQP7VWMZ53N3UX/action/author_attestation","sign_citation":"https://pith.science/pith/LUYXU3EQ5KWQWQP7VWMZ53N3UX/action/citation_signature","submit_replication":"https://pith.science/pith/LUYXU3EQ5KWQWQP7VWMZ53N3UX/action/replication_record"}},"created_at":"2026-05-17T23:52:00.366053+00:00","updated_at":"2026-05-17T23:52:00.366053+00:00"}