Bypassing the Monster: A Faster and Simpler Optimal Algorithm for Contextual Bandits Under Realizability.
David Simchi-LeviYunzong XuPublished in: Math. Oper. Res. (2022)
Keyphrases
- dynamic programming
- experimental evaluation
- times faster
- worst case
- np hard
- detection algorithm
- improved algorithm
- learning algorithm
- preprocessing
- computational complexity
- globally optimal
- optimal solution
- objective function
- cost function
- exhaustive search
- closed form
- ant colony optimization
- optimal parameters
- optimization algorithm
- contextual information
- particle swarm optimization
- linear programming
- computational cost
- k means
- segmentation algorithm
- clustering method
- theoretical analysis
- recognition algorithm
- high accuracy
- space complexity