Picture for Odalric-Ambrym Maillard

Odalric-Ambrym Maillard

CRIStAL

Power Mean Estimation in Stochastic Monte-Carlo Tree_Search

Jun 04, 2024
Viaarxiv icon

CRIMED: Lower and Upper Bounds on Regret for Bandits with Unbounded Stochastic Corruption

Sep 28, 2023
Viaarxiv icon

Monte-Carlo tree search with uncertainty propagation via optimal transport

Add code
Sep 19, 2023
Figure 1 for Monte-Carlo tree search with uncertainty propagation via optimal transport
Figure 2 for Monte-Carlo tree search with uncertainty propagation via optimal transport
Figure 3 for Monte-Carlo tree search with uncertainty propagation via optimal transport
Figure 4 for Monte-Carlo tree search with uncertainty propagation via optimal transport
Viaarxiv icon

AdaStop: sequential testing for efficient and reliable comparisons of Deep RL Agents

Add code
Jun 19, 2023
Figure 1 for AdaStop: sequential testing for efficient and reliable comparisons of Deep RL Agents
Figure 2 for AdaStop: sequential testing for efficient and reliable comparisons of Deep RL Agents
Figure 3 for AdaStop: sequential testing for efficient and reliable comparisons of Deep RL Agents
Figure 4 for AdaStop: sequential testing for efficient and reliable comparisons of Deep RL Agents
Viaarxiv icon

Bilinear Exponential Family of MDPs: Frequentist Regret Bound with Tractable Exploration and Planning

Add code
Oct 05, 2022
Figure 1 for Bilinear Exponential Family of MDPs: Frequentist Regret Bound with Tractable Exploration and Planning
Figure 2 for Bilinear Exponential Family of MDPs: Frequentist Regret Bound with Tractable Exploration and Planning
Viaarxiv icon

Risk-aware linear bandits with convex loss

Sep 15, 2022
Figure 1 for Risk-aware linear bandits with convex loss
Figure 2 for Risk-aware linear bandits with convex loss
Figure 3 for Risk-aware linear bandits with convex loss
Figure 4 for Risk-aware linear bandits with convex loss
Viaarxiv icon

Collaborative Algorithms for Online Personalized Mean Estimation

Add code
Aug 24, 2022
Figure 1 for Collaborative Algorithms for Online Personalized Mean Estimation
Figure 2 for Collaborative Algorithms for Online Personalized Mean Estimation
Figure 3 for Collaborative Algorithms for Online Personalized Mean Estimation
Figure 4 for Collaborative Algorithms for Online Personalized Mean Estimation
Viaarxiv icon

Bandits Corrupted by Nature: Lower Bounds on Regret and Robust Optimistic Algorithm

Add code
Mar 07, 2022
Figure 1 for Bandits Corrupted by Nature: Lower Bounds on Regret and Robust Optimistic Algorithm
Figure 2 for Bandits Corrupted by Nature: Lower Bounds on Regret and Robust Optimistic Algorithm
Figure 3 for Bandits Corrupted by Nature: Lower Bounds on Regret and Robust Optimistic Algorithm
Viaarxiv icon

Bregman Deviations of Generic Exponential Families

Jan 18, 2022
Figure 1 for Bregman Deviations of Generic Exponential Families
Figure 2 for Bregman Deviations of Generic Exponential Families
Figure 3 for Bregman Deviations of Generic Exponential Families
Figure 4 for Bregman Deviations of Generic Exponential Families
Viaarxiv icon

Indexed Minimum Empirical Divergence for Unimodal Bandits

Dec 02, 2021
Figure 1 for Indexed Minimum Empirical Divergence for Unimodal Bandits
Viaarxiv icon