{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:5K5BLIOWRKSSEKSLM4CS53TOOQ","short_pith_number":"pith:5K5BLIOW","schema_version":"1.0","canonical_sha256":"eaba15a1d68aa5222a4b67052eee6e7423d52a7744c929e2234306162b5eb5c4","source":{"kind":"arxiv","id":"1709.02726","version":1},"attestation_state":"computed","paper":{"title":"A Modular Analysis of Adaptive (Non-)Convex Optimization: Optimism, Composite Objectives, and Variational Bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Andr\\'as Gy\\\"orgy, Csaba Szepesv\\'ari, Pooria Joulani","submitted_at":"2017-09-08T14:54:44Z","abstract_excerpt":"Recently, much work has been done on extending the scope of online learning and incremental stochastic optimization algorithms. In this paper we contribute to this effort in two ways: First, based on a new regret decomposition and a generalization of Bregman divergences, we provide a self-contained, modular analysis of the two workhorses of online learning: (general) adaptive versions of Mirror Descent (MD) and the Follow-the-Regularized-Leader (FTRL) algorithms. The analysis is done with extra care so as not to introduce assumptions not needed in the proofs and allows to combine, in a straigh"},"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":"1709.02726","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-09-08T14:54:44Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"fa452553b5deeeb7e3c88f60455b527be0622b34e43939d4fbfdebddb79da7ad","abstract_canon_sha256":"f41dc59eeb231dc57bd7e8ffe7b1abc6953e8a6864b3c49ae3c1435e146aaf24"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:40.487355Z","signature_b64":"+nWHuZizj39/GBnIKxl3bEcCCIVIhvBJ4/sYoeKZdjiM7Sw2x1wM1N9/vHZaDAHAS9BAFFlTP/4moNymTl75Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eaba15a1d68aa5222a4b67052eee6e7423d52a7744c929e2234306162b5eb5c4","last_reissued_at":"2026-05-18T00:35:40.486643Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:40.486643Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Modular Analysis of Adaptive (Non-)Convex Optimization: Optimism, Composite Objectives, and Variational Bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Andr\\'as Gy\\\"orgy, Csaba Szepesv\\'ari, Pooria Joulani","submitted_at":"2017-09-08T14:54:44Z","abstract_excerpt":"Recently, much work has been done on extending the scope of online learning and incremental stochastic optimization algorithms. In this paper we contribute to this effort in two ways: First, based on a new regret decomposition and a generalization of Bregman divergences, we provide a self-contained, modular analysis of the two workhorses of online learning: (general) adaptive versions of Mirror Descent (MD) and the Follow-the-Regularized-Leader (FTRL) algorithms. The analysis is done with extra care so as not to introduce assumptions not needed in the proofs and allows to combine, in a straigh"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.02726","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":"1709.02726","created_at":"2026-05-18T00:35:40.486766+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.02726v1","created_at":"2026-05-18T00:35:40.486766+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.02726","created_at":"2026-05-18T00:35:40.486766+00:00"},{"alias_kind":"pith_short_12","alias_value":"5K5BLIOWRKSS","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_16","alias_value":"5K5BLIOWRKSSEKSL","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_8","alias_value":"5K5BLIOW","created_at":"2026-05-18T12:31:00.734936+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/5K5BLIOWRKSSEKSLM4CS53TOOQ","json":"https://pith.science/pith/5K5BLIOWRKSSEKSLM4CS53TOOQ.json","graph_json":"https://pith.science/api/pith-number/5K5BLIOWRKSSEKSLM4CS53TOOQ/graph.json","events_json":"https://pith.science/api/pith-number/5K5BLIOWRKSSEKSLM4CS53TOOQ/events.json","paper":"https://pith.science/paper/5K5BLIOW"},"agent_actions":{"view_html":"https://pith.science/pith/5K5BLIOWRKSSEKSLM4CS53TOOQ","download_json":"https://pith.science/pith/5K5BLIOWRKSSEKSLM4CS53TOOQ.json","view_paper":"https://pith.science/paper/5K5BLIOW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.02726&json=true","fetch_graph":"https://pith.science/api/pith-number/5K5BLIOWRKSSEKSLM4CS53TOOQ/graph.json","fetch_events":"https://pith.science/api/pith-number/5K5BLIOWRKSSEKSLM4CS53TOOQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5K5BLIOWRKSSEKSLM4CS53TOOQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5K5BLIOWRKSSEKSLM4CS53TOOQ/action/storage_attestation","attest_author":"https://pith.science/pith/5K5BLIOWRKSSEKSLM4CS53TOOQ/action/author_attestation","sign_citation":"https://pith.science/pith/5K5BLIOWRKSSEKSLM4CS53TOOQ/action/citation_signature","submit_replication":"https://pith.science/pith/5K5BLIOWRKSSEKSLM4CS53TOOQ/action/replication_record"}},"created_at":"2026-05-18T00:35:40.486766+00:00","updated_at":"2026-05-18T00:35:40.486766+00:00"}