AINeutralarXiv – CS AI · 14h ago6/10
🧠
The Sample Complexity of Multiclass and Sparse Contextual Bandits
Researchers present optimal algorithms for sparse contextual bandits that achieve sample complexity of Õ((s/ε² + |A|/ε)log|Π|/δ), closing a gap from prior work that had exponential dependence on action set size. The results apply to multiclass classification and combinatorial semi-bandits through information-theoretic and algorithmic approaches.