Aurélien Garivier
29 papers · 2010–2024 · 8 conferences · across top CS/AI conferences
Achievements
Jump to papers ↓+12 more ↓ Show less ↑
🐣 Hot Topic Early Bird 🌉 Interdisciplinary Bridge 🧭 Keyword Pioneer 🗺️ Taxonomy Completionist (16) 🌍 Conference Polyglot (8)
🗺️
Taxonomy Completionist
(16)
🧭
Keyword Pioneer
🐣
Hot Topic Early Bird
🔬
Deep Specialist
(11)
🧬
Topic Evolution
🏆
Keyword Champion
🗃️
Keyword Collector
(109)
🚀
Conference Pioneer
💎
Century Club
(29)
🔥
Unstoppable
(9)
📈
Trend Setter
⚡
Prolific Year
(7)
Conferences
NIPS (7)
COLT (5)
AISTATS (4)
ALT (4)
ACML (3)
JMLR (3)
IJCAI (2)
ICML (1)
Top co-authors
Research topics
Keywords
multi-armed bandit
(17)
sample complexity
(8)
regret bound
(8)
stochastic optimization
(6)
upper confidence bound
(4)
online learning
(4)
best-arm identification
(3)
best arm identification
(3)
optimal stopping
(2)
optimistic algorithm
(2)
thompson sampling
(2)
regret minimization
(2)
sequential learning
(2)
markov decision process
(2)
minimax regret
(2)
bayesian inference
(2)
sequential testing
(2)
online algorithm
(2)
distributional reinforcement learning
(1)
graph structure
(1)
Papers
Sequential learning of the Pareto front for multi-objective bandits
AISTATS 2024
Quantum Channel Certification with Incoherent Measurements
COLT 2023
Beyond Average Return in Markov Decision Processes
NIPS 2023
On Best-Arm Identification with a Fixed Budget in Non-Parametric Multi-Armed Bandits
ALT 2023
Private Statistical Estimation of Many Quantiles
ICML 2023
A Non-asymptotic Approach to Best-Arm Identification for Gaussian Bandits
AISTATS 2022
KL-UCB-Switch: Optimal Regret Bounds for Stochastic Bandits from Both a Distribution-Dependent and a Distribution-Free Viewpoints
JMLR 2022
Fast Rate Learning in Stochastic First Price Bidding
ACML 2021
Epsilon Best Arm Identification in Spectral Bandits
IJCAI 2021
Self-Concordant Analysis of Generalized Linear Bandits with Forgetting
AISTATS 2021
A/B/n Testing with Control in the Presence of Subpopulations
NIPS 2021
Efficient Algorithms for Stochastic Repeated Second-price Auctions
ALT 2021
Sequential Algorithms for Testing Closeness of Distributions
NIPS 2021
Navigating to the Best Policy in Markov Decision Processes
NIPS 2021
Best Arm Identification in Spectral Bandits
IJCAI 2020
Algorithmic Learning Theory 2019: Preface
ALT 2019
$\mathcal{X}$-Armed Bandits: Optimizing Quantiles, CVaR and Other Risks
ACML 2019
Sequential Test for the Lowest Mean: From Thompson to Murphy Sampling
NIPS 2018
Profitable Bandits
ACML 2018
A minimax and asymptotically optimal algorithm for stochastic bandits
ALT 2017
Optimal Best Arm Identification with Fixed Confidence
COLT 2016
Maximin Action Identification: A New Bandit Framework for Games
COLT 2016
On the Complexity of Best-Arm Identification in Multi-Armed Bandit Models
JMLR 2016
On Explore-Then-Commit strategies
NIPS 2016
On the Complexity of A/B Testing
COLT 2014
Optimal Discovery with Probabilistic Expert Advice: Finite Time Analysis and Macroscopic Optimality
JMLR 2013
On Bayesian Upper Confidence Bounds for Bandit Problems
AISTATS 2012
The KL-UCB Algorithm for Bounded Stochastic Bandits and Beyond
COLT 2011
Parametric Bandits: The Generalized Linear Case
NIPS 2010