{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:BPB4IZED344VDIETDSMDICDX54","short_pith_number":"pith:BPB4IZED","schema_version":"1.0","canonical_sha256":"0bc3c46483df3951a0931c98340877ef2b4e3f98c9e5092776d94048ff221e3b","source":{"kind":"arxiv","id":"1601.01190","version":3},"attestation_state":"computed","paper":{"title":"On Bayesian index policies for sequential resource allocation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"CNRS, CRIStAL), Emilie Kaufmann (SEQUEL","submitted_at":"2016-01-06T14:24:59Z","abstract_excerpt":"This paper is about index policies for minimizing (frequentist) regret in a stochastic multi-armed bandit model, inspired by a Bayesian view on the problem. Our main contribution is to prove that the Bayes-UCB algorithm, which relies on quantiles of posterior distributions, is asymptotically optimal when the reward distributions belong to a one-dimensional exponential family, for a large class of prior distributions. We also show that the Bayesian literature gives new insight on what kind of exploration rates could be used in frequentist, UCB-type algorithms. Indeed, approximations of the Baye"},"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":"1601.01190","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-01-06T14:24:59Z","cross_cats_sorted":[],"title_canon_sha256":"b1c81a3539de46ab7181ac09d5c137ff26c57aa12362bd601f526702b06f649e","abstract_canon_sha256":"da1c80b544c270792a2c5a30f0e8022382cbd5421d81f7bc3db9faa9d98bcc71"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:22.727166Z","signature_b64":"Q4gObz/LPwrmSyfYZm6G7j5xQ2OYfyTJewqrhujE5wWpjspdX94Pe4+sVHqLZflK/+ScJCSkgE2ZOcrjvPqCAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0bc3c46483df3951a0931c98340877ef2b4e3f98c9e5092776d94048ff221e3b","last_reissued_at":"2026-05-18T00:31:22.726653Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:22.726653Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Bayesian index policies for sequential resource allocation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"CNRS, CRIStAL), Emilie Kaufmann (SEQUEL","submitted_at":"2016-01-06T14:24:59Z","abstract_excerpt":"This paper is about index policies for minimizing (frequentist) regret in a stochastic multi-armed bandit model, inspired by a Bayesian view on the problem. Our main contribution is to prove that the Bayes-UCB algorithm, which relies on quantiles of posterior distributions, is asymptotically optimal when the reward distributions belong to a one-dimensional exponential family, for a large class of prior distributions. We also show that the Bayesian literature gives new insight on what kind of exploration rates could be used in frequentist, UCB-type algorithms. Indeed, approximations of the Baye"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.01190","kind":"arxiv","version":3},"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":"1601.01190","created_at":"2026-05-18T00:31:22.726737+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.01190v3","created_at":"2026-05-18T00:31:22.726737+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.01190","created_at":"2026-05-18T00:31:22.726737+00:00"},{"alias_kind":"pith_short_12","alias_value":"BPB4IZED344V","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_16","alias_value":"BPB4IZED344VDIET","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_8","alias_value":"BPB4IZED","created_at":"2026-05-18T12:30:07.202191+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/BPB4IZED344VDIETDSMDICDX54","json":"https://pith.science/pith/BPB4IZED344VDIETDSMDICDX54.json","graph_json":"https://pith.science/api/pith-number/BPB4IZED344VDIETDSMDICDX54/graph.json","events_json":"https://pith.science/api/pith-number/BPB4IZED344VDIETDSMDICDX54/events.json","paper":"https://pith.science/paper/BPB4IZED"},"agent_actions":{"view_html":"https://pith.science/pith/BPB4IZED344VDIETDSMDICDX54","download_json":"https://pith.science/pith/BPB4IZED344VDIETDSMDICDX54.json","view_paper":"https://pith.science/paper/BPB4IZED","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.01190&json=true","fetch_graph":"https://pith.science/api/pith-number/BPB4IZED344VDIETDSMDICDX54/graph.json","fetch_events":"https://pith.science/api/pith-number/BPB4IZED344VDIETDSMDICDX54/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BPB4IZED344VDIETDSMDICDX54/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BPB4IZED344VDIETDSMDICDX54/action/storage_attestation","attest_author":"https://pith.science/pith/BPB4IZED344VDIETDSMDICDX54/action/author_attestation","sign_citation":"https://pith.science/pith/BPB4IZED344VDIETDSMDICDX54/action/citation_signature","submit_replication":"https://pith.science/pith/BPB4IZED344VDIETDSMDICDX54/action/replication_record"}},"created_at":"2026-05-18T00:31:22.726737+00:00","updated_at":"2026-05-18T00:31:22.726737+00:00"}