139 citations · 615 across the 107 of their papers we have counts for
Showing 2016Show all
3 papers · 1 filter
cs.LG2016★ 24 cited
Combinatorial semi-bandit with known covariance
Rémy Degenne, Vianney Perchet
The combinatorial stochastic semi-bandit problem is an extension of the classical multi-armed bandit problem in which an algorithm pulls more than one arm at each stage and the rew…
cs.GT2016
Approachability of convex sets in generalized quitting games
János Flesch, Rida Laraki, Vianney Perchet
We consider Blackwell approachability, a very powerful and geometric tool in game theory, used for example to design strategies of the uninformed player in repeated games with inco…
cs.LG2016
Highly-Smooth Zero-th Order Online Optimization Vianney Perchet
Francis Bach, Vianney Perchet
The minimization of convex functions which are only available through partial and noisy information is a key methodological problem in many disciplines. In this paper we consider c…