Skip to Main content Skip to Navigation
Conference papers

Exploiting structure of uncertainty for efficient matroid semi-bandits

Pierre Perrault 1 Vianney Perchet 2 Michal Valko 1, 3
1 SEQUEL - Sequential Learning
Inria Lille - Nord Europe, CRIStAL - Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189
Abstract : We improve the efficiency of algorithms for stochastic combinatorial semi-bandits. In most interesting problems, state-of-the-art algorithms take advantage of structural properties of rewards, such as independence. However, while being optimal in terms of asymptotic regret, these algorithms are inefficient. In our paper, we first reduce their implementation to a specific submod-ular maximization. Then, in case of matroid constraints , we design adapted approximation routines , thereby providing the first efficient algorithms that rely on reward structure to improve regret bound. In particular, we improve the state-of-the-art efficient gap-free regret bound by a factor √ m/ log m, where m is the maximum action size. Finally, we show how our improvement translates to more general budgeted combinato-rial semi-bandits.
Document type :
Conference papers
Complete list of metadata

Cited literature [20 references]  Display  Hide  Download
Contributor : Michal Valko Connect in order to contact the contributor
Submitted on : Friday, November 29, 2019 - 6:11:03 PM
Last modification on : Thursday, April 22, 2021 - 1:20:03 PM


Files produced by the author(s)


  • HAL Id : hal-02387478, version 1


Pierre Perrault, Vianney Perchet, Michal Valko. Exploiting structure of uncertainty for efficient matroid semi-bandits. International Conference on Machine Learning, 2019, Long Beach, United States. ⟨hal-02387478⟩



Record views


Files downloads