| 2025 | ALT | When and why randomised exploration works (in linear bandits). | Marc Abeille, David Janz, Ciara Pike-Burke |
| 2024 | ALT | Near-continuous time Reinforcement Learning for continuous state-action spaces. | Lorenzo Croissant, Marc Abeille, Bruno Bouchard |
| 2022 | AISTATS | Jointly Efficient and Optimal Algorithms for Logistic Bandits. | Louis Faury, Marc Abeille, Kwang-Sung Jun, Clment Calauznes |
| 2021 | AISTATS | Instance-Wise Minimax-Optimal Algorithms for Logistic Bandits. | Marc Abeille, Louis Faury, Clment Calauznes |
| 2021 | ALT | A Technical Note on Non-Stationary Parametric Bandits: Existing Mistakes and Preliminary Solutions. | Louis Faury, Yoan Russac, Marc Abeille, Clment Calauznes |
| 2020 | ICML | Efficient Optimistic Exploration in Linear-Quadratic Regulators via Lagrangian Relaxation. | Marc Abeille, Alessandro Lazaric |
| 2020 | ICML | Real-Time Optimisation for Online Learning in Auctions. | Lorenzo Croissant, Marc Abeille, Clment Calauznes |
| 2020 | ICML | Improved Optimistic Algorithms for Logistic Bandits. | Louis Faury, Marc Abeille, Clment Calauznes, Olivier Fercoq |
| 2018 | ICML | Improved Regret Bounds for Thompson Sampling in Linear Quadratic Control Problems. | Marc Abeille, Alessandro Lazaric |
| 2017 | AISTATS | Linear Thompson Sampling Revisited. | Marc Abeille, Alessandro Lazaric |
| 2017 | AISTATS | Thompson Sampling for Linear-Quadratic Control Problems. | Marc Abeille, Alessandro Lazaric |