The convergence rate of regularized learning in games: From bandits and uncertainty to optimism and beyond

Angeliki Giannou (1) , Emmanouil Vasileios Vlatakis-Gkaragkounis (2) , Panayotis Mertikopoulos (3, 4)

1 University of Wisconsin-Madison
2 Columbia University [New York]
3 POLARIS - Performance analysis and optimization of LARge Infrastructures and Systems
4 Criteo AI Lab

In this paper, we examine the convergence rate of a wide range of regularized methods for learning in games. To that end, we propose a unified algorithmic template that we call "follow the generalized leader" (FTGL), and which includes as special cases the canonical "follow the regularized leader" algorithm, its optimistic variants, extra-gradient schemes, and many others. The proposed framework is also sufficiently flexible to account for several different feedback models-from full information to bandit feedback. In this general setting, we show that FTGL algorithms converge locally to strict Nash equilibria at a rate which does not depend on the level of uncertainty faced by the players, but only on the geometry of the regularizer near the equilibrium. In particular, we show that algorithms based on entropic regularization-like the exponential weights algorithm-enjoy a linear convergence rate, while Euclidean projection methods converge to equilibrium in a finite number of iterations, even with bandit feedback.

Domaines: Optimisation et contrôle [math.OC]

Angeliki Giannou, Emmanouil Vasileios Vlatakis-Gkaragkounis, Panayotis Mertikopoulos. The convergence rate of regularized learning in games: From bandits and uncertainty to optimism and beyond. NeurIPS 2021 - 35th International Conference on Neural Information Processing Systems, Dec 2021, Virtual, Unknown Region. pp.1-28. ⟨hal-03357715⟩