activity
20102026
most citedBatched bandit problems

139 citations · 615 across the 107 of their papers we have counts for

collaborators
Showing 2019 · stat.MLShow all

5 papers · 2 filters

stat.ML2019★ 5 cited

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 $β…

stat.ML2019★ 2 cited

Utility/Privacy Trade-off through the lens of Optimal Transport

Etienne Boursier, Vianney Perchet

Strategic information is valuable either by remaining private (for instance if it is sensitive) or, on the other hand, by being used publicly to increase some utility. These two ob…

stat.ML2019★ 4 cited

An adaptive stochastic optimization algorithm for resource allocation

Xavier Fontaine, Shie Mannor, Vianney Perchet

We consider the classical problem of sequential resource allocation where a decision maker must repeatedly divide a budget between several resources, each with diminishing returns.…

stat.ML2019★ 2 cited

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…

stat.ML2019★ 31 cited

A Practical Algorithm for Multiplayer Bandits when Arm Means Vary Among Players

Etienne Boursier, Emilie Kaufmann, Abbas Mehrabian +1

We study a multiplayer stochastic multi-armed bandit problem in which players cannot communicate, and if two or more players pull the same arm, a collision occurs and the involved…