Rémy Degenne
20 papers · 2016–2025 · 4 conferences · across top CS/AI conferences
Achievements
Jump to papers ↓+6 more ↓ Show less ↑
🧭 Keyword Pioneer 🌉 Interdisciplinary Bridge 🌍 Conference Polyglot (4) 🏃 Academic Marathon (9) 🐣 Hot Topic Early Bird
🧭
Keyword Pioneer
🐣
Hot Topic Early Bird
🔬
Deep Specialist
(12)
🗃️
Keyword Collector
(62)
💎
Century Club
(20)
🔥
Unstoppable
(7)
Conferences
NIPS (12)
ICML (5)
AISTATS (2)
COLT (1)
Top co-authors
Keywords
multi-armed bandit
(13)
sample complexity
(9)
pure exploration
(4)
best-arm identification
(4)
best arm identification
(4)
linear bandit
(3)
reinforcement learning
(2)
upper confidence bound
(2)
stochastic bandit
(2)
bandit identification
(2)
regret minimization
(2)
regret bound
(2)
online learning
(2)
stochastic process
(2)
optimal policy
(1)
optimal experimental design
(1)
exponential family
(1)
adaptive sampling
(1)
kullback-leibler divergence
(1)
asymptotic optimality
(1)
Papers
Best-Arm Identification in Unimodal Bandits
AISTATS 2025
The Batch Complexity of Bandit Pure Exploration
ICML 2025
Finding good policies in average-reward Markov Decision Processes without prior knowledge
NIPS 2024
Optimal Multi-Fidelity Best-Arm Identification
NIPS 2024
Fast Asymptotically Optimal Algorithms for Non-Parametric Stochastic Bandits
NIPS 2023
On the Existence of a Complexity in Fixed Budget Bandit Identification
COLT 2023
An $\varepsilon$-Best-Arm Identification Algorithm for Fixed-Confidence and Beyond
NIPS 2023
Non-Asymptotic Analysis of a UCB-based Top Two Algorithm
NIPS 2023
On Elimination Strategies for Bandit Fixed-Confidence Identification
NIPS 2022
Top Two Algorithms Revisited
NIPS 2022
Choosing Answers in Epsilon-Best-Answer Identification for Linear Bandits
ICML 2022
Dealing With Misspecification In Fixed-Confidence Linear Top-m Identification
NIPS 2021
Online Sign Identification: Minimization of the Number of Errors in Thresholding Bandits
NIPS 2021
Gamification of Pure Exploration for Linear Bandits
ICML 2020
Structure Adaptive Algorithms for Stochastic Bandits
ICML 2020
Non-Asymptotic Pure Exploration by Solving Games
NIPS 2019
Bridging the gap between regret minimization and best arm identification, with application to A/B tests
AISTATS 2019
Pure Exploration with Multiple Correct Answers
NIPS 2019
Anytime optimal algorithms in stochastic multi-armed bandits
ICML 2016
Combinatorial semi-bandit with known covariance
NIPS 2016