{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:GZYCQBNPHOSIFB3HODJQAPIRD3","short_pith_number":"pith:GZYCQBNP","schema_version":"1.0","canonical_sha256":"36702805af3ba482876770d3003d111ec7e74aed042f63daeb40238f614fab8d","source":{"kind":"arxiv","id":"1610.04491","version":1},"attestation_state":"computed","paper":{"title":"The End of Optimism? An Asymptotic Analysis of Finite-Armed Linear Bandits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Csaba Szepesvari, Tor Lattimore","submitted_at":"2016-10-14T14:58:44Z","abstract_excerpt":"Stochastic linear bandits are a natural and simple generalisation of finite-armed bandits with numerous practical applications. Current approaches focus on generalising existing techniques for finite-armed bandits, notably the optimism principle and Thompson sampling. While prior work has mostly been in the worst-case setting, we analyse the asymptotic instance-dependent regret and show matching upper and lower bounds on what is achievable. Surprisingly, our results show that no algorithm based on optimism or Thompson sampling will ever achieve the optimal rate, and indeed, can be arbitrarily "},"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":"1610.04491","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-10-14T14:58:44Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"9460132540928d3f17e42292f23df1bbbb09601c89014aaa5946c748606d9bda","abstract_canon_sha256":"fe00b84fe8c1b06e874e76a534e899594b2a637d884c3960895bdc79daab9994"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:02:15.026223Z","signature_b64":"tq6WnXYptXn9Mnh3eRzR7PId6JIzbnTE8UyZBy2yhSsMGxlwruw5MrIuNvAEnB5F0YAndzwRjLey5ykVtTlECQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"36702805af3ba482876770d3003d111ec7e74aed042f63daeb40238f614fab8d","last_reissued_at":"2026-05-18T01:02:15.025613Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:02:15.025613Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The End of Optimism? An Asymptotic Analysis of Finite-Armed Linear Bandits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Csaba Szepesvari, Tor Lattimore","submitted_at":"2016-10-14T14:58:44Z","abstract_excerpt":"Stochastic linear bandits are a natural and simple generalisation of finite-armed bandits with numerous practical applications. Current approaches focus on generalising existing techniques for finite-armed bandits, notably the optimism principle and Thompson sampling. While prior work has mostly been in the worst-case setting, we analyse the asymptotic instance-dependent regret and show matching upper and lower bounds on what is achievable. Surprisingly, our results show that no algorithm based on optimism or Thompson sampling will ever achieve the optimal rate, and indeed, can be arbitrarily "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.04491","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":"1610.04491","created_at":"2026-05-18T01:02:15.025699+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.04491v1","created_at":"2026-05-18T01:02:15.025699+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.04491","created_at":"2026-05-18T01:02:15.025699+00:00"},{"alias_kind":"pith_short_12","alias_value":"GZYCQBNPHOSI","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_16","alias_value":"GZYCQBNPHOSIFB3H","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_8","alias_value":"GZYCQBNP","created_at":"2026-05-18T12:30:19.053100+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1906.08399","citing_title":"Sequential Experimental Design for Transductive Linear Bandits","ref_index":23,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GZYCQBNPHOSIFB3HODJQAPIRD3","json":"https://pith.science/pith/GZYCQBNPHOSIFB3HODJQAPIRD3.json","graph_json":"https://pith.science/api/pith-number/GZYCQBNPHOSIFB3HODJQAPIRD3/graph.json","events_json":"https://pith.science/api/pith-number/GZYCQBNPHOSIFB3HODJQAPIRD3/events.json","paper":"https://pith.science/paper/GZYCQBNP"},"agent_actions":{"view_html":"https://pith.science/pith/GZYCQBNPHOSIFB3HODJQAPIRD3","download_json":"https://pith.science/pith/GZYCQBNPHOSIFB3HODJQAPIRD3.json","view_paper":"https://pith.science/paper/GZYCQBNP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.04491&json=true","fetch_graph":"https://pith.science/api/pith-number/GZYCQBNPHOSIFB3HODJQAPIRD3/graph.json","fetch_events":"https://pith.science/api/pith-number/GZYCQBNPHOSIFB3HODJQAPIRD3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GZYCQBNPHOSIFB3HODJQAPIRD3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GZYCQBNPHOSIFB3HODJQAPIRD3/action/storage_attestation","attest_author":"https://pith.science/pith/GZYCQBNPHOSIFB3HODJQAPIRD3/action/author_attestation","sign_citation":"https://pith.science/pith/GZYCQBNPHOSIFB3HODJQAPIRD3/action/citation_signature","submit_replication":"https://pith.science/pith/GZYCQBNPHOSIFB3HODJQAPIRD3/action/replication_record"}},"created_at":"2026-05-18T01:02:15.025699+00:00","updated_at":"2026-05-18T01:02:15.025699+00:00"}