{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:EMARQAO3VD4ZAMMNJSLRZ6PZEE","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":"c50588e9c7d6bce2ae785018c9e512b6b1f568349fe54ffaccd82bddaaaa75ac","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-05-28T16:01:42Z","title_canon_sha256":"29e4d416bec8a699261abae5430ac2c741c24ac8a4f7ddd2fa98358326af6af4"},"schema_version":"1.0","source":{"id":"2105.13939","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2105.13939","created_at":"2026-07-05T02:46:14Z"},{"alias_kind":"arxiv_version","alias_value":"2105.13939v2","created_at":"2026-07-05T02:46:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.13939","created_at":"2026-07-05T02:46:14Z"},{"alias_kind":"pith_short_12","alias_value":"EMARQAO3VD4Z","created_at":"2026-07-05T02:46:14Z"},{"alias_kind":"pith_short_16","alias_value":"EMARQAO3VD4ZAMMN","created_at":"2026-07-05T02:46:14Z"},{"alias_kind":"pith_short_8","alias_value":"EMARQAO3","created_at":"2026-07-05T02:46:14Z"}],"graph_snapshots":[{"event_id":"sha256:c114bafb63abc1e11dde278da7d3c82bf0b03e361b78016201b8a7251dcede45","target":"graph","created_at":"2026-07-05T02:46:14Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2105.13939/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Several learning problems involve solving min-max problems, e.g., empirical distributional robust learning or learning with non-standard aggregated losses. More specifically, these problems are convex-linear problems where the minimization is carried out over the model parameters $w\\in\\mathcal{W}$ and the maximization over the empirical distribution $p\\in\\mathcal{K}$ of the training set indexes, where $\\mathcal{K}$ is the simplex or a subset of it. To design efficient methods, we let an online learning algorithm play against a (combinatorial) bandit algorithm. We argue that the efficiency of s","authors_text":"Christophe Roux, Elias Wirth, Sebastian Pokutta, Thomas Kerdreux","cross_cats":["math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-05-28T16:01:42Z","title":"Efficient Online-Bandit Strategies for Minimax Learning Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.13939","kind":"arxiv","version":2},"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:dd233396cffaac02f56625d2f600e27e967e62951f9c87b0b16a3ccf92ed2f0c","target":"record","created_at":"2026-07-05T02:46:14Z","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":"c50588e9c7d6bce2ae785018c9e512b6b1f568349fe54ffaccd82bddaaaa75ac","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-05-28T16:01:42Z","title_canon_sha256":"29e4d416bec8a699261abae5430ac2c741c24ac8a4f7ddd2fa98358326af6af4"},"schema_version":"1.0","source":{"id":"2105.13939","kind":"arxiv","version":2}},"canonical_sha256":"23011801dba8f990318d4c971cf9f9211b8511ba7338c9668e8b9559058668b1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"23011801dba8f990318d4c971cf9f9211b8511ba7338c9668e8b9559058668b1","first_computed_at":"2026-07-05T02:46:14.222784Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:46:14.222784Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Drg6ZPTs146WYgPUE2uIvm7Dn/pbg+3Dct0rLTXd5RdybyCeX0V8+9hqCYft1dJjbgqBxbDMkIDDmdI9pMZ3AA==","signature_status":"signed_v1","signed_at":"2026-07-05T02:46:14.223197Z","signed_message":"canonical_sha256_bytes"},"source_id":"2105.13939","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dd233396cffaac02f56625d2f600e27e967e62951f9c87b0b16a3ccf92ed2f0c","sha256:c114bafb63abc1e11dde278da7d3c82bf0b03e361b78016201b8a7251dcede45"],"state_sha256":"33df4efa910f2e5f09cc3cd7a7917b2e690775abdaeacfbf11a0a6a4720c19bc"}