Model selection for contextual bandits
This addresses the challenge of selecting the right model complexity in contextual bandits, a key issue in online learning with partial information, and is the first non-vacuous result of its type for this setting.
The paper tackles the problem of model selection for contextual bandits, where a learner must adapt to the complexity of the optimal policy without prior knowledge of its dimension, and achieves regret bounds of $ ilde{O}(T^{2/3}d^{1/3}_{m^\star})$ and $ ilde{O}(T^{3/4} + \sqrt{Td_{m^\star}})$, which are optimal in certain regimes.
We introduce the problem of model selection for contextual bandits, where a learner must adapt to the complexity of the optimal policy while balancing exploration and exploitation. Our main result is a new model selection guarantee for linear contextual bandits. We work in the stochastic realizable setting with a sequence of nested linear policy classes of dimension $d_1 < d_2 < \ldots$, where the $m^\star$-th class contains the optimal policy, and we design an algorithm that achieves $\tilde{O}(T^{2/3}d^{1/3}_{m^\star})$ regret with no prior knowledge of the optimal dimension $d_{m^\star}$. The algorithm also achieves regret $\tilde{O}(T^{3/4} + \sqrt{Td_{m^\star}})$, which is optimal for $d_{m^{\star}}\geq{}\sqrt{T}$. This is the first model selection result for contextual bandits with non-vacuous regret for all values of $d_{m^\star}$, and to the best of our knowledge is the first positive result of this type for any online learning setting with partial information. The core of the algorithm is a new estimator for the gap in the best loss achievable by two linear policy classes, which we show admits a convergence rate faster than the rate required to learn the parameters for either class.