Exploiting structure of uncertainty for efficient matroid semi-bandits - Archive ouverte HAL Access content directly
Conference Papers Year :

Exploiting structure of uncertainty for efficient matroid semi-bandits

(1) , (2) , (1, 3)
1
2
3
Michal Valko

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.
Fichier principal
Vignette du fichier
supplementary.pdf (882.58 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02387478 , version 1 (29-11-2019)

Identifiers

  • HAL Id : hal-02387478 , version 1

Cite

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⟩
108 View
99 Download

Share

Gmail Facebook Twitter LinkedIn More