Shubhada Agrawal, Timothée Mathieu, Debabrota Basu, Odalric-Ambrym Maillard. CRIMED: Lower and Upper Bounds on Regret for Bandits with Unbounded Stochastic Corruption. In Claire Vernade, Daniel Hsu 0001, editors, International Conference on Algorithmic Learning Theory, 25-28 February 2024, La Jolla, California, USA. Volume 237 of Proceedings of Machine Learning Research, pages 74-124, PMLR, 2024. [doi]
Abstract is missing.