Accelerated gradient temporal difference learning algorithms. - Dominik Meyer; Rémy Degenne; Ahmed Omrane; Hao Shen 002 (ADPRL, 2014)

Anytime optimal algorithms in stochastic multi-armed bandits. - Rémy Degenne; Vianney Perchet (ICML, 2016)

Combinatorial semi-bandit with known covariance. - Rémy Degenne; Vianney Perchet (NIPS, 2016)

Bandits with Side Observations: Bounded vs. Logarithmic Regret. - Rémy Degenne; Evrard Garcelon; Vianney Perchet (UAI, 2018)

Bridging the gap between regret minimization and best arm identification, with application to A/B tests. - Rémy Degenne; Thomas Nedelec; Clément Calauzènes; Vianney Perchet (AISTATS, 2019)

Pure Exploration with Multiple Correct Answers. - Rémy Degenne; Wouter M. Koolen (NeurIPS, 2019)

Non-Asymptotic Pure Exploration by Solving Games. - Rémy Degenne; Wouter M. Koolen; Pierre Ménard (NeurIPS, 2019)

Gamification of Pure Exploration for Linear Bandits. - Rémy Degenne; Pierre Ménard; Xuedong Shang; Michal Valko (ICML, 2020)

Structure Adaptive Algorithms for Stochastic Bandits. - Rémy Degenne; Han Shao; Wouter M. Koolen (ICML, 2020)

Dealing With Misspecification In Fixed-Confidence Linear Top-m Identification. - Clémence Réda; Andrea Tirinzoni; Rémy Degenne (NeurIPS, 2021)

Online Sign Identification: Minimization of the Number of Errors in Thresholding Bandits. - Reda Ouhamma; Rémy Degenne; Pierre Gaillard; Vianney Perchet (CoRR, 2021)

Choosing Answers in Epsilon-Best-Answer Identification for Linear Bandits. - Marc Jourdan; Rémy Degenne (ICML, 2022)

Top Two Algorithms Revisited. - Marc Jourdan; Rémy Degenne; Dorian Baudry; Rianne de Heide; Emilie Kaufmann (NeurIPS, 2022)

On Elimination Strategies for Bandit Fixed-Confidence Identification. - Andrea Tirinzoni; Rémy Degenne (NeurIPS, 2022)

Choosing Answers in ε-Best-Answer Identification for Linear Bandits. - Marc Jourdan; Rémy Degenne (CoRR, 2022)

Dealing with Unknown Variances in Best-Arm Identification. - Marc Jourdan; Rémy Degenne; Emilie Kaufmann (ALT, 2023)

On the Existence of a Complexity in Fixed Budget Bandit Identification. - Rémy Degenne (COLT, 2023)

A Formalization of Doob's Martingale Convergence Theorems in mathlib. - Kexing Ying; Rémy Degenne (CPP, 2023)

Fast Asymptotically Optimal Algorithms for Non-Parametric Stochastic Bandits. - Dorian Baudry; Fabien Pesquerel; Rémy Degenne; Odalric-Ambrym Maillard (NeurIPS, 2023)

Non-Asymptotic Analysis of a UCB-based Top Two Algorithm. - Marc Jourdan; Rémy Degenne (NeurIPS, 2023)

An ε-Best-Arm Identification Algorithm for Fixed-Confidence and Beyond. - Marc Jourdan; Rémy Degenne; Emilie Kaufmann (NeurIPS, 2023)

Optimal Multi-Fidelity Best-Arm Identification. - Riccardo Poiani; Rémy Degenne; Emilie Kaufmann; Alberto Maria Metelli; Marcello Restelli (NeurIPS, 2024)

Finding good policies in average-reward Markov Decision Processes without prior knowledge. - Adrienne Tuynman; Rémy Degenne; Emilie Kaufmann (NeurIPS, 2024)

Information Lower Bounds for Robust Mean Estimation. - Rémy Degenne; Timothée Mathieu (CoRR, 2024)

Best-Arm Identification in Unimodal Bandits. - Riccardo Poiani; Marc Jourdan; Emilie Kaufmann; Rémy Degenne (AISTATS, 2025)

The Batch Complexity of Bandit Pure Exploration. - Adrienne Tuynman; Rémy Degenne (CoRR, 2025)