SAT-CTS delivers the first finite-time regret bounds for combinatorial semi-bandits with satisficing objectives, bounding satisficing regret by a constant when the threshold is realizable and yielding O((log T)^2) standard regret otherwise.
Satisficing with binary feedback: Multi-user mmwave beam and rate adaptation via combinatorial bandits,
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
-
Multi-User mmWave Beam and Rate Adaptation via Combinatorial Satisficing Bandits
SAT-CTS delivers the first finite-time regret bounds for combinatorial semi-bandits with satisficing objectives, bounding satisficing regret by a constant when the threshold is realizable and yielding O((log T)^2) standard regret otherwise.