Unimodal Bandits: Regret Lower Bounds and Optimal Algorithms.
Richard CombesAlexandre ProutièrePublished in: ICML (2014)
Keyphrases
- lower bound
- regret bounds
- worst case
- upper bound
- multi armed bandit
- online algorithms
- learning algorithm
- running times
- computationally efficient
- branch and bound
- vc dimension
- branch and bound algorithm
- average case
- lower and upper bounds
- exhaustive search
- learning theory
- error bounds
- optimization problems
- data structure
- objective function