First worst-case regret bounds of Õ(m√(NT)) for CTS-G in sleeping semi-bandits with matching lower bound, plus CL-SG variant achieving Õ(√(mNT)) with matching lower bound.
Combinatorial Sleeping Bandits with Fairness Constraints
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Worst-Case Regret Bounds for Combinatorial Thompson Sampling in Sleeping Semi-Bandits
First worst-case regret bounds of Õ(m√(NT)) for CTS-G in sleeping semi-bandits with matching lower bound, plus CL-SG variant achieving Õ(√(mNT)) with matching lower bound.