Contexts can be Cheap: Solving Stochastic Contextual Bandits with Linear Bandit Algorithms.

Osama A. Hanna Lin Yang Christina Fragouli

Published in: COLT (2023)

Keyphrases

regret bounds
multi armed bandit
combinatorial optimization
computational complexity
learning algorithm
theoretical analysis
computationally efficient
benchmark datasets
orders of magnitude
convergence rate
computational cost
optimization problems
contextual information
linear models
continuous domains