7 citations · 15 across the 7 of their papers we have counts for
7 papers
Covariance-adapting algorithm for semi-bandits with application to sparse rewards
Pierre Perrault, Vianney Perchet, Michal Valko
We investigate stochastic combinatorial semi-bandits, where the entire joint distribution of outcomes impacts the complexity of the problem instance (unlike in the standard bandits…
Fast Rates for Maximum Entropy Exploration
Daniil Tiapkin, Denis Belomestny, Daniele Calandriello +7
We address the challenge of exploration in reinforcement learning (RL) when the agent operates in an unknown environment with sparse or no rewards. In this work, we study the maxim…
When Combinatorial Thompson Sampling meets Approximation Regret
Pierre Perrault
We study the Combinatorial Thompson Sampling policy (CTS) for combinatorial multi-armed bandit problems (CMAB), within an approximation regret setting. Although CTS has attracted a…
Statistical Efficiency of Thompson Sampling for Combinatorial Semi-Bandits
Pierre Perrault, Etienne Boursier, Vianney Perchet +1
We investigate stochastic combinatorial multi-armed bandit with semi-bandit feedback (CMAB). In CMAB, the question of the existence of an efficient policy with an optimal asymptoti…
Online A-Optimal Design and Active Linear Regression
Xavier Fontaine, Pierre Perrault, Michal Valko +1
We consider in this paper the problem of optimal experiment design where a decision maker can choose which points to sample to obtain an estimate of the hidden parameter $β…
Exploiting Structure of Uncertainty for Efficient Matroid Semi-Bandits
Pierre Perrault, Vianney Perchet, Michal Valko
We improve the efficiency of algorithms for stochastic \emph{combinatorial semi-bandits}. In most interesting problems, state-of-the-art algorithms take advantage of structural pro…
Finding the bandit in a graph: Sequential search-and-stop
Pierre Perrault, Vianney Perchet, Michal Valko
We consider the problem where an agent wants to find a hidden object that is randomly located in some vertex of a directed acyclic graph (DAG) according to a fixed but possibly unk…