Batch Ensemble for Variance Dependent Regret in Stochastic Bandits
<|reference_start|>Batch Ensemble for Variance Dependent Regret in Stochastic Bandits: Efficiently trading off exploration and exploitation is one of the key challenges in online Reinforcement Learning (RL). Most works achieve this by carefully estimating the model uncertainty and following the so-called optimistic model. Inspired by practical ensemble methods, in this work we propose a simple and novel batch ensemble scheme that provably achieves near-optimal regret for stochastic Multi-Armed Bandits (MAB). Crucially, our algorithm has just a single parameter, namely the number of batches, and its value does not depend on distributional properties such as the scale and variance of the losses. We complement our theoretical results by demonstrating the effectiveness of our algorithm on synthetic benchmarks.<|reference_end|>
@article{cassel2024batch,
    title={Batch Ensemble for Variance Dependent Regret in Stochastic Bandits},
    author={Asaf Cassel (1), Orin Levy (1), Yishay Mansour (1 and 2) ((1) School
  of Computer Science, Tel Aviv University, (2) Google Research, Tel Aviv)},
    journal={arXiv preprint arXiv:2409.08570},
    year={2024},
    archivePrefix={arXiv},
    eprint={2409.08570},
    primaryClass={cs.LG stat.ML}
}