Refined Lower Bounds for Adversarial Bandits.
Sébastien GerchinovitzTor LattimorePublished in: CoRR (2016)
Keyphrases
- lower bound
- upper bound
- regret bounds
- branch and bound
- branch and bound algorithm
- multi agent
- objective function
- np hard
- quadratic assignment problem
- worst case
- lower bounding
- stochastic systems
- vc dimension
- lower and upper bounds
- upper and lower bounds
- optimal solution
- data sets
- linear programming relaxation
- set of randomly generated instances
- optimal cost
- multi armed bandits
- refinement process
- integer programming
- concept class
- linear regression
- linear programming
- scheduling problem
- genetic algorithm