activity
20192025
most citedNon-Asymptotic Sequential Tests for Overlapping Hypotheses and application to near optimal arm identification in bandit models

2 citations · 3 across the 8 of their papers we have counts for

collaborators

8 papers

cs.LG2025

EVaR-Optimal Arm Identification in Bandits

Mehrasa Ahmadipour, Aurélien Garivier

We study the fixed-confidence best arm identification (BAI) problem within the multi-armed bandit (MAB) framework under the Entropic Value-at-Risk (EVaR) criterion. Our analysis co…

cs.LG2025

Identifying the Best Transition Law

Mehrasa Ahmadipour, élise Crepon, Aurélien Garivier

Motivated by recursive learning in Markov Decision Processes, this paper studies best-arm identification in bandit problems where each arm's reward is drawn from a multinomial dist…

stat.ML2025

Efficient Risk-sensitive Planning via Entropic Risk Measures

Alexandre Marthe, Samuel Bounan, Aurélien Garivier +1

Risk-sensitive planning aims to identify policies maximizing some tail-focused metrics in Markov Decision Processes (MDPs). Such an optimization task can be very costly for the mos…

stat.ML2025★ 1 cited

Sequential Learning of the Pareto Front for Multi-objective Bandits

Elise Crépon, Aurélien Garivier, Wouter M Koolen

We study the problem of sequential learning of the Pareto front in multi-objective multi-armed bandits. An agent is faced with K possible arms to pull. At each turn she picks one,…

math.ST2024

On Sparsity and Sub-Gaussianity in the Johnson-Lindenstrauss Lemma

Aurélien Garivier, Emmanuel Pilliat

We provide a simple proof of the Johnson-Lindenstrauss lemma for sub-Gaussian variables. We extend the analysis to identify how sparse projections can be, and what the cost of spar…

cs.AI2023

Beyond Average Return in Markov Decision Processes

Alexandre Marthe, Aurélien Garivier, Claire Vernade

What are the functionals of the reward that can be computed and optimized exactly in Markov Decision Processes?In the finite-horizon, undiscounted setting, Dynamic Programming (DP)…