NO-REGRET ALGORITHMS IN ON-LINE LEARNING, GAMES AND CONVEX OPTIMIZATION
Résumé
The purpose of this article is to underline the links between some no-regret algorithms used in on-line learning, games and convex optimization and to compare the continuous and discrete time versions.
Origine : Fichiers produits par l'(les) auteur(s)