The impact of uncertainty on regularized learning in games
Not on the map. Why?
Abstract (arXiv)
In this paper, we investigate how randomness and uncertainty influence learning in games. Specifically, we examine a perturbed variant of the dynamics of "follow-the-regularized-leader" (FTRL), where the players' payoff observations and strategy updates are continually impacted by random shocks. Our findings reveal that, in a fairly precise sense, "uncertainty favors extremes": in any game, regardless of the noise level, every player's trajectory of play reaches an arbitrarily small neighborhood of a pure strategy in finite time (which we estimate). Moreover, even if the player does not ultimately settle at this strategy, they return arbitrarily close to some (possibly different) pure strategy infinitely often. This prompts the question of which sets of pure strategies emerge as robust predictions of learning under uncertainty. We show that (a) the only possible limits of the FTRL dynamics under uncertainty are pure Nash equilibria; and (b) a span of pure strategies is stable and attracting if and only if it is closed under better replies. Finally, we turn to games where the deterministic dynamics are recurrent - such as zero-sum games with interior equilibria - and we show that randomness disrupts this behavior, causing the stochastic dynamics to drift toward the boundary on average.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 19 of its 66 references that are in the map. First posted on arXiv 16 Jun 2025.
Builds on
19 of 66 references.
References · 19
- 2018Optimistic mirror descent in saddle-point problems: Going the extra (gradient) milecited by 136
- 2017Cycles in adversarial regularized learningcited by 124
- 2018More Adaptive Algorithms for Adversarial Banditscited by 114
- 2016Learning in games with continuous action sets and unknown payoff functionscited by 81
- 2020The limits of min-max optimization algorithms: convergence to spurious non-critical setscited by 50
- 2020No-regret learning and mixed Nash equilibria: They do not mixcited by 50
- 2018Hessian Riemannian gradient flows in convex programmingcited by 26
- 2021Survival of the strictest: Stable and unstable equilibria under regularized learning with partial informationcited by 23
- 2022A unified stochastic approximation framework for learning in gamescited by 23
- 2016Riemannian game dynamicscited by 19
- 2014A continuous-time approach to online optimizationcited by 13
- 2014On the robustness of learning in games with stochastically perturbed payoff observationscited by 7
7 more
- 2016On the convergence of gradient-like flows with noisy gradient inputcited by 7
- 2017Stochastic mirror descent dynamics and their convergence in monotone variational inequalitiescited by 5
- 2019Decomposition of games: some strategic considerationscited by 5
- 2023The equivalence of dynamic and strategic stability under regularized learning in gamescited by 4
- 2024A geometric decomposition of finite games: Convergence vs. recurrence under exponential weightscited by 4
- 2024No-regret learning in harmonic games: Extrapolation in the face of conflicting interestscited by 4
- 2014Imitation Dynamics with Payoff Shockscited by 2
Built on by
Citing papers per year: 2025: 2.
2 papers.