Odalric-ambrym Maillard
40 papers · 2010–2025 · 9 venues · across top CS/AI venues
This profile combines several different researchers. Authors are keyed by name, and this name's papers fall into 15 separate collaboration groups - the largest holds only 33% of them. Pick the group below that matches the researcher you mean. How a shared name is split.
Achievements are not shown for a combined profile - each one describes a single researcher's record, which this is not.
Which Odalric-ambrym Maillard?
6 groups of papers that share co-authors internally but none with each other - each most likely a different researcher. Pick one to see its papers.
with Mohammad Sadegh Talebi, Fabien Pesquerel, Dorian Baudry
13 papers
· 2018–2024
· NeurIPS, ACML, UAI
Hide ▲
Power Mean Estimation in Stochastic Monte-Carlo Tree Search
UAI 2024
Exploration in Reward Machines with Low Regret
AISTATS 2023
Fast Asymptotically Optimal Algorithms for Non-Parametric Stochastic Bandits
NeurIPS 2023
Logarithmic regret in communicating MDPs: Leveraging known dynamics with bandits
ACML 2023
Efficient Change-Point Detection for Tackling Piecewise-Stationary Bandits
JMLR 2022
IMED-RL: Regret optimal learning of ergodic Markov decision processes
NeurIPS 2022
From Optimality to Robustness: Adaptive Re-Sampling Strategies in Stochastic Bandits
NeurIPS 2021
Indexed Minimum Empirical Divergence for Unimodal Bandits
NeurIPS 2021
Stochastic bandits with groups of similar arms.
NeurIPS 2021
Sub-sampling for Efficient Non-Parametric Bandit Exploration
NeurIPS 2020
Learning Multiple Markov Chains via Adaptive Allocation
NeurIPS 2019
Model-Based Reinforcement Learning Exploiting State-Action Equivalence
ACML 2019
Variance-Aware Regret Bounds for Undiscounted Reinforcement Learning in MDPs
ALT 2018
9 papers whose co-authors appear nowhere else under this name
Information-Based Exploration via Random Features for Reinforcement Learning
ACML 2025
Monte-Carlo Tree Search with Uncertainty Propagation via Optimal Transport
ICML 2025
Reinforcement Learning in Parametric MDPs with Exponential Families
AISTATS 2021
Sequential change-point detection: Laplace concentration of scan statistics and non-asymptotic delay bounds
ALT 2019
Streaming kernel regression with provably adaptive mean, variance, and regularization
JMLR 2018
Boundary Crossing for General Exponential Families
ALT 2017
Efficient tracking of a growing number of experts
ALT 2017
Spectral Learning from a Single Trajectory under Finite-State Policies
ICML 2017
Hierarchical Optimistic Region Selection driven by Curiosity
NeurIPS 2012