Bandits with Probing: Optimal Coverage and the Role of Feedback

2026-10-26来源 arXiv stat.MLEnglish
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. For independent arms with i.i.d. rewards in $[0,1]$ and $2\le k

原文：https://www.a8q9.cn/en/article/bandits-with-probing-optimal-coverage-and-the-role-of-feedback-d752df.html

相关文章