Jan. 13, 2022, 2:10 a.m. | Masahiro Kato, Kaito Ariu, Masaaki Imaizumi, Masatoshi Uehara, Masahiro Nomura, and Chao Qin

cs.LG updates on arXiv.org arxiv.org

We consider the fixed-budget best arm identification problem in two-armed
Gaussian bandits with unknown variances. The tightest lower bound on the
complexity and an algorithm whose performance guarantee matches the lower bound
have long been open problems when the variances are unknown and when the
algorithm is agnostic to the optimal proportion of the arm draws. In this
paper, we propose a strategy comprising a sampling rule with randomized
sampling (RS) following the estimated target allocation probabilities of arm
draws …

arm arxiv budget identification ml probability

Senior Machine Learning Engineer (MLOps)

@ Promaton | Remote, Europe

Data Analyst

@ SEAKR Engineering | Englewood, CO, United States

Data Analyst II

@ Postman | Bengaluru, India

Data Architect

@ FORSEVEN | Warwick, GB

Director, Data Science

@ Visa | Washington, DC, United States

Senior Manager, Data Science - Emerging ML

@ Capital One | McLean, VA