| SIC-MMAB: synchronisation involves communication in multiplayer multi-armed bandits E Boursier, V Perchet Advances in Neural Information Processing Systems, 12071-12080, 2019 | 99 | 2019 |
| A practical algorithm for multiplayer bandits when arm means vary among players E Boursier, E Kaufmann, A Mehrabian, V Perchet 23rd International Conference on Artificial Intelligence and Statistics, 2019 | 68* | 2019 |
| Statistical efficiency of thompson sampling for combinatorial semi-bandits P Perrault, E Boursier, V Perchet, M Valko arXiv preprint arXiv:2006.06613, 2020 | 33 | 2020 |
| Gradient flow dynamics of shallow relu networks for square loss and orthogonal inputs E Boursier, L Pillaud-Vivien, N Flammarion Advances in Neural Information Processing Systems 35, 20105-20118, 2022 | 29 | 2022 |
| Selfish robustness and equilibria in multi-player bandits E Boursier, V Perchet Conference on Learning Theory, 530-581, 2020 | 18 | 2020 |
| Plato: approximate analytics over compressed time series with tight deterministic error guarantees C Lin, E Boursier, Y Papakonstantinou Proceedings of the VLDB Endowment 13 (7), 1105-1118, 2020 | 18* | 2020 |
| Decentralized Learning in Online Queuing Systems F Sentenac, E Boursier, V Perchet Advances in Neural Information Processing Systems 34, 18501-18512, 2021 | 17 | 2021 |
| Utility/Privacy Trade-off through the lens of Optimal Transport E Boursier, V Perchet International Conference on Artificial Intelligence and Statistics (AISTATS …, 2019 | 10* | 2019 |
| Efficient approximate query answering over sensor data with deterministic error guarantees J Brito, K Demirkaya, B Etienne, Y Katsis, C Lin, Y Papakonstantinou arXiv preprint arXiv:1707.01414, 2017 | 8 | 2017 |
| Penalising the biases in norm regularisation enforces sparsity E Boursier, N Flammarion arXiv preprint arXiv:2303.01353, 2023 | 5 | 2023 |
| Trace norm regularization for multi-task learning with scarce data E Boursier, M Konobeev, N Flammarion Conference on Learning Theory, 1303-1327, 2022 | 5 | 2022 |
| A survey on multi-player bandits E Boursier, V Perchet arXiv preprint arXiv:2211.16275, 2022 | 3 | 2022 |
| Social Learning in Non-Stationary Environments E Boursier, V Perchet, M Scarsini International Conference on Algorithmic Learning Theory, 128-129, 2022 | 3* | 2022 |
| Making the most of your day: online learning for optimal allocation of time E Boursier, T Garrec, V Perchet, M Scarsini Advances in Neural Information Processing Systems 34, 11208-11219, 2021 | 3 | 2021 |
| First-order ANIL provably learns representations despite overparametrisation O Yüksel, E Boursier, N Flammarion NeurIPS 2023 Workshop on Mathematics of Modern Machine Learning, 2023 | | 2023 |
| Approximate information maximization for bandit games A Barbier--Chebbah, CL Vestergaard, JB Masson, E Boursier | | 2023 |
| Constant or logarithmic regret in asynchronous multiplayer bandits H Richard, E Boursier, V Perchet arXiv preprint arXiv:2305.19691, 2023 | | 2023 |
| Utility/privacy trade-off as regularized optimal transport E Boursier, V Perchet Mathematical Programming, 1-24, 2022 | | 2022 |
| Sequential Learning in a strategical environment E Boursier Université Paris-Saclay, 2021 | | 2021 |
Vianney PerchetCrest, ENSAE & Criteo AI LabVerified email at normalesup.org
