Skip to yearly menu bar Skip to main content


Combinatorial semi-bandit with known covariance

Rémy Degenne · Vianney Perchet

Area 5+6+7+8 #4

Keywords: [ Combinatorial Optimization ] [ Online Learning ] [ Learning Theory ] [ Bandit Algorithms ]


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 rewards of all pulled arms are revealed. One difference with the single arm variant is that the dependency structure of the arms is crucial. Previous works on this setting either used a worst-case approach or imposed independence of the arms. We introduce a way to quantify the dependency structure of the problem and design an algorithm that adapts to it. The algorithm is based on linear regression and the analysis uses techniques from the linear bandit literature. By comparing its performance to a new lower bound, we prove that it is optimal, up to a poly-logarithmic factor in the number of arms pulled.

Live content is unavailable. Log in and register to view live content