{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:TWO2ILHP4UHA2KG2GQ74PDGCAZ","short_pith_number":"pith:TWO2ILHP","schema_version":"1.0","canonical_sha256":"9d9da42cefe50e0d28da343fc78cc206540c058fd1f2b224774d0c810c36669c","source":{"kind":"arxiv","id":"2409.16047","version":1},"attestation_state":"computed","paper":{"title":"Examples of slow convergence for adaptive regularization optimization methods are not isolated","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"math.OC","authors_text":"Philippe L. Toint","submitted_at":"2024-09-24T12:51:13Z","abstract_excerpt":"The adaptive regularization algorithm for unconstrained nonconvex optimization was shown in Nesterov and Polyak (2006) and Cartis, Gould and Toint (2011) to require, under standard assumptions, at most $\\mathcal{O}(\\epsilon^{3/(3-q)})$ evaluations of the objective function and its derivatives of degrees one and two to produce an $\\epsilon$-approximate critical point of order $q\\in\\{1,2\\}$. This bound was shown to be sharp for $q \\in\\{1,2\\}$. This note revisits these results and shows that the example for which slow convergence is exhibited is not isolated, but that this behaviour occurs for a "},"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":"2409.16047","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-09-24T12:51:13Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"4936dc32643e1922b05a3ef8a71a10423235434b2c6a2d4429b201e9879901ed","abstract_canon_sha256":"db126a66f2606ae0267d0d4874911ab837d103afd4b94f58702a63909a1f929f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:11:04.164877Z","signature_b64":"yQEhV0ICjk9cGTqdZKProX3z9Z7bn1HibCNOkI1mF/I1zZ/u5rer38EqnbaLJwt5QldYEM4LxlyIxNpRsw+CDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9d9da42cefe50e0d28da343fc78cc206540c058fd1f2b224774d0c810c36669c","last_reissued_at":"2026-07-05T09:11:04.164380Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:11:04.164380Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Examples of slow convergence for adaptive regularization optimization methods are not isolated","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"math.OC","authors_text":"Philippe L. Toint","submitted_at":"2024-09-24T12:51:13Z","abstract_excerpt":"The adaptive regularization algorithm for unconstrained nonconvex optimization was shown in Nesterov and Polyak (2006) and Cartis, Gould and Toint (2011) to require, under standard assumptions, at most $\\mathcal{O}(\\epsilon^{3/(3-q)})$ evaluations of the objective function and its derivatives of degrees one and two to produce an $\\epsilon$-approximate critical point of order $q\\in\\{1,2\\}$. This bound was shown to be sharp for $q \\in\\{1,2\\}$. This note revisits these results and shows that the example for which slow convergence is exhibited is not isolated, but that this behaviour occurs for a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.16047","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2409.16047/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":"2409.16047","created_at":"2026-07-05T09:11:04.164444+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.16047v1","created_at":"2026-07-05T09:11:04.164444+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.16047","created_at":"2026-07-05T09:11:04.164444+00:00"},{"alias_kind":"pith_short_12","alias_value":"TWO2ILHP4UHA","created_at":"2026-07-05T09:11:04.164444+00:00"},{"alias_kind":"pith_short_16","alias_value":"TWO2ILHP4UHA2KG2","created_at":"2026-07-05T09:11:04.164444+00:00"},{"alias_kind":"pith_short_8","alias_value":"TWO2ILHP","created_at":"2026-07-05T09:11:04.164444+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.22764","citing_title":"Performance Estimation of second-order optimization methods on classes of univariate functions","ref_index":51,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TWO2ILHP4UHA2KG2GQ74PDGCAZ","json":"https://pith.science/pith/TWO2ILHP4UHA2KG2GQ74PDGCAZ.json","graph_json":"https://pith.science/api/pith-number/TWO2ILHP4UHA2KG2GQ74PDGCAZ/graph.json","events_json":"https://pith.science/api/pith-number/TWO2ILHP4UHA2KG2GQ74PDGCAZ/events.json","paper":"https://pith.science/paper/TWO2ILHP"},"agent_actions":{"view_html":"https://pith.science/pith/TWO2ILHP4UHA2KG2GQ74PDGCAZ","download_json":"https://pith.science/pith/TWO2ILHP4UHA2KG2GQ74PDGCAZ.json","view_paper":"https://pith.science/paper/TWO2ILHP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.16047&json=true","fetch_graph":"https://pith.science/api/pith-number/TWO2ILHP4UHA2KG2GQ74PDGCAZ/graph.json","fetch_events":"https://pith.science/api/pith-number/TWO2ILHP4UHA2KG2GQ74PDGCAZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TWO2ILHP4UHA2KG2GQ74PDGCAZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TWO2ILHP4UHA2KG2GQ74PDGCAZ/action/storage_attestation","attest_author":"https://pith.science/pith/TWO2ILHP4UHA2KG2GQ74PDGCAZ/action/author_attestation","sign_citation":"https://pith.science/pith/TWO2ILHP4UHA2KG2GQ74PDGCAZ/action/citation_signature","submit_replication":"https://pith.science/pith/TWO2ILHP4UHA2KG2GQ74PDGCAZ/action/replication_record"}},"created_at":"2026-07-05T09:11:04.164444+00:00","updated_at":"2026-07-05T09:11:04.164444+00:00"}