arXiv stat.ML
· Papers
Oracle-Efficient Combinatorial Semi-Bandits
arXiv:2510.21431v2 Announce Type: replace Abstract: We study the combinatorial semi-bandit problem where an agent selects a subset of base arms and receives individual feedback. While this generalizes the classical multi-armed bandit and has broad applicability, its scalability is limited by the high cost of combinator