{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:PJIOQO5FXRC4HM7T4OAIG3QBLH","short_pith_number":"pith:PJIOQO5F","schema_version":"1.0","canonical_sha256":"7a50e83ba5bc45c3b3f3e380836e0159e81fa3e88496eb2658436b0bfb0412ff","source":{"kind":"arxiv","id":"2310.19786","version":4},"attestation_state":"computed","paper":{"title":"From External to Swap Regret 2.0: An Efficient Reduction and Oblivious Adversary for Large Action Spaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.GT"],"primary_cat":"cs.LG","authors_text":"Constantinos Daskalakis, Maxwell Fishelson, Noah Golowich, Yuval Dagan","submitted_at":"2023-10-30T17:50:29Z","abstract_excerpt":"We provide a novel reduction from swap-regret minimization to external-regret minimization, which improves upon the classical reductions of Blum-Mansour [BM07] and Stolz-Lugosi [SL05] in that it does not require finiteness of the space of actions. We show that, whenever there exists a no-external-regret algorithm for some hypothesis class, there must also exist a no-swap-regret algorithm for that same class. For the problem of learning with expert advice, our result implies that it is possible to guarantee that the swap regret is bounded by {\\epsilon} after $\\log(N)^{O(1/\\epsilon)}$ rounds and"},"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":"2310.19786","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-10-30T17:50:29Z","cross_cats_sorted":["cs.AI","cs.GT"],"title_canon_sha256":"2d6c952fcb3024460a9cac7e0fbbaa091e8ec4f01e3a880627ace66c5a565222","abstract_canon_sha256":"7fc0e29763bf90009558153c612596ee9cd1edc4b63963911a24649ae7e835f4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:18:33.454680Z","signature_b64":"yXAPAYEtJGdycAxpdDpxNdFuLQsYZ4ayzTXd4aI5XZb13ALo7RwTmvFpZ7+Ksb6iGmlfNiwlQTbTJxfabGJODA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7a50e83ba5bc45c3b3f3e380836e0159e81fa3e88496eb2658436b0bfb0412ff","last_reissued_at":"2026-07-05T10:18:33.454246Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:18:33.454246Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"From External to Swap Regret 2.0: An Efficient Reduction and Oblivious Adversary for Large Action Spaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.GT"],"primary_cat":"cs.LG","authors_text":"Constantinos Daskalakis, Maxwell Fishelson, Noah Golowich, Yuval Dagan","submitted_at":"2023-10-30T17:50:29Z","abstract_excerpt":"We provide a novel reduction from swap-regret minimization to external-regret minimization, which improves upon the classical reductions of Blum-Mansour [BM07] and Stolz-Lugosi [SL05] in that it does not require finiteness of the space of actions. We show that, whenever there exists a no-external-regret algorithm for some hypothesis class, there must also exist a no-swap-regret algorithm for that same class. For the problem of learning with expert advice, our result implies that it is possible to guarantee that the swap regret is bounded by {\\epsilon} after $\\log(N)^{O(1/\\epsilon)}$ rounds and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.19786","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2310.19786/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2310.19786","created_at":"2026-07-05T10:18:33.454301+00:00"},{"alias_kind":"arxiv_version","alias_value":"2310.19786v4","created_at":"2026-07-05T10:18:33.454301+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.19786","created_at":"2026-07-05T10:18:33.454301+00:00"},{"alias_kind":"pith_short_12","alias_value":"PJIOQO5FXRC4","created_at":"2026-07-05T10:18:33.454301+00:00"},{"alias_kind":"pith_short_16","alias_value":"PJIOQO5FXRC4HM7T","created_at":"2026-07-05T10:18:33.454301+00:00"},{"alias_kind":"pith_short_8","alias_value":"PJIOQO5F","created_at":"2026-07-05T10:18:33.454301+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.02655","citing_title":"Coherent Swap Regret and Channel-Proof Learning","ref_index":8,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PJIOQO5FXRC4HM7T4OAIG3QBLH","json":"https://pith.science/pith/PJIOQO5FXRC4HM7T4OAIG3QBLH.json","graph_json":"https://pith.science/api/pith-number/PJIOQO5FXRC4HM7T4OAIG3QBLH/graph.json","events_json":"https://pith.science/api/pith-number/PJIOQO5FXRC4HM7T4OAIG3QBLH/events.json","paper":"https://pith.science/paper/PJIOQO5F"},"agent_actions":{"view_html":"https://pith.science/pith/PJIOQO5FXRC4HM7T4OAIG3QBLH","download_json":"https://pith.science/pith/PJIOQO5FXRC4HM7T4OAIG3QBLH.json","view_paper":"https://pith.science/paper/PJIOQO5F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2310.19786&json=true","fetch_graph":"https://pith.science/api/pith-number/PJIOQO5FXRC4HM7T4OAIG3QBLH/graph.json","fetch_events":"https://pith.science/api/pith-number/PJIOQO5FXRC4HM7T4OAIG3QBLH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PJIOQO5FXRC4HM7T4OAIG3QBLH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PJIOQO5FXRC4HM7T4OAIG3QBLH/action/storage_attestation","attest_author":"https://pith.science/pith/PJIOQO5FXRC4HM7T4OAIG3QBLH/action/author_attestation","sign_citation":"https://pith.science/pith/PJIOQO5FXRC4HM7T4OAIG3QBLH/action/citation_signature","submit_replication":"https://pith.science/pith/PJIOQO5FXRC4HM7T4OAIG3QBLH/action/replication_record"}},"created_at":"2026-07-05T10:18:33.454301+00:00","updated_at":"2026-07-05T10:18:33.454301+00:00"}