{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:DAMCKEJMR26LDZEWAKHSVQAOOH","short_pith_number":"pith:DAMCKEJM","schema_version":"1.0","canonical_sha256":"181825112c8ebcb1e496028f2ac00e71c03e961db83d23238e6fd1c7ac2b7ef8","source":{"kind":"arxiv","id":"1905.02957","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1905.02957","created_at":"2026-05-17T23:46:43.286650+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.02957v1","created_at":"2026-05-17T23:46:43.286650+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.02957","created_at":"2026-05-17T23:46:43.286650+00:00"},{"alias_kind":"pith_short_12","alias_value":"DAMCKEJMR26L","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_16","alias_value":"DAMCKEJMR26LDZEW","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_8","alias_value":"DAMCKEJM","created_at":"2026-05-18T12:33:15.570797+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/DAMCKEJMR26LDZEWAKHSVQAOOH","json":"https://pith.science/pith/DAMCKEJMR26LDZEWAKHSVQAOOH.json","graph_json":"https://pith.science/api/pith-number/DAMCKEJMR26LDZEWAKHSVQAOOH/graph.json","events_json":"https://pith.science/api/pith-number/DAMCKEJMR26LDZEWAKHSVQAOOH/events.json","paper":"https://pith.science/paper/DAMCKEJM"},"agent_actions":{"view_html":"https://pith.science/pith/DAMCKEJMR26LDZEWAKHSVQAOOH","download_json":"https://pith.science/pith/DAMCKEJMR26LDZEWAKHSVQAOOH.json","view_paper":"https://pith.science/paper/DAMCKEJM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.02957&json=true","fetch_graph":"https://pith.science/api/pith-number/DAMCKEJMR26LDZEWAKHSVQAOOH/graph.json","fetch_events":"https://pith.science/api/pith-number/DAMCKEJMR26LDZEWAKHSVQAOOH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DAMCKEJMR26LDZEWAKHSVQAOOH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DAMCKEJMR26LDZEWAKHSVQAOOH/action/storage_attestation","attest_author":"https://pith.science/pith/DAMCKEJMR26LDZEWAKHSVQAOOH/action/author_attestation","sign_citation":"https://pith.science/pith/DAMCKEJMR26LDZEWAKHSVQAOOH/action/citation_signature","submit_replication":"https://pith.science/pith/DAMCKEJMR26LDZEWAKHSVQAOOH/action/replication_record"}},"created_at":"2026-05-17T23:46:43.286650+00:00","updated_at":"2026-05-17T23:46:43.286650+00:00"}