| Non-asymptotic pure exploration by solving games R Degenne, WM Koolen, P Ménard Advances in Neural Information Processing Systems 32, 2019 | 56 | 2019 |
| Anytime optimal algorithms in stochastic multi-armed bandits R Degenne, V Perchet International Conference on Machine Learning, 1587-1595, 2016 | 56 | 2016 |
| Gamification of pure exploration for linear bandits R Degenne, P Ménard, X Shang, M Valko International Conference on Machine Learning, 2432-2442, 2020 | 46 | 2020 |
| Pure exploration with multiple correct answers R Degenne, WM Koolen Advances in Neural Information Processing Systems 32, 2019 | 44 | 2019 |
| Combinatorial semi-bandit with known covariance R Degenne, V Perchet Advances in Neural Information Processing Systems 29, 2016 | 40 | 2016 |
| Structure adaptive algorithms for stochastic bandits R Degenne, H Shao, W Koolen International Conference on Machine Learning, 2443-2452, 2020 | 24 | 2020 |
| Bandits with side observations: Bounded vs. logarithmic regret R Degenne, E Garcelon, V Perchet arXiv preprint arXiv:1807.03558, 2018 | 8 | 2018 |
| Bridging the gap between regret minimization and best arm identification, with application to a/b tests R Degenne, T Nedelec, C Calauzènes, V Perchet The 22nd International Conference on Artificial Intelligence and Statistics …, 2019 | 7 | 2019 |
| Dealing with misspecification in fixed-confidence linear top-m identification C Réda, A Tirinzoni, R Degenne Advances in Neural Information Processing Systems 34, 25489-25501, 2021 | 6 | 2021 |
| Accelerated gradient temporal difference learning algorithms D Meyer, R Degenne, A Omrane, H Shen 2014 IEEE Symposium on Adaptive Dynamic Programming and Reinforcement …, 2014 | 6 | 2014 |
| Top two algorithms revisited M Jourdan, R Degenne, D Baudry, R de Heide, E Kaufmann arXiv preprint arXiv:2206.05979, 2022 | 5 | 2022 |
| Dealing with Unknown Variances in Best-Arm Identification M Jourdan, R Degenne, E Kaufmann arXiv preprint arXiv:2210.00974, 2022 | 2 | 2022 |
| Impact of structure on the design and analysis of bandit algorithms R Degenne Université Paris Cité, 2019 | 2 | 2019 |
| Choosing Answers in epsilon-Best-Answer Identification for Linear Bandits M Jourdan, R Degenne International Conference on Machine Learning, 10384-10430, 2022 | 1 | 2022 |
| Online Sign Identification: Minimization of the Number of Errors in Thresholding Bandits R Ouhamma, OA Maillard, V Perchet Advances in Neural Information Processing Systems 34, 18577-18589, 2021 | 1 | 2021 |
| A Formalization of Doob’s Martingale Convergence Theorems in mathlib K Ying, R Degenne Proceedings of the 12th ACM SIGPLAN International Conference on Certified …, 2023 | | 2023 |
| Non-Asymptotic Analysis of a UCB-based Top Two Algorithm M Jourdan, R Degenne arXiv preprint arXiv:2210.05431, 2022 | | 2022 |
| On Elimination Strategies for Bandit Fixed-Confidence Identification A Tirinzoni, R Degenne arXiv preprint arXiv:2205.10936, 2022 | | 2022 |
Vianney PerchetCrest, ENSAE & Criteo AI LabVerified email at normalesup.org
