{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:ZWIN3VYWU6TWTG7KAXPGNMGIOM","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"e86ec5496d22e10d728d82cec4b36f05d7b7ebb44f05a4045036821db9775ea1","cross_cats_sorted":["cs.NA","math.NA","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-05-09T13:07:03Z","title_canon_sha256":"1b2ccf3739e61695ce4a7dbca48784116a1fb58ab2104e355e1b1a134cff82de"},"schema_version":"1.0","source":{"id":"2305.05675","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2305.05675","created_at":"2026-07-05T09:09:51Z"},{"alias_kind":"arxiv_version","alias_value":"2305.05675v1","created_at":"2026-07-05T09:09:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.05675","created_at":"2026-07-05T09:09:51Z"},{"alias_kind":"pith_short_12","alias_value":"ZWIN3VYWU6TW","created_at":"2026-07-05T09:09:51Z"},{"alias_kind":"pith_short_16","alias_value":"ZWIN3VYWU6TWTG7K","created_at":"2026-07-05T09:09:51Z"},{"alias_kind":"pith_short_8","alias_value":"ZWIN3VYW","created_at":"2026-07-05T09:09:51Z"}],"graph_snapshots":[{"event_id":"sha256:6789961556c4192651510cc4ce9d92ea040552cb1f1eed48535bab51de571bbb","target":"graph","created_at":"2026-07-05T09:09:51Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2305.05675/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Adam-type algorithms have become a preferred choice for optimisation in the deep learning setting, however, despite success, their convergence is still not well understood. To this end, we introduce a unified framework for Adam-type algorithms (called UAdam). This is equipped with a general form of the second-order moment, which makes it possible to include Adam and its variants as special cases, such as NAdam, AMSGrad, AdaBound, AdaFom, and Adan. This is supported by a rigorous convergence analysis of UAdam in the non-convex stochastic setting, showing that UAdam converges to the neighborhood","authors_text":"Danilo P. Mandic, Dongpo Xu, Jinlan Liu, Yiming Jiang","cross_cats":["cs.NA","math.NA","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-05-09T13:07:03Z","title":"UAdam: Unified Adam-Type Algorithmic Framework for Non-Convex Stochastic Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.05675","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:ab503c7171923026f2323c575cfe5c9d4014cc0691f06e04ce6cc4b5c7e02e4d","target":"record","created_at":"2026-07-05T09:09:51Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"e86ec5496d22e10d728d82cec4b36f05d7b7ebb44f05a4045036821db9775ea1","cross_cats_sorted":["cs.NA","math.NA","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-05-09T13:07:03Z","title_canon_sha256":"1b2ccf3739e61695ce4a7dbca48784116a1fb58ab2104e355e1b1a134cff82de"},"schema_version":"1.0","source":{"id":"2305.05675","kind":"arxiv","version":1}},"canonical_sha256":"cd90ddd716a7a7699bea05de66b0c873190b2a8c708f52033757aae50ccb061e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cd90ddd716a7a7699bea05de66b0c873190b2a8c708f52033757aae50ccb061e","first_computed_at":"2026-07-05T09:09:51.676849Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:09:51.676849Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"A6z3LpoYYa7TW4Xp3Xcyy00iiuAWibL1U8o5lwmR0Bev+TeQL6EVCsJwjwfMyFWO/9Ox5hIXsVjukYLQN6h2Dg==","signature_status":"signed_v1","signed_at":"2026-07-05T09:09:51.677330Z","signed_message":"canonical_sha256_bytes"},"source_id":"2305.05675","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ab503c7171923026f2323c575cfe5c9d4014cc0691f06e04ce6cc4b5c7e02e4d","sha256:6789961556c4192651510cc4ce9d92ea040552cb1f1eed48535bab51de571bbb"],"state_sha256":"cf77f50535a3bb950b5d298ac5da54fc8d98b4c859d34c6e6a608a00d9157a01"}