31 citations · 104 across the 21 of their papers we have counts for
8 papers · 1 filter
Episodic Reinforcement Learning in Finite MDPs: Minimax Lower Bounds Revisited
Omar Darwiche Domingues, Pierre Ménard, Emilie Kaufmann +1
In this paper, we propose new problem-independent lower bounds on the sample complexity and regret in episodic MDPs, with a particular focus on the non-stationary case in which the…
Optimal Strategies for Graph-Structured Bandits
Hassan Saber, Pierre Ménard, Odalric-Ambrym Maillard
We study a structured variant of the multi-armed bandit problem specified by a set of Bernoulli distributions with mean…
Gamification of Pure Exploration for Linear Bandits
Rémy Degenne, Pierre Ménard, Xuedong Shang +1
We investigate an active pure-exploration setting, that includes best-arm identification, in the context of linear stochastic bandits. While asymptotically optimal algorithms exist…
Fast active learning for pure exploration in reinforcement learning
Pierre Ménard, Omar Darwiche Domingues, Anders Jonsson +3
Realistic environments often provide agents with very limited feedback. When the environment is initially unknown, the feedback, in the beginning, can be completely absent, and the…
A Kernel-Based Approach to Non-Stationary Reinforcement Learning in Metric Spaces
Omar Darwiche Domingues, Pierre Ménard, Matteo Pirotta +2
In this work, we propose KeRNS: an algorithm for episodic reinforcement learning in non-stationary Markov Decision Processes (MDPs) whose state-action set is endowed with a metric.…
Forced-exploration free Strategies for Unimodal Bandits
Hassan Saber, Pierre Ménard, Odalric-Ambrym Maillard
We consider a multi-armed bandit problem specified by a set of Gaussian or Bernoulli distributions endowed with a unimodal structure. Although this problem has been addressed in th…
Planning in Markov Decision Processes with Gap-Dependent Sample Complexity
Anders Jonsson, Emilie Kaufmann, Pierre Ménard +3
We propose MDP-GapE, a new trajectory-based Monte-Carlo Tree Search algorithm for planning in a Markov Decision Process in which transitions have a finite support. We prove an uppe…
Adaptive Reward-Free Exploration
Emilie Kaufmann, Pierre Ménard, Omar Darwiche Domingues +3
Reward-free exploration is a reinforcement learning setting studied by Jin et al. (2020), who address it by running several algorithms with regret guarantees in parallel. In our wo…