{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:5QTCGDKLY32F2EMPOMSWW4TOFR","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":"74dc177b37dc4c17ba118c9ef47608ebea06e6a2dd3954009f151c98b0832d78","cross_cats_sorted":["cs.LG","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2018-05-23T13:49:11Z","title_canon_sha256":"a2de9b67eb1110f2e94cad137a806a517c9f6b071679ecb6e98e7808b242c9b5"},"schema_version":"1.0","source":{"id":"1805.09174","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.09174","created_at":"2026-05-18T00:15:08Z"},{"alias_kind":"arxiv_version","alias_value":"1805.09174v1","created_at":"2026-05-18T00:15:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.09174","created_at":"2026-05-18T00:15:08Z"},{"alias_kind":"pith_short_12","alias_value":"5QTCGDKLY32F","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"5QTCGDKLY32F2EMP","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"5QTCGDKL","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:6308dd09b7166623948f89a52a4dd44e4742a1fb2015db18bc8f4b37e67d67f5","target":"graph","created_at":"2026-05-18T00:15: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":"We consider the online convex optimization problem. In the setting of arbitrary sequences and finite set of parameters, we establish a new fast-rate quantile regret bound. Then we investigate the optimization into the L1-ball by discretizing the parameter space. Our algorithm is projection free and we propose an efficient solution by restarting the algorithm on adaptive discretization grids. In the adversarial setting, we develop an algorithm that achieves several rates of convergence with different dependencies on the sparsity of the objective. In the i.i.d. setting, we establish new risk bou","authors_text":"Olivier Wintenberger (LPSM UMR 8001), Pierre Gaillard (SIERRA)","cross_cats":["cs.LG","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2018-05-23T13:49:11Z","title":"Efficient online algorithms for fast-rate regret bounds under sparsity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.09174","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:dc9733b602fd128c4b7ab413c9993bb96839a28fcda4d48f14aede14713f4296","target":"record","created_at":"2026-05-18T00:15: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":"74dc177b37dc4c17ba118c9ef47608ebea06e6a2dd3954009f151c98b0832d78","cross_cats_sorted":["cs.LG","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2018-05-23T13:49:11Z","title_canon_sha256":"a2de9b67eb1110f2e94cad137a806a517c9f6b071679ecb6e98e7808b242c9b5"},"schema_version":"1.0","source":{"id":"1805.09174","kind":"arxiv","version":1}},"canonical_sha256":"ec26230d4bc6f45d118f73256b726e2c655856e7e707dca7f8d16271795f676e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ec26230d4bc6f45d118f73256b726e2c655856e7e707dca7f8d16271795f676e","first_computed_at":"2026-05-18T00:15:08.300274Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:15:08.300274Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MdM06vn3nG17+h6o02kjRMWnquBK+ejUqHHAB7+slZOP6qo6Xc3z9kZFsbuCVEtZcCwWp2DK08nyto8G2FURAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:15:08.300917Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.09174","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dc9733b602fd128c4b7ab413c9993bb96839a28fcda4d48f14aede14713f4296","sha256:6308dd09b7166623948f89a52a4dd44e4742a1fb2015db18bc8f4b37e67d67f5"],"state_sha256":"a1a56f36310beb4bcd7f3d1a40cb78166a268aad5e98f23bd0e356cee0818cfa"}