arXiv:2609.13564v1 Announce Type: new
Abstract: We study KL-regularized contextual bandits under both reward and preference feedback. We show that greedy sampling can achieve logarithmic regret witho...
By Zichen Wang, Haoyang Hong, Huazheng Wang
arXiv:2605. 09454v2 Announce Type: replace-cross Abstract: We study the $\textit{single-index bandit}$ problem, where rewards depend on an unknown one-dimensional projection of high-dimensional contexts through an unknown reward function.
By Devdan Dey, Sujoy Bhore, Avishek Ghosh
The paper introduces conservative contextual dueling bandits, which enforce that each displayed item’s cumulative score remains above a specified fraction of a trusted baseline’s score. It presents algorithms—MaxInP-BC for linear utilities and BTIGW-BC for general utilities—that guarantee safety with high probability while achieving sublinear regret. Experiments show these methods satisfy the safety constraint more reliably than unconstrained counterparts, with only a moderate increase in regret.
By Rohan Deb, Mohammad Ghavamzadeh, Arindam Banerjee
Contextual dueling bandits learn from pairwise comparisons, the same feedback used to fine-tune language models from human preferences. Standard algorithms explore aggressively and can show users two...
arXiv:2606. 28616v1 Announce Type: new Abstract: In stochastic linear bandits, the canonical Upper Confidence Bound (UCB) algorithm admits a simple frequentist regret analysis but can be computationally demanding, while Thompson Sampling (TS) is computationally attractive yet typically harder to analyze due to its non-optimistic nature.
By Toshinori Kitamura, Shuai Liu, Csaba Szepesv\'ari
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