Feb. 21, 2024, 5:43 a.m. | Po-An Wang, Ruo-Chun Tzeng, Alexandre Proutiere

cs.LG updates on arXiv.org arxiv.org

arXiv:2312.12137v2 Announce Type: replace
Abstract: We consider the problem of identifying the best arm in stochastic Multi-Armed Bandits (MABs) using a fixed sampling budget. Characterizing the minimal instance-specific error probability for this problem constitutes one of the important remaining open problems in MABs. When arms are selected using a static sampling strategy, the error probability decays exponentially with the number of samples at a rate that can be explicitly derived via Large Deviation techniques. Analyzing the performance of algorithms with …

abstract arm arxiv budget cs.lg deviation error identification instance multi-armed bandits perspective probability sampling stat.ml stochastic type

Founding AI Engineer, Agents

@ Occam AI | New York

AI Engineer Intern, Agents

@ Occam AI | US

AI Research Scientist

@ Vara | Berlin, Germany and Remote

Data Architect

@ University of Texas at Austin | Austin, TX

Data ETL Engineer

@ University of Texas at Austin | Austin, TX

Machine Learning Research Scientist

@ d-Matrix | San Diego, Ca