7 citations · 13 across the 2 of their papers we have counts for
3 papers
cs.GT2019★ 7 cited
Finite Regret and Cycles with Fixed Step-Size via Alternating Gradient Descent-Ascent
James P. Bailey, Gauthier Gidel, Georgios Piliouras
Gradient descent is arguably one of the most popular online optimization methods with a wide array of applications. However, the standard implementation where agents simultaneously…
cs.GT2019★ 6 cited
Fast and Furious Learning in Zero-Sum Games: Vanishing Regret with Non-Vanishing Step Sizes
James P. Bailey, Georgios Piliouras
We show for the first time, to our knowledge, that it is possible to reconcile in online learning in zero-sum games two seemingly contradictory objectives: vanishing time-average r…
cs.GT2019
Multi-Agent Learning in Network Zero-Sum Games is a Hamiltonian System
James P. Bailey, Georgios Piliouras
Zero-sum games are natural, if informal, analogues of closed physical systems where no energy/utility can enter or exit. This analogy can be extended even further if we consider ze…