{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:I2DVFSGAAUAU22AFOWA2PEORFY","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":"53d6eac04637128d1f58291f6467306252a7e4f5c4e71a3d9a3246386dd7868f","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2024-06-10T23:23:52Z","title_canon_sha256":"4bd2a198aaecbd4d5654374244c1fd21a40c7f52310a584d925e03512c80a63d"},"schema_version":"1.0","source":{"id":"2406.07585","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2406.07585","created_at":"2026-07-05T08:44:55Z"},{"alias_kind":"arxiv_version","alias_value":"2406.07585v2","created_at":"2026-07-05T08:44:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.07585","created_at":"2026-07-05T08:44:55Z"},{"alias_kind":"pith_short_12","alias_value":"I2DVFSGAAUAU","created_at":"2026-07-05T08:44:55Z"},{"alias_kind":"pith_short_16","alias_value":"I2DVFSGAAUAU22AF","created_at":"2026-07-05T08:44:55Z"},{"alias_kind":"pith_short_8","alias_value":"I2DVFSGA","created_at":"2026-07-05T08:44:55Z"}],"graph_snapshots":[{"event_id":"sha256:2721f6c9db77fc8866d341d48c93ae8a20edb7e99596010dde91893d84a0741b","target":"graph","created_at":"2026-07-05T08:44:55Z","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/2406.07585/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Abernethy et al. (2011) showed that Blackwell approachability and no-regret learning are equivalent, in the sense that any algorithm that solves a specific Blackwell approachability instance can be converted to a sublinear regret algorithm for a specific no-regret learning instance, and vice versa. In this paper, we study a more fine-grained form of such reductions, and ask when this translation between problems preserves not only a sublinear rate of convergence, but also preserves the optimal rate of convergence. That is, in which cases does it suffice to find the optimal regret bound for a n","authors_text":"Balasubramanian Sivan, Christoph Dann, Jon Schneider, Mehryar Mohri, Yishay Mansour","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2024-06-10T23:23:52Z","title":"Rate-Preserving Reductions for Blackwell Approachability"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.07585","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:c0d8c947cca19da08ba8e22808a80f8650f422e5a56b541f5a39737d4e7ce33f","target":"record","created_at":"2026-07-05T08:44:55Z","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":"53d6eac04637128d1f58291f6467306252a7e4f5c4e71a3d9a3246386dd7868f","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2024-06-10T23:23:52Z","title_canon_sha256":"4bd2a198aaecbd4d5654374244c1fd21a40c7f52310a584d925e03512c80a63d"},"schema_version":"1.0","source":{"id":"2406.07585","kind":"arxiv","version":2}},"canonical_sha256":"468752c8c005014d68057581a791d12e173889d26d32483000d5fb2747f9097c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"468752c8c005014d68057581a791d12e173889d26d32483000d5fb2747f9097c","first_computed_at":"2026-07-05T08:44:55.142031Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:44:55.142031Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Pr1jlIuBznh0fLcdYuDGFJ1hyOL6F39wAiu2gEVXQH4PyF4fhp6XgA7wtG0P1ZE76vr1xRWjOa9s36VodPGGDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T08:44:55.142466Z","signed_message":"canonical_sha256_bytes"},"source_id":"2406.07585","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c0d8c947cca19da08ba8e22808a80f8650f422e5a56b541f5a39737d4e7ce33f","sha256:2721f6c9db77fc8866d341d48c93ae8a20edb7e99596010dde91893d84a0741b"],"state_sha256":"1ccfd4e17177ffadceda5162127406e029c04ab0e78f2a5dccba1caed1c527eb"}