Algorithm for Contextual Queueing Bandits with Rate-Optimal Queue Length Regret
arXiv:2606.09668v1 Announce Type: new Abstract: Contextual queueing bandits provide a framework for learning to schedule heterogeneous jobs under unknown context-dependent service rates. Under stochas