An optimal algorithm for the thresholding bandit problem A Locatelli, M Gutzeit, A Carpentier ICML 2016, 2016 | 175 | 2016 |
Tight (lower) bounds for the fixed budget best arm identification bandit problem A Carpentier, A Locatelli Conference on Learning Theory, 590-604, 2016 | 162 | 2016 |
Adaptivity to smoothness in x-armed bandits A Locatelli, A Carpentier Conference on Learning Theory, 1463-1492, 2018 | 75 | 2018 |
Rotting bandits are no harder than stochastic ones J Seznec, A Locatelli, A Carpentier, A Lazaric, M Valko The 22nd International Conference on Artificial Intelligence and Statistics …, 2019 | 69 | 2019 |
Adaptivity to noise parameters in nonparametric active learning A Locatelli, A Carpentier, S Kpotufe COLT 2017, 2017 | 36 | 2017 |
An adaptive strategy for active learning with smooth decision boundary A Locatelli, A Carpentier, S Kpotufe ALT 2018, 2017 | 15 | 2017 |
Active multiple matrix completion with adaptive confidence sets A Locatelli, A Carpentier, M Valko The 22nd International Conference on Artificial Intelligence and Statistics …, 2019 | 1 | 2019 |
On adaptivity in active sequential learning A Locatelli | | 2020 |