Tight (Lower) Bounds for the Fixed Budget Best Arm Identification Bandit Problem.

Alexandra Carpentier Andrea Locatelli

Published in: CoRR (2016)

Keyphrases

lower bound
upper bound
branch and bound algorithm
branch and bound
worst case
lower and upper bounds
lower bounding

regret bounds
np hard
objective function
automatic identification
optimal solution
set of randomly generated instances
linear programming relaxation

optimal cost
upper and lower bounds
data sets
vc dimension
real time
average case
sample complexity

fixed number
concept class
quadratic assignment problem
maximum likelihood
search algorithm
genetic algorithm
randomly generated problems