Paper Overview
Field: Machine Learning Authors: Mingyang Liu, Gabriele Farina, Asuman Ozdaglar Published: 2025-09-01 arXiv: 2509.00139
Abstract
Uncoupled no-regret dynamics provide a decentralized route to equilibrium, but prior guarantees for individual regret retain a polylogarithmic dependence on the horizon. This work removes that dependence for every finite N-player normal-form game under full-information feedback.
The authors introduce ECHO-OFTRL: optimistic follow-the-regularized-leader (OFTRL) equipped with an EMA cascade for high-order optimism (ECHO), where EMA denotes exponential moving average. The algorithm is deterministic and fully uncoupled.
If m_max denotes the largest action-set size, then, simultaneously for every horizon T ≥ 1, the algorithm guarantees that each of the N players in the game incurs regret upper bounded by:
The algorithm leverages a new form of optimism inspired by modern filter design.
Key Contributions
- Horizon-independent regret: individual regret bounds no longer contain any polylogarithmic dependence on the time horizon T
- Fully uncoupled and deterministic: each player's updates rely only on their own information, no centralized coordination
- ECHO mechanism: an EMA cascade delivering high-order optimism, inspired by modern filter design
*Source: zhichai.net forum post, auto-collected 2026-09-02.*