Bypassing the Monster: A Faster and Simpler Optimal Algorithm for Contextual Bandits under Realizability.
David Simchi-LeviYunzong XuPublished in: CoRR (2020)
Keyphrases
- optimal solution
- dynamic programming
- detection algorithm
- learning algorithm
- preprocessing
- computational cost
- computational complexity
- theoretical analysis
- cost function
- np hard
- experimental evaluation
- worst case
- significant improvement
- globally optimal
- improved algorithm
- simulated annealing
- segmentation algorithm
- optimization algorithm
- matching algorithm
- closed form
- computationally demanding
- convex hull
- highly efficient
- high accuracy
- state space
- search space
- data structure
- image segmentation