Tight (Lower) Bounds for the Fixed Budget Best Arm Identification Bandit Problem.
Alexandra CarpentierAndrea LocatelliPublished in: COLT (2016)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- worst case
- branch and bound
- lower and upper bounds
- objective function
- optimal solution
- np hard
- regret bounds
- lower bounding
- automatic identification
- random sampling
- multi agent
- neural network
- linear programming relaxation
- quadratic assignment problem
- multi armed bandit problems
- vc dimension
- machine learning