AI RESEARCH
First Worst-Case Regret Bounds for Combinatorial Thompson Sampling in Sleeping Semi-Bandits
arXiv CS.LG
•
ArXi:2605.09277v1 Announce Type: new We revisit combinatorial Thompson sampling (CTS) for semi-bandits with sleeping arms, where arm availability varies over time and actions must satisfy combinatorial constraints, as in wireless mesh routing with fluctuating link availability.