{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:Q5RE6UNG3LIX7KX4NN2TNG5H3A","short_pith_number":"pith:Q5RE6UNG","schema_version":"1.0","canonical_sha256":"87624f51a6dad17faafc6b75369ba7d80405bbe5e4f4a96359474a65aa20feca","source":{"kind":"arxiv","id":"1606.00313","version":1},"attestation_state":"computed","paper":{"title":"Improved Regret Bounds for Oracle-Based Adversarial Contextual Bandits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Akshay Krishnamurthy, Haipeng Luo, Robert E. Schapire, Vasilis Syrgkanis","submitted_at":"2016-06-01T14:47:19Z","abstract_excerpt":"We give an oracle-based algorithm for the adversarial contextual bandit problem, where either contexts are drawn i.i.d. or the sequence of contexts is known a priori, but where the losses are picked adversarially. Our algorithm is computationally efficient, assuming access to an offline optimization oracle, and enjoys a regret of order $O((KT)^{\\frac{2}{3}}(\\log N)^{\\frac{1}{3}})$, where $K$ is the number of actions, $T$ is the number of iterations and $N$ is the number of baseline policies. Our result is the first to break the $O(T^{\\frac{3}{4}})$ barrier that is achieved by recently introduc"},"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":"1606.00313","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-06-01T14:47:19Z","cross_cats_sorted":[],"title_canon_sha256":"dfd75e938f59117fbd44635befef00ea2dc9fce009bb0fad1370b3e4f5ba3473","abstract_canon_sha256":"b0461318662200853d326803f8f9a171f4747a62bd731df5846d8228c33a617e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:05.540856Z","signature_b64":"ZgF+acvT+udyrkfJONxBi2oIeNAeoIX4aD5MywchzTO/Tk++2sv2hPH9MauW2e6gDt0rGoVWiqzM4ameyoylDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"87624f51a6dad17faafc6b75369ba7d80405bbe5e4f4a96359474a65aa20feca","last_reissued_at":"2026-05-18T01:13:05.540447Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:05.540447Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved Regret Bounds for Oracle-Based Adversarial Contextual Bandits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Akshay Krishnamurthy, Haipeng Luo, Robert E. Schapire, Vasilis Syrgkanis","submitted_at":"2016-06-01T14:47:19Z","abstract_excerpt":"We give an oracle-based algorithm for the adversarial contextual bandit problem, where either contexts are drawn i.i.d. or the sequence of contexts is known a priori, but where the losses are picked adversarially. Our algorithm is computationally efficient, assuming access to an offline optimization oracle, and enjoys a regret of order $O((KT)^{\\frac{2}{3}}(\\log N)^{\\frac{1}{3}})$, where $K$ is the number of actions, $T$ is the number of iterations and $N$ is the number of baseline policies. Our result is the first to break the $O(T^{\\frac{3}{4}})$ barrier that is achieved by recently introduc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.00313","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":"1606.00313","created_at":"2026-05-18T01:13:05.540508+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.00313v1","created_at":"2026-05-18T01:13:05.540508+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.00313","created_at":"2026-05-18T01:13:05.540508+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q5RE6UNG3LIX","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q5RE6UNG3LIX7KX4","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q5RE6UNG","created_at":"2026-05-18T12:30:39.010887+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/Q5RE6UNG3LIX7KX4NN2TNG5H3A","json":"https://pith.science/pith/Q5RE6UNG3LIX7KX4NN2TNG5H3A.json","graph_json":"https://pith.science/api/pith-number/Q5RE6UNG3LIX7KX4NN2TNG5H3A/graph.json","events_json":"https://pith.science/api/pith-number/Q5RE6UNG3LIX7KX4NN2TNG5H3A/events.json","paper":"https://pith.science/paper/Q5RE6UNG"},"agent_actions":{"view_html":"https://pith.science/pith/Q5RE6UNG3LIX7KX4NN2TNG5H3A","download_json":"https://pith.science/pith/Q5RE6UNG3LIX7KX4NN2TNG5H3A.json","view_paper":"https://pith.science/paper/Q5RE6UNG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.00313&json=true","fetch_graph":"https://pith.science/api/pith-number/Q5RE6UNG3LIX7KX4NN2TNG5H3A/graph.json","fetch_events":"https://pith.science/api/pith-number/Q5RE6UNG3LIX7KX4NN2TNG5H3A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q5RE6UNG3LIX7KX4NN2TNG5H3A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q5RE6UNG3LIX7KX4NN2TNG5H3A/action/storage_attestation","attest_author":"https://pith.science/pith/Q5RE6UNG3LIX7KX4NN2TNG5H3A/action/author_attestation","sign_citation":"https://pith.science/pith/Q5RE6UNG3LIX7KX4NN2TNG5H3A/action/citation_signature","submit_replication":"https://pith.science/pith/Q5RE6UNG3LIX7KX4NN2TNG5H3A/action/replication_record"}},"created_at":"2026-05-18T01:13:05.540508+00:00","updated_at":"2026-05-18T01:13:05.540508+00:00"}