{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:AI35YAETXJEEYJ2D7IXR6XJIQ2","short_pith_number":"pith:AI35YAET","schema_version":"1.0","canonical_sha256":"0237dc0093ba484c2743fa2f1f5d288689e6d196d68948c3b4a17031daf7899e","source":{"kind":"arxiv","id":"2406.04137","version":1},"attestation_state":"computed","paper":{"title":"Optimal Batched Linear Bandits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.ML","stat.TH"],"primary_cat":"cs.LG","authors_text":"Pan Xu, Tianyuan Jin, Xuanfei Ren","submitted_at":"2024-06-06T14:57:52Z","abstract_excerpt":"We introduce the E$^4$ algorithm for the batched linear bandit problem, incorporating an Explore-Estimate-Eliminate-Exploit framework. With a proper choice of exploration rate, we prove E$^4$ achieves the finite-time minimax optimal regret with only $O(\\log\\log T)$ batches, and the asymptotically optimal regret with only $3$ batches as $T\\rightarrow\\infty$, where $T$ is the time horizon. We further prove a lower bound on the batch complexity of linear contextual bandits showing that any asymptotically optimal algorithm must require at least $3$ batches in expectation as $T\\rightarrow\\infty$, w"},"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":"2406.04137","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-06-06T14:57:52Z","cross_cats_sorted":["math.ST","stat.ML","stat.TH"],"title_canon_sha256":"7b2b06f002ea78774e82cdde326202538cfd65705c8d556aef95069a13e789eb","abstract_canon_sha256":"d16d720df7ffa9e8796eaada044b417d7154e52daaabdefc7c1a94f203692708"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:28:21.210119Z","signature_b64":"ns+jCgaIL9Z2I7MbGox56bTh3VRXdw8f5DMPk93CHqW9MLra5WDyc1U6LY5lwqV5L6C7NfLzHfqlLjzy07dJBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0237dc0093ba484c2743fa2f1f5d288689e6d196d68948c3b4a17031daf7899e","last_reissued_at":"2026-07-05T08:28:21.209660Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:28:21.209660Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Batched Linear Bandits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.ML","stat.TH"],"primary_cat":"cs.LG","authors_text":"Pan Xu, Tianyuan Jin, Xuanfei Ren","submitted_at":"2024-06-06T14:57:52Z","abstract_excerpt":"We introduce the E$^4$ algorithm for the batched linear bandit problem, incorporating an Explore-Estimate-Eliminate-Exploit framework. With a proper choice of exploration rate, we prove E$^4$ achieves the finite-time minimax optimal regret with only $O(\\log\\log T)$ batches, and the asymptotically optimal regret with only $3$ batches as $T\\rightarrow\\infty$, where $T$ is the time horizon. We further prove a lower bound on the batch complexity of linear contextual bandits showing that any asymptotically optimal algorithm must require at least $3$ batches in expectation as $T\\rightarrow\\infty$, w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.04137","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2406.04137/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":"2406.04137","created_at":"2026-07-05T08:28:21.209718+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.04137v1","created_at":"2026-07-05T08:28:21.209718+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.04137","created_at":"2026-07-05T08:28:21.209718+00:00"},{"alias_kind":"pith_short_12","alias_value":"AI35YAETXJEE","created_at":"2026-07-05T08:28:21.209718+00:00"},{"alias_kind":"pith_short_16","alias_value":"AI35YAETXJEEYJ2D","created_at":"2026-07-05T08:28:21.209718+00:00"},{"alias_kind":"pith_short_8","alias_value":"AI35YAET","created_at":"2026-07-05T08:28:21.209718+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/AI35YAETXJEEYJ2D7IXR6XJIQ2","json":"https://pith.science/pith/AI35YAETXJEEYJ2D7IXR6XJIQ2.json","graph_json":"https://pith.science/api/pith-number/AI35YAETXJEEYJ2D7IXR6XJIQ2/graph.json","events_json":"https://pith.science/api/pith-number/AI35YAETXJEEYJ2D7IXR6XJIQ2/events.json","paper":"https://pith.science/paper/AI35YAET"},"agent_actions":{"view_html":"https://pith.science/pith/AI35YAETXJEEYJ2D7IXR6XJIQ2","download_json":"https://pith.science/pith/AI35YAETXJEEYJ2D7IXR6XJIQ2.json","view_paper":"https://pith.science/paper/AI35YAET","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.04137&json=true","fetch_graph":"https://pith.science/api/pith-number/AI35YAETXJEEYJ2D7IXR6XJIQ2/graph.json","fetch_events":"https://pith.science/api/pith-number/AI35YAETXJEEYJ2D7IXR6XJIQ2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AI35YAETXJEEYJ2D7IXR6XJIQ2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AI35YAETXJEEYJ2D7IXR6XJIQ2/action/storage_attestation","attest_author":"https://pith.science/pith/AI35YAETXJEEYJ2D7IXR6XJIQ2/action/author_attestation","sign_citation":"https://pith.science/pith/AI35YAETXJEEYJ2D7IXR6XJIQ2/action/citation_signature","submit_replication":"https://pith.science/pith/AI35YAETXJEEYJ2D7IXR6XJIQ2/action/replication_record"}},"created_at":"2026-07-05T08:28:21.209718+00:00","updated_at":"2026-07-05T08:28:21.209718+00:00"}