






















Abstract:In multi-armed bandits, the most-explored arms are the most informative, while reward maximization typically pulls only the best arm. We study the tradeoff between identifying arm means accurately and accumulating reward, and present an algorithm with regret guarantees that interpolates between the two objectives. We provide both upper and lower bounds and validate empirically.
| Comments: | Published at AISTATS 2017 (20th International Conference on Artificial Intelligence and Statistics) |
| Subjects: | Machine Learning (cs.LG) |
| Cite as: | arXiv:2605.00488 [cs.LG] |
| (or arXiv:2605.00488v1 [cs.LG] for this version) | |
| https://doi.org/10.48550/arXiv.2605.00488 arXiv-issued DOI via DataCite (pending registration) |
From: Michal Valko [view email]
[v1]
Fri, 1 May 2026 07:54:27 UTC (1,345 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。