Online Sparse Bandits
Abstract
We propose an algorithm for finding sparse Nash equilibria. The algorithm is faster than the state of the art, under the condition that the non-zero coefficients are rare. We have no formal proof, results are experimental only.
Fichier principal
acmlPoster21.pdf (337.23 Ko)
Télécharger le fichier
acmlPoster2.pdf (337.23 Ko)
Télécharger le fichier
Origin | Files produced by the author(s) |
---|
Format | Other |
---|