arXiv:2606. 27448v1 Announce Type: new Abstract: This paper studies the problem of regret minimization in Markovian bandits with \emph{non-observable states} and possibly \emph{constrained} decision epochs.
By Thomas Hira, Victor Boone, Urtzi Ayesta, Ina Maria Verloop
arXiv:2608. 15996v1 Announce Type: new Abstract: We study second-order path-length regret in adversarial $K$-armed bandits against oblivious loss sequences.
By Mengxiao Zhang
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.
By Seoungbin Bae, Dabeen Lee
arXiv:2510. 22819v3 Announce Type: replace Abstract: The convergence analysis of online learning algorithms is central to machine learning theory, where the last-iterate convergence is particularly important, as it captures the learner's actual decisions and describes the evolution of the learning process over time.
By Jingxin Zhan, Yuze Han, Zhihua Zhang
arXiv:2609.13547v1 Announce Type: new
Abstract: We study switching regret in adversarial multi-armed bandits, where the learner competes with an arm sequence that changes at most $S$ times. When $S$...
By Mengxiao Zhang
arXiv:2608. 17841v1 Announce Type: cross Abstract: Multi-armed bandit algorithms are evaluated by regret, yet comparable regret can coexist with different allocations across independent runs.
By Kaifei Wang, Yinyu Ye, Han Zhong
arXiv:2508. 05844v3 Announce Type: replace-cross Abstract: We study a stochastic budget-allocation problem over $K$ tasks.
By Fran\c{c}ois Bachoc, Nicol\`o Cesa-Bianchi, Tommaso Cesari, Roberto Colomboni
The paper studies the trade‑off between maximizing rewards and accurately estimating current treatment effects in nonstationary multi‑armed bandits. For $K$‑armed bandits with H"older‑smooth mean rewards, the authors derive minimax bounds on expected dynamic regret under a high‑probability simultaneous coverage requirement for all current effects. They propose the TRACE algorithm, which achieves a regret–precision trade‑off that separates reward‑learning regret from the unavoidable cost of refreshing current‑effect estimates, and extend the method with an empirical‑Bernstein e‑process to adapt exploration while preserving worst‑case guarantees.
By Sharan Sahu, Martin T. Wells
Multi-armed bandit algorithms are evaluated by regret, yet comparable regret can coexist with different allocations across independent runs. We study the trade-off between worst-case regret $\mathcal{R}_{K,T}$ and instability $\mathcal S_{K,T}$, defined as the largest standard deviation of a terminal pull count, for $K$ arms and $T$ rounds.
The paper introduces Persistent Candidate LinUCB (PC‑LinUCB), a variant of the LinUCB algorithm for linear bandits that reduces per‑round score evaluations from ≥×K to ≥×(k+q) by maintaining a small set of active actions and sampling challengers from the remaining actions. It provides high‑probability regret bounds that include a standard learning term and an additive discovery cost of order ≥×((K-k)×log(K-k))/q, which does not grow with the horizon. Experiments demonstrate that PC‑LinUCB accelerates LinUCB while keeping regret comparable, and the persistent candidate approach can be applied beyond LinUCB.
By Bingkui Tong, Daria Korovaitceva, Marina Sheshukova, Sergey Samsonov, Junpei Komiyama
arXiv:2608.24731v1 Announce Type: new
Abstract: We settle the minimax-optimal alternating regret, a regret notion motivated by alternating learning dynamics in games, for both online linear optimizat...
By Yixin Tao, Weiqiang Zheng
arXiv:2608. 09450v1 Announce Type: new Abstract: Betting-based sequential tests and Blackwell approachability are linked by a rate-explicit reduction through support-function residuals.
By Jinze Zhao