{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:DAMCKEJMR26LDZEWAKHSVQAOOH","short_pith_number":"pith:DAMCKEJM","canonical_record":{"source":{"id":"1905.02957","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-08T08:38:30Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"c954a6e61e98e35e38867920a46720bdf9abded31174b6f345502f6407869594","abstract_canon_sha256":"fbee04aa23d4ffa93ad65652a74fd827595d4e035290d10aa486059622e2259b"},"schema_version":"1.0"},"canonical_sha256":"181825112c8ebcb1e496028f2ac00e71c03e961db83d23238e6fd1c7ac2b7ef8","source":{"kind":"arxiv","id":"1905.02957","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.02957","created_at":"2026-05-17T23:46:43Z"},{"alias_kind":"arxiv_version","alias_value":"1905.02957v1","created_at":"2026-05-17T23:46:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.02957","created_at":"2026-05-17T23:46:43Z"},{"alias_kind":"pith_short_12","alias_value":"DAMCKEJMR26L","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"DAMCKEJMR26LDZEW","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"DAMCKEJM","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:DAMCKEJMR26LDZEWAKHSVQAOOH","target":"record","payload":{"canonical_record":{"source":{"id":"1905.02957","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-08T08:38:30Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"c954a6e61e98e35e38867920a46720bdf9abded31174b6f345502f6407869594","abstract_canon_sha256":"fbee04aa23d4ffa93ad65652a74fd827595d4e035290d10aa486059622e2259b"},"schema_version":"1.0"},"canonical_sha256":"181825112c8ebcb1e496028f2ac00e71c03e961db83d23238e6fd1c7ac2b7ef8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:43.287076Z","signature_b64":"9kmrw4+E+khKIqOHxGGINlVsco8YAYsDzd2mr+iDlU8r6ga9r2BTwcGj2aFDsQJZPKzX7TqxRn2ckKckl7rkDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"181825112c8ebcb1e496028f2ac00e71c03e961db83d23238e6fd1c7ac2b7ef8","last_reissued_at":"2026-05-17T23:46:43.286580Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:43.286580Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.02957","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:46:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iv4emmdpIFn+lHHv95VwHu50KgOUf/t96XpT2Mi7I3WsRBFMUbSqLACj0axjDk9zyP2JX+QGVDafcHeJ1Vx/Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T15:16:19.032197Z"},"content_sha256":"e9444f4548e901d1925f093dd8d9c2e2f0ce69cd0dfa04b02633acc43ca0fa8f","schema_version":"1.0","event_id":"sha256:e9444f4548e901d1925f093dd8d9c2e2f0ce69cd0dfa04b02633acc43ca0fa8f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:DAMCKEJMR26LDZEWAKHSVQAOOH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"SAdam: A Variant of Adam for Strongly Convex Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Guanghui Wang, Lijun Zhang, Shiyin Lu, Weiwei Tu","submitted_at":"2019-05-08T08:38:30Z","abstract_excerpt":"The Adam algorithm has become extremely popular for large-scale machine learning. Under convexity condition, it has been proved to enjoy a data-dependant $O(\\sqrt{T})$ regret bound where $T$ is the time horizon. However, whether strong convexity can be utilized to further improve the performance remains an open problem. In this paper, we give an affirmative answer by developing a variant of Adam (referred to as SAdam) which achieves a data-dependant $O(\\log T)$ regret bound for strongly convex functions. The essential idea is to maintain a faster decaying yet under controlled step size for exp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.02957","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:46:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Gi9LyfKzuzVA17r27iKZEIuDd3Dy064JdGjQf1tlfKpsKZ7E3gfkXbGZChHfEwF9cxS1YsX1N/felkwTuf/KDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T15:16:19.032570Z"},"content_sha256":"e20d894365cdb3251d043a4d6b60d365765b0d5d09b133abd648c749ee8fb467","schema_version":"1.0","event_id":"sha256:e20d894365cdb3251d043a4d6b60d365765b0d5d09b133abd648c749ee8fb467"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DAMCKEJMR26LDZEWAKHSVQAOOH/bundle.json","state_url":"https://pith.science/pith/DAMCKEJMR26LDZEWAKHSVQAOOH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DAMCKEJMR26LDZEWAKHSVQAOOH/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-01T15:16:19Z","links":{"resolver":"https://pith.science/pith/DAMCKEJMR26LDZEWAKHSVQAOOH","bundle":"https://pith.science/pith/DAMCKEJMR26LDZEWAKHSVQAOOH/bundle.json","state":"https://pith.science/pith/DAMCKEJMR26LDZEWAKHSVQAOOH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DAMCKEJMR26LDZEWAKHSVQAOOH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:DAMCKEJMR26LDZEWAKHSVQAOOH","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":"fbee04aa23d4ffa93ad65652a74fd827595d4e035290d10aa486059622e2259b","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-08T08:38:30Z","title_canon_sha256":"c954a6e61e98e35e38867920a46720bdf9abded31174b6f345502f6407869594"},"schema_version":"1.0","source":{"id":"1905.02957","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.02957","created_at":"2026-05-17T23:46:43Z"},{"alias_kind":"arxiv_version","alias_value":"1905.02957v1","created_at":"2026-05-17T23:46:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.02957","created_at":"2026-05-17T23:46:43Z"},{"alias_kind":"pith_short_12","alias_value":"DAMCKEJMR26L","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"DAMCKEJMR26LDZEW","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"DAMCKEJM","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:e20d894365cdb3251d043a4d6b60d365765b0d5d09b133abd648c749ee8fb467","target":"graph","created_at":"2026-05-17T23:46:43Z","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"},"paper":{"abstract_excerpt":"The Adam algorithm has become extremely popular for large-scale machine learning. Under convexity condition, it has been proved to enjoy a data-dependant $O(\\sqrt{T})$ regret bound where $T$ is the time horizon. However, whether strong convexity can be utilized to further improve the performance remains an open problem. In this paper, we give an affirmative answer by developing a variant of Adam (referred to as SAdam) which achieves a data-dependant $O(\\log T)$ regret bound for strongly convex functions. The essential idea is to maintain a faster decaying yet under controlled step size for exp","authors_text":"Guanghui Wang, Lijun Zhang, Shiyin Lu, Weiwei Tu","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-08T08:38:30Z","title":"SAdam: A Variant of Adam for Strongly Convex Functions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.02957","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:e9444f4548e901d1925f093dd8d9c2e2f0ce69cd0dfa04b02633acc43ca0fa8f","target":"record","created_at":"2026-05-17T23:46:43Z","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":"fbee04aa23d4ffa93ad65652a74fd827595d4e035290d10aa486059622e2259b","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-08T08:38:30Z","title_canon_sha256":"c954a6e61e98e35e38867920a46720bdf9abded31174b6f345502f6407869594"},"schema_version":"1.0","source":{"id":"1905.02957","kind":"arxiv","version":1}},"canonical_sha256":"181825112c8ebcb1e496028f2ac00e71c03e961db83d23238e6fd1c7ac2b7ef8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"181825112c8ebcb1e496028f2ac00e71c03e961db83d23238e6fd1c7ac2b7ef8","first_computed_at":"2026-05-17T23:46:43.286580Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:46:43.286580Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9kmrw4+E+khKIqOHxGGINlVsco8YAYsDzd2mr+iDlU8r6ga9r2BTwcGj2aFDsQJZPKzX7TqxRn2ckKckl7rkDA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:46:43.287076Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.02957","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e9444f4548e901d1925f093dd8d9c2e2f0ce69cd0dfa04b02633acc43ca0fa8f","sha256:e20d894365cdb3251d043a4d6b60d365765b0d5d09b133abd648c749ee8fb467"],"state_sha256":"caefb780876e051f8eff3e454680e08d199d85e357cf8a2359fe2340f9ff2a7a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TNEzcblWmRpx568WaqnN00bdwnk5r9GRLZuB8mOvHrKVK4w82+0s20OmD5IFLvjLNAkFhCoZ9gOPTNv7OiMXAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T15:16:19.034559Z","bundle_sha256":"28c78a0f14ac90c717458d287a92e10d8c7b9a09a845db16dda1e5664b9cdb80"}}