{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:TTJMVD25BYZUT3T5CILTSNH6PB","short_pith_number":"pith:TTJMVD25","schema_version":"1.0","canonical_sha256":"9cd2ca8f5d0e3349ee7d12173934fe7874eee31e3b2f4be659156fa56c832200","source":{"kind":"arxiv","id":"2005.04639","version":3},"attestation_state":"computed","paper":{"title":"Adaptive Regularization for Nonconvex Optimization Using Inexact Function Values and Randomly Perturbed Derivatives","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"B. Morini, G. Gurioli, Ph. L. Toint, S. Bellavia","submitted_at":"2020-05-10T12:31:00Z","abstract_excerpt":"A regularization algorithm allowing random noise in derivatives and inexact function values is proposed for computing approximate local critical points of any order for smooth unconstrained optimization problems. For an objective function with Lipschitz continuous $p$-th derivative and given an arbitrary optimality order $q \\leq p$, it is shown that this algorithm will, in expectation, compute such a point in at most $O\\left(\\left(\\min_{j\\in\\{1,\\ldots,q\\}}\\epsilon_j\\right)^{-\\frac{p+1}{p-q+1}}\\right)$ inexact evaluations of $f$ and its derivatives whenever $q\\in\\{1,2\\}$, where $\\epsilon_j$ is "},"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":"2005.04639","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-05-10T12:31:00Z","cross_cats_sorted":[],"title_canon_sha256":"2369d55bfd774e1a968404ffb9cf011ab2d63604386efab0747c88fc85b0ee2b","abstract_canon_sha256":"b85da62a8d1097b315dd76b3f21a0133c9da47706691e83704f116dbd0c9c853"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:29:26.716999Z","signature_b64":"1NQ+nFG43+ufk6Wb/Ler5F6/dT0VCohkqbth1vOaRo/DmMo8NVJulFWP4aO/F+jBU4c2AG5br4qRBZQjlrI5AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9cd2ca8f5d0e3349ee7d12173934fe7874eee31e3b2f4be659156fa56c832200","last_reissued_at":"2026-07-05T02:29:26.716528Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:29:26.716528Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adaptive Regularization for Nonconvex Optimization Using Inexact Function Values and Randomly Perturbed Derivatives","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"B. Morini, G. Gurioli, Ph. L. Toint, S. Bellavia","submitted_at":"2020-05-10T12:31:00Z","abstract_excerpt":"A regularization algorithm allowing random noise in derivatives and inexact function values is proposed for computing approximate local critical points of any order for smooth unconstrained optimization problems. For an objective function with Lipschitz continuous $p$-th derivative and given an arbitrary optimality order $q \\leq p$, it is shown that this algorithm will, in expectation, compute such a point in at most $O\\left(\\left(\\min_{j\\in\\{1,\\ldots,q\\}}\\epsilon_j\\right)^{-\\frac{p+1}{p-q+1}}\\right)$ inexact evaluations of $f$ and its derivatives whenever $q\\in\\{1,2\\}$, where $\\epsilon_j$ is "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2005.04639","kind":"arxiv","version":3},"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/2005.04639/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":"2005.04639","created_at":"2026-07-05T02:29:26.716600+00:00"},{"alias_kind":"arxiv_version","alias_value":"2005.04639v3","created_at":"2026-07-05T02:29:26.716600+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.04639","created_at":"2026-07-05T02:29:26.716600+00:00"},{"alias_kind":"pith_short_12","alias_value":"TTJMVD25BYZU","created_at":"2026-07-05T02:29:26.716600+00:00"},{"alias_kind":"pith_short_16","alias_value":"TTJMVD25BYZUT3T5","created_at":"2026-07-05T02:29:26.716600+00:00"},{"alias_kind":"pith_short_8","alias_value":"TTJMVD25","created_at":"2026-07-05T02:29:26.716600+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.10378","citing_title":"Exploiting Negative Curvature in Conjunction with Adaptive Sampling: Theoretical Results and a Practical Algorithm","ref_index":2,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TTJMVD25BYZUT3T5CILTSNH6PB","json":"https://pith.science/pith/TTJMVD25BYZUT3T5CILTSNH6PB.json","graph_json":"https://pith.science/api/pith-number/TTJMVD25BYZUT3T5CILTSNH6PB/graph.json","events_json":"https://pith.science/api/pith-number/TTJMVD25BYZUT3T5CILTSNH6PB/events.json","paper":"https://pith.science/paper/TTJMVD25"},"agent_actions":{"view_html":"https://pith.science/pith/TTJMVD25BYZUT3T5CILTSNH6PB","download_json":"https://pith.science/pith/TTJMVD25BYZUT3T5CILTSNH6PB.json","view_paper":"https://pith.science/paper/TTJMVD25","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2005.04639&json=true","fetch_graph":"https://pith.science/api/pith-number/TTJMVD25BYZUT3T5CILTSNH6PB/graph.json","fetch_events":"https://pith.science/api/pith-number/TTJMVD25BYZUT3T5CILTSNH6PB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TTJMVD25BYZUT3T5CILTSNH6PB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TTJMVD25BYZUT3T5CILTSNH6PB/action/storage_attestation","attest_author":"https://pith.science/pith/TTJMVD25BYZUT3T5CILTSNH6PB/action/author_attestation","sign_citation":"https://pith.science/pith/TTJMVD25BYZUT3T5CILTSNH6PB/action/citation_signature","submit_replication":"https://pith.science/pith/TTJMVD25BYZUT3T5CILTSNH6PB/action/replication_record"}},"created_at":"2026-07-05T02:29:26.716600+00:00","updated_at":"2026-07-05T02:29:26.716600+00:00"}