{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:AKCJCRHSD4PZ5RMMLYLMQVH3QT","short_pith_number":"pith:AKCJCRHS","schema_version":"1.0","canonical_sha256":"02849144f21f1f9ec58c5e16c854fb84f8242f27f3776c9119b4cd597e3acb15","source":{"kind":"arxiv","id":"1302.4387","version":2},"attestation_state":"computed","paper":{"title":"Online Learning with Switching Costs and Other Adaptive Adversaries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Nicolo Cesa-Bianchi, Ofer Dekel, Ohad Shamir","submitted_at":"2013-02-18T18:46:37Z","abstract_excerpt":"We study the power of different types of adaptive (nonoblivious) adversaries in the setting of prediction with expert advice, under both full-information and bandit feedback. We measure the player's performance using a new notion of regret, also known as policy regret, which better captures the adversary's adaptiveness to the player's behavior. In a setting where losses are allowed to drift, we characterize ---in a nearly complete manner--- the power of adaptive adversaries with bounded memories and switching costs. In particular, we show that with switching costs, the attainable rate with ban"},"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":"1302.4387","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-02-18T18:46:37Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"f43d53b737ac56e553c57e6274ee8d14f072ba630b708c8a33884ed69b054f55","abstract_canon_sha256":"532a4cebbfeab135a54788a5d6b1cfdbdd774c142d8819a38019100b012bbd0f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:22:05.476859Z","signature_b64":"SzZG1qa2sTVOW9sZgxkgcD5ewGM6lxkHR6k29qzTvksBPiT8t/J8HHfpSI52sE+NyYxP1dEGHDtOVTt5rJmcDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"02849144f21f1f9ec58c5e16c854fb84f8242f27f3776c9119b4cd597e3acb15","last_reissued_at":"2026-05-18T03:22:05.475932Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:22:05.475932Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Online Learning with Switching Costs and Other Adaptive Adversaries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Nicolo Cesa-Bianchi, Ofer Dekel, Ohad Shamir","submitted_at":"2013-02-18T18:46:37Z","abstract_excerpt":"We study the power of different types of adaptive (nonoblivious) adversaries in the setting of prediction with expert advice, under both full-information and bandit feedback. We measure the player's performance using a new notion of regret, also known as policy regret, which better captures the adversary's adaptiveness to the player's behavior. In a setting where losses are allowed to drift, we characterize ---in a nearly complete manner--- the power of adaptive adversaries with bounded memories and switching costs. In particular, we show that with switching costs, the attainable rate with ban"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.4387","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1302.4387","created_at":"2026-05-18T03:22:05.476083+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.4387v2","created_at":"2026-05-18T03:22:05.476083+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.4387","created_at":"2026-05-18T03:22:05.476083+00:00"},{"alias_kind":"pith_short_12","alias_value":"AKCJCRHSD4PZ","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_16","alias_value":"AKCJCRHSD4PZ5RMM","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_8","alias_value":"AKCJCRHS","created_at":"2026-05-18T12:27:38.830355+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.05479","citing_title":"Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors","ref_index":24,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AKCJCRHSD4PZ5RMMLYLMQVH3QT","json":"https://pith.science/pith/AKCJCRHSD4PZ5RMMLYLMQVH3QT.json","graph_json":"https://pith.science/api/pith-number/AKCJCRHSD4PZ5RMMLYLMQVH3QT/graph.json","events_json":"https://pith.science/api/pith-number/AKCJCRHSD4PZ5RMMLYLMQVH3QT/events.json","paper":"https://pith.science/paper/AKCJCRHS"},"agent_actions":{"view_html":"https://pith.science/pith/AKCJCRHSD4PZ5RMMLYLMQVH3QT","download_json":"https://pith.science/pith/AKCJCRHSD4PZ5RMMLYLMQVH3QT.json","view_paper":"https://pith.science/paper/AKCJCRHS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.4387&json=true","fetch_graph":"https://pith.science/api/pith-number/AKCJCRHSD4PZ5RMMLYLMQVH3QT/graph.json","fetch_events":"https://pith.science/api/pith-number/AKCJCRHSD4PZ5RMMLYLMQVH3QT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AKCJCRHSD4PZ5RMMLYLMQVH3QT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AKCJCRHSD4PZ5RMMLYLMQVH3QT/action/storage_attestation","attest_author":"https://pith.science/pith/AKCJCRHSD4PZ5RMMLYLMQVH3QT/action/author_attestation","sign_citation":"https://pith.science/pith/AKCJCRHSD4PZ5RMMLYLMQVH3QT/action/citation_signature","submit_replication":"https://pith.science/pith/AKCJCRHSD4PZ5RMMLYLMQVH3QT/action/replication_record"}},"created_at":"2026-05-18T03:22:05.476083+00:00","updated_at":"2026-05-18T03:22:05.476083+00:00"}