{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:U6IPCW5ZZB4THMCX3IWINBLRP6","short_pith_number":"pith:U6IPCW5Z","schema_version":"1.0","canonical_sha256":"a790f15bb9c87933b057da2c8685717f8bf0a1f5c22d80245bd6d7f745087031","source":{"kind":"arxiv","id":"1602.02454","version":1},"attestation_state":"computed","paper":{"title":"Efficient Algorithms for Adversarial Contextual Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Akshay Krishnamurthy, Robert E. Schapire, Vasilis Syrgkanis","submitted_at":"2016-02-08T03:11:39Z","abstract_excerpt":"We provide the first oracle efficient sublinear regret algorithms for adversarial versions of the contextual bandit problem. In this problem, the learner repeatedly makes an action on the basis of a context and receives reward for the chosen action, with the goal of achieving reward competitive with a large class of policies. We analyze two settings: i) in the transductive setting the learner knows the set of contexts a priori, ii) in the small separator setting, there exists a small set of contexts such that any two policies behave differently in one of the contexts in the set. Our algorithms"},"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":"1602.02454","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-02-08T03:11:39Z","cross_cats_sorted":[],"title_canon_sha256":"63ad7f18f8b48d436f39defd7c1c4411b4753da67956d80973c106541d2a079c","abstract_canon_sha256":"8aa27a436a334b84a7c36311f913e740ddb077ee56dc68f09cde0285436f1fd2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:09.908753Z","signature_b64":"P4vj7n5wha6+r8OZvHQ57SFcM2N/prveWLvvcWUzd+INoiZtbvD1wyb26K6iYF/1Gs9VLUTbJq9RIVyA26KmBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a790f15bb9c87933b057da2c8685717f8bf0a1f5c22d80245bd6d7f745087031","last_reissued_at":"2026-05-18T01:21:09.908142Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:09.908142Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Algorithms for Adversarial Contextual Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Akshay Krishnamurthy, Robert E. Schapire, Vasilis Syrgkanis","submitted_at":"2016-02-08T03:11:39Z","abstract_excerpt":"We provide the first oracle efficient sublinear regret algorithms for adversarial versions of the contextual bandit problem. In this problem, the learner repeatedly makes an action on the basis of a context and receives reward for the chosen action, with the goal of achieving reward competitive with a large class of policies. We analyze two settings: i) in the transductive setting the learner knows the set of contexts a priori, ii) in the small separator setting, there exists a small set of contexts such that any two policies behave differently in one of the contexts in the set. Our algorithms"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.02454","kind":"arxiv","version":1},"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":"1602.02454","created_at":"2026-05-18T01:21:09.908236+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.02454v1","created_at":"2026-05-18T01:21:09.908236+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.02454","created_at":"2026-05-18T01:21:09.908236+00:00"},{"alias_kind":"pith_short_12","alias_value":"U6IPCW5ZZB4T","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_16","alias_value":"U6IPCW5ZZB4THMCX","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_8","alias_value":"U6IPCW5Z","created_at":"2026-05-18T12:30:46.583412+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/U6IPCW5ZZB4THMCX3IWINBLRP6","json":"https://pith.science/pith/U6IPCW5ZZB4THMCX3IWINBLRP6.json","graph_json":"https://pith.science/api/pith-number/U6IPCW5ZZB4THMCX3IWINBLRP6/graph.json","events_json":"https://pith.science/api/pith-number/U6IPCW5ZZB4THMCX3IWINBLRP6/events.json","paper":"https://pith.science/paper/U6IPCW5Z"},"agent_actions":{"view_html":"https://pith.science/pith/U6IPCW5ZZB4THMCX3IWINBLRP6","download_json":"https://pith.science/pith/U6IPCW5ZZB4THMCX3IWINBLRP6.json","view_paper":"https://pith.science/paper/U6IPCW5Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.02454&json=true","fetch_graph":"https://pith.science/api/pith-number/U6IPCW5ZZB4THMCX3IWINBLRP6/graph.json","fetch_events":"https://pith.science/api/pith-number/U6IPCW5ZZB4THMCX3IWINBLRP6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U6IPCW5ZZB4THMCX3IWINBLRP6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U6IPCW5ZZB4THMCX3IWINBLRP6/action/storage_attestation","attest_author":"https://pith.science/pith/U6IPCW5ZZB4THMCX3IWINBLRP6/action/author_attestation","sign_citation":"https://pith.science/pith/U6IPCW5ZZB4THMCX3IWINBLRP6/action/citation_signature","submit_replication":"https://pith.science/pith/U6IPCW5ZZB4THMCX3IWINBLRP6/action/replication_record"}},"created_at":"2026-05-18T01:21:09.908236+00:00","updated_at":"2026-05-18T01:21:09.908236+00:00"}