{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:KQ42K7GBCX3T7T7MSABVAUGORQ","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":"8694f43ed6ece4fc93172eb84aed7d630fe65b04113b8b2f9588da521325e04d","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-15T02:29:21Z","title_canon_sha256":"20dc0ce52ae99e614babb540fd53e01ef8daae6961202b31bb51f84471c7ad8c"},"schema_version":"1.0","source":{"id":"1905.05917","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.05917","created_at":"2026-05-17T23:46:08Z"},{"alias_kind":"arxiv_version","alias_value":"1905.05917v1","created_at":"2026-05-17T23:46:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.05917","created_at":"2026-05-17T23:46:08Z"},{"alias_kind":"pith_short_12","alias_value":"KQ42K7GBCX3T","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"KQ42K7GBCX3T7T7M","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"KQ42K7GB","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:3a2f480c1c422621175cfdaeed6b204909417ccf29da0f352e09f45c2aa92ac6","target":"graph","created_at":"2026-05-17T23:46:08Z","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":"In this paper, we study adaptive online convex optimization, and aim to design a universal algorithm that achieves optimal regret bounds for multiple common types of loss functions. Existing universal methods are limited in the sense that they are optimal for only a subclass of loss functions. To address this limitation, we propose a novel online method, namely Maler, which enjoys the optimal $O(\\sqrt{T})$, $O(d\\log T)$ and $O(\\log T)$ regret bounds for general convex, exponentially concave, and strongly convex functions respectively. The essential idea is to run multiple types of learning alg","authors_text":"Guanghui Wang, Lijun Zhang, Shiyin Lu","cross_cats":["math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-15T02:29:21Z","title":"Adaptivity and Optimality: A Universal Algorithm for Online Convex Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.05917","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:3f452b4b34ced2f0eac0ae6443b119541cf1ad39130d8a8821c3519947387ae0","target":"record","created_at":"2026-05-17T23:46:08Z","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":"8694f43ed6ece4fc93172eb84aed7d630fe65b04113b8b2f9588da521325e04d","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-15T02:29:21Z","title_canon_sha256":"20dc0ce52ae99e614babb540fd53e01ef8daae6961202b31bb51f84471c7ad8c"},"schema_version":"1.0","source":{"id":"1905.05917","kind":"arxiv","version":1}},"canonical_sha256":"5439a57cc115f73fcfec90035050ce8c1a8029ca0704c02332af59eb24e08d19","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5439a57cc115f73fcfec90035050ce8c1a8029ca0704c02332af59eb24e08d19","first_computed_at":"2026-05-17T23:46:08.112091Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:46:08.112091Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nM8/fonXceCVxYwmoMIl2pVHlhK86KDGhIum+a1vvYilO1VTRRS1iNQ3U35iYVbh1wYYizyDbRiuHL7NlzwkBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:46:08.112819Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.05917","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3f452b4b34ced2f0eac0ae6443b119541cf1ad39130d8a8821c3519947387ae0","sha256:3a2f480c1c422621175cfdaeed6b204909417ccf29da0f352e09f45c2aa92ac6"],"state_sha256":"acf5b471d9c7f324b637128f9c81b940228d346958662012cafca08a93c78ec0"}