1CentraleSupélec (3, rue Joliot Curie,
Plateau de Moulon,
91192 GIF-SUR-YVETTE Cedex - France)
2Orange Gardens (44 Avenue de la République, 92320 Châtillon, - France)
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.
https://hal.archives-ouvertes.fr/hal-03162140 Contributor : Thibaut CuvelierConnect in order to contact the contributor Submitted on : Monday, March 8, 2021 - 12:12:31 PM Last modification on : Friday, March 12, 2021 - 3:23:33 AM Long-term archiving on: : Wednesday, June 9, 2021 - 6:55:22 PM
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⟩