Information Complexity in Bandit Subset Selection

Emilie Kaufmann, Shivaram Kalyanakrishnan

Abstract: We consider the problem of efficiently exploring the arms of a stochastic bandit to identify the best subset. Under the PAC and the fixed-budget formulations, we derive improved bounds by using KL-...