{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:Y6A6PQURQBODY65SZXLTFT7U4A","short_pith_number":"pith:Y6A6PQUR","schema_version":"1.0","canonical_sha256":"c781e7c291805c3c7bb2cdd732cff4e005cdc23aa354e548fe5ccc88d5cca075","source":{"kind":"arxiv","id":"2505.06374","version":2},"attestation_state":"computed","paper":{"title":"Fast Stochastic Second-Order Adagrad for Nonconvex Bound-Constrained Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"B. Morini, Ph. L. Toint, S. Bellavia, S. Gratton","submitted_at":"2025-05-09T18:38:46Z","abstract_excerpt":"ADAGB2, a generalization of the Adagrad algorithm for stochastic optimization is introduced, which is also applicable to bound-constrained problems and capable of using second-order information when available. It is shown that, given $\\delta\\in(0,1)$ and $\\epsilon\\in(0,1]$, the ADAGB2 algorithm needs at most $\\calO(\\epsilon^{-2})$ iterations to ensure an $\\epsilon$-approximate first-order critical point of the bound-constrained problem with probability at least $1-\\delta$, provided the average root mean square error of the gradient oracle is sufficiently small. Should this condition fail, it i"},"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":"2505.06374","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-05-09T18:38:46Z","cross_cats_sorted":[],"title_canon_sha256":"ac59bf9eddbbe99fc7c0329ef79ebbd3eee3add31aef8e9a3c44575f1f587b4a","abstract_canon_sha256":"7709918088c9aa15884cb67462d917d919bf50b94ec6b594a6775c45353c3fcf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-12T01:09:08.865912Z","signature_b64":"6JicI6JLoY/FajjGy6V8tV6f2rQyi5rijwcoODYTI0fKy8xmehZe7sHztzXnSimHfCqz02A8F5/8EWeaUWu7CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c781e7c291805c3c7bb2cdd732cff4e005cdc23aa354e548fe5ccc88d5cca075","last_reissued_at":"2026-06-12T01:09:08.864921Z","signature_status":"signed_v1","first_computed_at":"2026-06-12T01:09:08.864921Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Stochastic Second-Order Adagrad for Nonconvex Bound-Constrained Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"B. Morini, Ph. L. Toint, S. Bellavia, S. Gratton","submitted_at":"2025-05-09T18:38:46Z","abstract_excerpt":"ADAGB2, a generalization of the Adagrad algorithm for stochastic optimization is introduced, which is also applicable to bound-constrained problems and capable of using second-order information when available. It is shown that, given $\\delta\\in(0,1)$ and $\\epsilon\\in(0,1]$, the ADAGB2 algorithm needs at most $\\calO(\\epsilon^{-2})$ iterations to ensure an $\\epsilon$-approximate first-order critical point of the bound-constrained problem with probability at least $1-\\delta$, provided the average root mean square error of the gradient oracle is sufficiently small. Should this condition fail, it i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.06374","kind":"arxiv","version":2},"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/2505.06374/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":"2505.06374","created_at":"2026-06-12T01:09:08.865039+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.06374v2","created_at":"2026-06-12T01:09:08.865039+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.06374","created_at":"2026-06-12T01:09:08.865039+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y6A6PQURQBOD","created_at":"2026-06-12T01:09:08.865039+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y6A6PQURQBODY65S","created_at":"2026-06-12T01:09:08.865039+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y6A6PQUR","created_at":"2026-06-12T01:09:08.865039+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/Y6A6PQURQBODY65SZXLTFT7U4A","json":"https://pith.science/pith/Y6A6PQURQBODY65SZXLTFT7U4A.json","graph_json":"https://pith.science/api/pith-number/Y6A6PQURQBODY65SZXLTFT7U4A/graph.json","events_json":"https://pith.science/api/pith-number/Y6A6PQURQBODY65SZXLTFT7U4A/events.json","paper":"https://pith.science/paper/Y6A6PQUR"},"agent_actions":{"view_html":"https://pith.science/pith/Y6A6PQURQBODY65SZXLTFT7U4A","download_json":"https://pith.science/pith/Y6A6PQURQBODY65SZXLTFT7U4A.json","view_paper":"https://pith.science/paper/Y6A6PQUR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.06374&json=true","fetch_graph":"https://pith.science/api/pith-number/Y6A6PQURQBODY65SZXLTFT7U4A/graph.json","fetch_events":"https://pith.science/api/pith-number/Y6A6PQURQBODY65SZXLTFT7U4A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y6A6PQURQBODY65SZXLTFT7U4A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y6A6PQURQBODY65SZXLTFT7U4A/action/storage_attestation","attest_author":"https://pith.science/pith/Y6A6PQURQBODY65SZXLTFT7U4A/action/author_attestation","sign_citation":"https://pith.science/pith/Y6A6PQURQBODY65SZXLTFT7U4A/action/citation_signature","submit_replication":"https://pith.science/pith/Y6A6PQURQBODY65SZXLTFT7U4A/action/replication_record"}},"created_at":"2026-06-12T01:09:08.865039+00:00","updated_at":"2026-06-12T01:09:08.865039+00:00"}