Almost Optimal Anytime Algorithm for Batched Multi-Armed BanditsDownload PDFOpen Website

2021 (modified: 28 Sept 2021)ICML 2021Readers: Everyone
Abstract: In batched multi-armed bandit problems, the learner can adaptively pull arms and adjust strategy in batches. In many real applications, not only the regret but also the batch complexity need to be ...
0 Replies

Loading