Bandits Corrupted by Nature: Lower Bounds on Regret and Robust Optimistic Algorithm.
Debabrota BasuOdalric-Ambrym MaillardTimothée MathieuPublished in: CoRR (2022)
Keyphrases
- lower bound
- computationally efficient
- worst case
- dynamic programming
- objective function
- segmentation algorithm
- learning algorithm
- theoretical analysis
- upper bound
- np hard
- optimal solution
- probabilistic model
- cost function
- search space
- computational complexity
- detection algorithm
- confidence bounds
- optimal cost
- average case
- k means
- similarity measure