paper-with-me

홈 › Papers

Asymptotically Optimal Fixed-Budget Best Arm Identification with Variance-Dependent Bounds

2023-02-06 · Masahiro Kato, Masaaki Imaizumi, Takuya Ishihara, Toru Kitagawa

We investigate the problem of fixed-budget best arm identification (BAI) for minimizing expected simple regret. In an adaptive experiment, a decision maker draws one of multiple treatment arms based on past observations and observes the outcome of the drawn arm. After the experiment, the decision maker recommends the treatment arm with the highest expected outcome. We evaluate the decision based on the expected simple regret, which is the difference between the expected outcomes of the best arm and the recommended arm. Due to inherent uncertainty, we evaluate the regret using the minimax criterion. First, we derive asymptotic lower bounds for the worst-case expected simple regret, which are characterized by the variances of potential outcomes (leading factor). Based on the lower bounds, we propose the Two-Stage (TS)-Hirano-Imbens-Ridder (HIR) strategy, which utilizes the HIR estimator (Hirano et al., 2003) in recommending the best arm. Our theoretical analysis shows that the TS-HIR strategy is asymptotically minimax optimal, meaning that the leading factor of its worst-case expected simple regret matches our derived worst-case lower bound. Additionally, we consider extensions of our method, such as the asymptotic optimality for the probability of misidentification. Finally, we validate the proposed method's effectiveness through simulations.

📄 PDF Abstract BibTeX arXiv:2302.02988

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Locally Optimal Fixed-Budget Best Arm Identification in Two-Armed Gaussian Bandits with Unknown Variances

2023-12-20 · Masahiro Kato

We address the problem of best arm identification (BAI) with a fixed budget for two-armed Gaussian bandits. In BAI, given multiple arms, we aim to find the best arm, an arm with the highest expected reward, through an ad…

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

2022-01-12 · Masahiro Kato, Kaito Ariu, Masaaki Imaizumi, Masahiro Nomura 외

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 matc…

Causal Inference

Generalized Neyman Allocation for Locally Minimax Optimal Best-Arm Identification

2024-05-29 · Masahiro Kato

This study investigates an asymptotically locally minimax optimal algorithm for fixed-budget best-arm identification (BAI). We propose the Generalized Neyman Allocation (GNA) algorithm and demonstrate that its worst-case…

Optimal Best-arm Identification in Linear Bandits

2020-06-29 · NeurIPS 2020 12 · Yassir Jedra, Alexandre Proutiere

We study the problem of best-arm identification with fixed confidence in stochastic linear bandits. The objective is to identify the best arm with a given level of certainty while minimizing the sampling budget. We devis…

Worst-Case Optimal Multi-Armed Gaussian Best Arm Identification with a Fixed Budget

2023-10-30 · Masahiro Kato

This study investigates the experimental design problem for identifying the arm with the highest expected outcome, referred to as best arm identification (BAI). In our experiments, the number of treatment-allocation roun…

Decision MakingExperimental Design