Lipschitz Bandits: Regret Lower Bounds and Optimal Algorithms.
Stefan MagureanuRichard CombesAlexandre ProutièrePublished in: CoRR (2014)
Keyphrases
- lower bound
- regret bounds
- worst case
- upper bound
- multi armed bandit
- online algorithms
- upper and lower bounds
- average case
- optimal solution
- data structure
- branch and bound algorithm
- lower and upper bounds
- objective function
- regret minimization
- optimal cost
- expert advice
- branch and bound
- optimization problems
- computational complexity
- expected cost
- approximation algorithms
- constant factor
- error bounds
- min sum
- learning algorithm