{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:RGNC6TYMAH652OK3NE36OSZVX6","short_pith_number":"pith:RGNC6TYM","schema_version":"1.0","canonical_sha256":"899a2f4f0c01fddd395b6937e74b35bfbda48b8b894742f4aadf6964fa39b369","source":{"kind":"arxiv","id":"2201.04469","version":8},"attestation_state":"computed","paper":{"title":"Optimal Best Arm Identification in Two-Armed Bandits with a Fixed Budget under a Small Gap","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","econ.EM","math.ST","stat.TH"],"primary_cat":"stat.ML","authors_text":"Chao Qin, Kaito Ariu, Masaaki Imaizumi, Masahiro Kato, Masahiro Nomura","submitted_at":"2022-01-12T13:38:33Z","abstract_excerpt":"We consider fixed-budget best-arm identification in two-armed Gaussian bandit problems. One of the longstanding open questions is the existence of an optimal strategy under which the probability of misidentification matches a lower bound. We show that a strategy following the Neyman allocation rule (Neyman, 1934) is asymptotically optimal when the gap between the expected rewards is small. First, we review a lower bound derived by Kaufmann et al. (2016). Then, we propose the \"Neyman Allocation (NA)-Augmented Inverse Probability weighting (AIPW)\" strategy, which consists of the sampling rule us"},"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":"2201.04469","kind":"arxiv","version":8},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2022-01-12T13:38:33Z","cross_cats_sorted":["cs.LG","econ.EM","math.ST","stat.TH"],"title_canon_sha256":"61e6f218e24dcf5907ce363af2ee6ef56d4256ea4f8e1be62fd2ccb363e3a118","abstract_canon_sha256":"afc8777b95348b9690e98d1fad4438f92e4068293e8b068ea08b5f745abbe2ff"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:29:00.492742Z","signature_b64":"WLa/Lgux9jZE0Ltx4/WjhJIYMVoT/VygOz/LndEiy7LtqAWCFQZ7uBz2UYQ6jlcroTbV4SiLDx7HlBPKKptnBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"899a2f4f0c01fddd395b6937e74b35bfbda48b8b894742f4aadf6964fa39b369","last_reissued_at":"2026-07-05T05:29:00.492379Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:29:00.492379Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Best Arm Identification in Two-Armed Bandits with a Fixed Budget under a Small Gap","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","econ.EM","math.ST","stat.TH"],"primary_cat":"stat.ML","authors_text":"Chao Qin, Kaito Ariu, Masaaki Imaizumi, Masahiro Kato, Masahiro Nomura","submitted_at":"2022-01-12T13:38:33Z","abstract_excerpt":"We consider fixed-budget best-arm identification in two-armed Gaussian bandit problems. One of the longstanding open questions is the existence of an optimal strategy under which the probability of misidentification matches a lower bound. We show that a strategy following the Neyman allocation rule (Neyman, 1934) is asymptotically optimal when the gap between the expected rewards is small. First, we review a lower bound derived by Kaufmann et al. (2016). Then, we propose the \"Neyman Allocation (NA)-Augmented Inverse Probability weighting (AIPW)\" strategy, which consists of the sampling rule us"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.04469","kind":"arxiv","version":8},"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/2201.04469/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":"2201.04469","created_at":"2026-07-05T05:29:00.492430+00:00"},{"alias_kind":"arxiv_version","alias_value":"2201.04469v8","created_at":"2026-07-05T05:29:00.492430+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.04469","created_at":"2026-07-05T05:29:00.492430+00:00"},{"alias_kind":"pith_short_12","alias_value":"RGNC6TYMAH65","created_at":"2026-07-05T05:29:00.492430+00:00"},{"alias_kind":"pith_short_16","alias_value":"RGNC6TYMAH652OK3","created_at":"2026-07-05T05:29:00.492430+00:00"},{"alias_kind":"pith_short_8","alias_value":"RGNC6TYM","created_at":"2026-07-05T05:29:00.492430+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/RGNC6TYMAH652OK3NE36OSZVX6","json":"https://pith.science/pith/RGNC6TYMAH652OK3NE36OSZVX6.json","graph_json":"https://pith.science/api/pith-number/RGNC6TYMAH652OK3NE36OSZVX6/graph.json","events_json":"https://pith.science/api/pith-number/RGNC6TYMAH652OK3NE36OSZVX6/events.json","paper":"https://pith.science/paper/RGNC6TYM"},"agent_actions":{"view_html":"https://pith.science/pith/RGNC6TYMAH652OK3NE36OSZVX6","download_json":"https://pith.science/pith/RGNC6TYMAH652OK3NE36OSZVX6.json","view_paper":"https://pith.science/paper/RGNC6TYM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2201.04469&json=true","fetch_graph":"https://pith.science/api/pith-number/RGNC6TYMAH652OK3NE36OSZVX6/graph.json","fetch_events":"https://pith.science/api/pith-number/RGNC6TYMAH652OK3NE36OSZVX6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RGNC6TYMAH652OK3NE36OSZVX6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RGNC6TYMAH652OK3NE36OSZVX6/action/storage_attestation","attest_author":"https://pith.science/pith/RGNC6TYMAH652OK3NE36OSZVX6/action/author_attestation","sign_citation":"https://pith.science/pith/RGNC6TYMAH652OK3NE36OSZVX6/action/citation_signature","submit_replication":"https://pith.science/pith/RGNC6TYMAH652OK3NE36OSZVX6/action/replication_record"}},"created_at":"2026-07-05T05:29:00.492430+00:00","updated_at":"2026-07-05T05:29:00.492430+00:00"}