139 citations · 615 across the 107 of their papers we have counts for
6 papers · 1 filter
Adapting to game trees in zero-sum imperfect information games
Côme Fiegel, Pierre Ménard, Tadashi Kozuno +3
Imperfect information games (IIG) are games in which each player only partially observes the current game state. We study how to learn -optimal strategies in a zero-sum IIG thro…
A survey on multi-player bandits
Etienne Boursier, Vianney Perchet
Due mostly to its application to cognitive radio networks, multiplayer bandits gained a lot of interest in the last decade. A considerable progress has been made on its theoretical…
Stochastic Mirror Descent for Large-Scale Sparse Recovery
Sasila Ilandarideva, Yannis Bekri, Anatoli Juditsky +1
In this paper we discuss an application of Stochastic Approximation to statistical estimation of high-dimensional sparse parameters. The proposed solution reduces to resolving a pe…
On Preemption and Learning in Stochastic Scheduling
Nadav Merlis, Hugo Richard, Flore Sentenac +3
We study single-machine scheduling of jobs, each belonging to a job type that determines its duration distribution. We start by analyzing the scenario where the type characteristic…
Active Labeling: Streaming Stochastic Gradients
Vivien Cabannes, Francis Bach, Vianney Perchet +1
The workhorse of machine learning is stochastic gradient descent. To access stochastic gradients, it is common to consider iteratively input/output pairs of a training dataset. Int…
An algorithmic solution to the Blotto game using multi-marginal couplings
Vianney Perchet, Philippe Rigollet, Thibaut Le Gouic
We describe an efficient algorithm to compute solutions for the general two-player Blotto game on n battlefields with heterogeneous values. While explicit constructions for such so…