The impact of uncertainty on regularized learning in games
Pierre-Louis Cauvin, Davide Legacci, Panayotis Mertikopoulos
摘要
In this paper, we investigate how randomness and uncertainty influence learning in games. Specifically, we examine a perturbed variant of the dynamics of "followthe-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 show that randomness disrupts this behavior, causing the stochastic dynamics to drift toward the boundary on average.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper4
- Robust Equilibria in Continuous Games: From Strategic to Dynamic RobustnessKyriakos Lotidis, Panayotis Mertikopoulos, Nicholas Bambos, Jose H. BlanchetNeurIPS 2025 · 被引用 2 次
- Multi-Agent Learning under Uncertainty: Recurrence vs. ConcentrationKyriakos Lotidis, Panayotis Mertikopoulos, Nicholas Bambos, José H. BlanchetNeurIPS 2025 · 被引用 1 次
- Bregman meets Lévy: Stochastic Mirror Descent with Heavy-Tailed Noise in Continuous and Discrete TimePierre-Louis Cauvin, Panayotis MertikopoulosICML 2026
- What Preferences Can—and Cannot—Predict in Multi-Agent Online LearningOmar Abbadi, Rida Laraki, Panayotis MertikopoulosICML 2026
它引用的顶会 Paper4
- No-Regret Learning and Mixed Nash Equilibria: They Do Not MixEmmanouil V. Vlatakis-Gkaragkounis, Lampros Flokas, Thanasis Lianeas, Panayotis Mertikopoulos 等NeurIPS 2020 · 被引用 100 次
- The Limits of Min-Max Optimization Algorithms: Convergence to Spurious Non-Critical SetsYa-Ping Hsieh, Panayotis Mertikopoulos, Volkan CevherICML 2021 · 被引用 96 次
- A Geometric Decomposition of Finite Games: Convergence vs. Recurrence under Exponential WeightsDavide Legacci, Panayotis Mertikopoulos, Bary S. R. PradelskiICML 2024 · 被引用 10 次
- The Equivalence of Dynamic and Strategic Stability under Regularized Learning in GamesVictor Boone, Panayotis MertikopoulosNeurIPS 2023 · 被引用 9 次
相关 Paper
- Prediction Accuracy of Learning in Games : Follow-the-Regularized-Leader meets HeisenbergYi Feng, Georgios Piliouras, Xiao WangICML 2024 · 被引用 2 次
- No-regret Learning in Harmonic Games: Extrapolation in the Face of Conflicting InterestsDavide Legacci, Panayotis Mertikopoulos, Christos H. Papadimitriou, Georgios Piliouras 等NeurIPS 2024 · 被引用 10 次
- The Evolution of Uncertainty of Learning in GamesYun Kuen Cheung, Georgios Piliouras, Yixin TaoICLR 2022 · 被引用 5 次
- Convergence of No-Swap-Regret Dynamics in Self-PlayRenato Paes Leme, Georgios Piliouras, Jon SchneiderNeurIPS 2024 · 被引用 3 次
- Adapting to game trees in zero-sum imperfect information gamesCôme Fiegel, Pierre Ménard, Tadashi Kozuno, Rémi Munos 等ICML 2023 · 被引用 13 次
