Asymptotically Optimal Strategies for Combinatorial Semi-Bandits in Polynomial Time - Archive ouverte HAL Access content directly
Conference Papers Year : 2021

Asymptotically Optimal Strategies for Combinatorial Semi-Bandits in Polynomial Time

Thibaut Cuvelier
Richard Combes
Eric Gourdin
  • Function : Author
  • PersonId : 952670

Abstract

We consider combinatorial semi-bandits with uncorrelated Gaussian rewards. In this article, we propose the first method, to the best of our knowledge, that enables to compute the solution of the Graves-Lai optimization problem in polynomial time for many combinatorial structures of interest. In turn, this immediately yields the first known approach to implement asymptotically optimal algorithms in polynomial time for combinatorial semi-bandits.
Fichier principal
Vignette du fichier
2102.07254.pdf (255.27 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-03162140 , version 1 (08-03-2021)

Identifiers

Cite

Thibaut Cuvelier, Richard Combes, Eric Gourdin. Asymptotically Optimal Strategies for Combinatorial Semi-Bandits in Polynomial Time. Algorithmic Learning Theory, Mar 2021, Paris, France. ⟨hal-03162140⟩
64 View
33 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More