{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:KAQIRWIYD7MDQSYCBN4LCKH7ZU","short_pith_number":"pith:KAQIRWIY","schema_version":"1.0","canonical_sha256":"502088d9181fd8384b020b78b128ffcd1929bf628bd811dea11e1459dbc4f24c","source":{"kind":"arxiv","id":"1802.06925","version":1},"attestation_state":"computed","paper":{"title":"Inexact Non-Convex Newton-Type Methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Farbod Roosta-Khorasani, Michael W. Mahoney, Peng Xu, Zhewei Yao","submitted_at":"2018-02-20T00:53:34Z","abstract_excerpt":"For solving large-scale non-convex problems, we propose inexact variants of trust region and adaptive cubic regularization methods, which, to increase efficiency, incorporate various approximations. In particular, in addition to approximate sub-problem solves, both the Hessian and the gradient are suitably approximated. Using rather mild conditions on such approximations, we show that our proposed inexact methods achieve similar optimal worst-case iteration complexities as the exact counterparts. Our proposed algorithms, and their respective theoretical analysis, do not require knowledge of an"},"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":"1802.06925","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-02-20T00:53:34Z","cross_cats_sorted":[],"title_canon_sha256":"b5698ac469547df3346eacb7354863d9c424428f6d3524ffaf3d9107ac46b4f6","abstract_canon_sha256":"c2b17cadb24fb31268af9429d49c8ea6e63ca2f5b9feb276600c7fb6c066bf3d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:53.979065Z","signature_b64":"E3gKjpnylR0bh0h8eXUKjM/kIpUV8Q2ttwRFHjW2Mt47QkdDjnw/s2jHQP8osqdnQ13N1Ky1Lclu5psvb8a6Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"502088d9181fd8384b020b78b128ffcd1929bf628bd811dea11e1459dbc4f24c","last_reissued_at":"2026-05-18T00:22:53.978529Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:53.978529Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Inexact Non-Convex Newton-Type Methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Farbod Roosta-Khorasani, Michael W. Mahoney, Peng Xu, Zhewei Yao","submitted_at":"2018-02-20T00:53:34Z","abstract_excerpt":"For solving large-scale non-convex problems, we propose inexact variants of trust region and adaptive cubic regularization methods, which, to increase efficiency, incorporate various approximations. In particular, in addition to approximate sub-problem solves, both the Hessian and the gradient are suitably approximated. Using rather mild conditions on such approximations, we show that our proposed inexact methods achieve similar optimal worst-case iteration complexities as the exact counterparts. Our proposed algorithms, and their respective theoretical analysis, do not require knowledge of an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.06925","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":"1802.06925","created_at":"2026-05-18T00:22:53.978615+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.06925v1","created_at":"2026-05-18T00:22:53.978615+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.06925","created_at":"2026-05-18T00:22:53.978615+00:00"},{"alias_kind":"pith_short_12","alias_value":"KAQIRWIYD7MD","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_16","alias_value":"KAQIRWIYD7MDQSYC","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_8","alias_value":"KAQIRWIY","created_at":"2026-05-18T12:32:33.847187+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/KAQIRWIYD7MDQSYCBN4LCKH7ZU","json":"https://pith.science/pith/KAQIRWIYD7MDQSYCBN4LCKH7ZU.json","graph_json":"https://pith.science/api/pith-number/KAQIRWIYD7MDQSYCBN4LCKH7ZU/graph.json","events_json":"https://pith.science/api/pith-number/KAQIRWIYD7MDQSYCBN4LCKH7ZU/events.json","paper":"https://pith.science/paper/KAQIRWIY"},"agent_actions":{"view_html":"https://pith.science/pith/KAQIRWIYD7MDQSYCBN4LCKH7ZU","download_json":"https://pith.science/pith/KAQIRWIYD7MDQSYCBN4LCKH7ZU.json","view_paper":"https://pith.science/paper/KAQIRWIY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.06925&json=true","fetch_graph":"https://pith.science/api/pith-number/KAQIRWIYD7MDQSYCBN4LCKH7ZU/graph.json","fetch_events":"https://pith.science/api/pith-number/KAQIRWIYD7MDQSYCBN4LCKH7ZU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KAQIRWIYD7MDQSYCBN4LCKH7ZU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KAQIRWIYD7MDQSYCBN4LCKH7ZU/action/storage_attestation","attest_author":"https://pith.science/pith/KAQIRWIYD7MDQSYCBN4LCKH7ZU/action/author_attestation","sign_citation":"https://pith.science/pith/KAQIRWIYD7MDQSYCBN4LCKH7ZU/action/citation_signature","submit_replication":"https://pith.science/pith/KAQIRWIYD7MDQSYCBN4LCKH7ZU/action/replication_record"}},"created_at":"2026-05-18T00:22:53.978615+00:00","updated_at":"2026-05-18T00:22:53.978615+00:00"}