The Max $K$-Armed Bandit: PAC Lower Bounds and Efficient Algorithms.
Yahel DavidNahum ShimkinPublished in: CoRR (2015)
Keyphrases
- lower bound
- upper bound
- vc dimension
- sample complexity
- concept class
- statistical queries
- branch and bound
- branch and bound algorithm
- pac learning
- worst case
- sample size
- np hard
- concept classes
- upper and lower bounds
- max sat
- optimal solution
- objective function
- lower and upper bounds
- online algorithms
- inductive inference
- data sets
- generalization error
- linear programming relaxation
- concept learning
- learning theory
- active learning
- noise tolerant
- lower bounding
- mistake bound