2 citations · 2 across the 1 of their papers we have counts for
4 papers
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…