1
Two-Action Apple Tasting with Switching Costs
在线学习中的"苹果品尝"问题引入切换成本，理论最优化边界突破经典难题。
arXiv:2606.03851v1 Announce Type: new Abstract: We study the two-action apple-tasting problem with switching costs against an oblivious adversary. In …
2
Queue Length Regret Bounds for Contextual Queueing Bandits
探索上下文排队老虎机中的队列长度后悔界限，为在线队列调度提供理论保证。
arXiv:2601.19300v2 Announce Type: replace Abstract: We introduce contextual queueing bandits, a new context-aware framework for scheduling while simul…