Optimal Best Arm Identification in Two-Armed Bandits with a Fixed Budget under a Small Gap

 0 Người đánh giá. Xếp hạng trung bình 0

Tác giả: Kaito Ariu, Masaaki Imaizumi, Masahiro Kato, Masahiro Nomura, Chao Qin

Ngôn ngữ: eng

Ký hiệu phân loại: 359.82 Sea forces and warfare

Thông tin xuất bản: 2022

Mô tả vật lý:

Bộ sưu tập: Metadata

ID: 168551

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 using the Neyman allocation with an estimated standard deviation and the recommendation rule using an AIPW estimator. Our proposed strategy is optimal because the upper bound matches the lower bound when the budget goes to infinity and the gap goes to zero.
Tạo bộ sưu tập với mã QR

THƯ VIỆN - TRƯỜNG ĐẠI HỌC CÔNG NGHỆ TP.HCM

ĐT: (028) 36225755 | Email: tt.thuvien@hutech.edu.vn

Copyright @2024 THƯ VIỆN HUTECH