← Back to all news
arXiv Statistics ML By Yongjie Guan

Bandits with Probing: Optimal Coverage and the Role of Feedback

Read the original on arXiv Statistics ML →

arXiv:2609. 15248v2 Announce Type: replace-cross Abstract: In bandits with probing, a learner selects at most $k$ of $n$ arms per round, earns the largest of their rewards, and competes with the best fixed single arm.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Statistics ML.

Related stories

arXiv Machine Learning
6d ago

The Price of Current-Effect Inference in Nonstationary Multi-Armed Bandits

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
reinforcement-learning
More like this →
arXiv AI
Oct 2

Bandits with Multiple Optimal Arms: Minimax Regret and Non-Adaptivity

The paper investigates multi‑armed bandits where several arms are optimal. It refines previous sub‑sampling algorithms to achieve a minimax regret of τO((K−A)/√(KA)·√T), improving on earlier bounds. A matching lower bound is provided, showing the rate is nearly optimal, and the authors demonstrate that knowing the number of optimal arms A (within constant factors) is essential for near‑optimal performance.

By Kaixuan Ji, Qiwei Di, Qingyue Zhao, Heyang Zhao, Quanquan Gu
More like this →