paper-with-me

홈 › Papers

Multiplicative Weights Updates with Constant Step-Size in Graphical Constant-Sum Games

2018-12-01 · NeurIPS 2018 12 · Yun Kuen Cheung

Since Multiplicative Weights (MW) updates are the discrete analogue of the continuous Replicator Dynamics (RD), some researchers had expected their qualitative behaviours would be similar. We show that this is false in the context of graphical constant-sum games, which include two-person zero-sum games as special cases. In such games which have a fully-mixed Nash Equilibrium (NE), it was known that RD satisfy the permanence and Poincare recurrence properties, but we show that MW updates with any constant step-size eps > 0 converge to the boundary of the state space, and thus do not satisfy the two properties. Using this result, we show that MW updates have a regret lower bound of Omega( 1 / (eps T) ), while it was known that the regret of RD is upper bounded by O( 1 / T ). Interestingly, the regret perspective can be useful for better understanding of the behaviours of MW updates. In a two-person zero-sum game, if it has a unique NE which is fully mixed, then we show, via regret, that for any sufficiently small eps, there exist at least two probability densities and a constant Z > 0, such that for any arbitrarily small z > 0, each of the two densities fluctuates above Z and below z infinitely often.

📄 PDF Abstract BibTeX

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Beyond Time-Average Convergence: Near-Optimal Uncoupled Online Learning via Clairvoyant Multiplicative Weights Update

2021-11-29 · Georgios Piliouras, Ryann Sim, Stratis Skoulakis

In this paper, we provide a novel and simple algorithm, Clairvoyant Multiplicative Weights Updates (CMWU) for regret minimization in general games. CMWU effectively corresponds to the standard MWU algorithm but where all…

Multiplicative Weights Update with Constant Step-Size in Congestion Games: Convergence, Limit Cycles and Chaos

2017-12-01 · NeurIPS 2017 12 · Gerasimos Palaiopanos, Ioannis Panageas, Georgios Piliouras

The Multiplicative Weights Update (MWU) method is a ubiquitous meta-algorithm that works as follows: A distribution is maintained on a certain set, and at each step the probability assigned to action $\gamma$ is multipli…

M+Adam: Low-Precision Training via Additive-Multiplicative Optimization

2026-07-12 · Xiaoyuan Liang, Sebastian Loeschcke, Mads Toftrup, Anima Anandkumar arxiv

Training with quantized weights can reduce costs but often results in degraded accuracy, especially when optimization is carried out in low precision, without storing high-precision copies. We identify a key failure mode…

Cautious Optimism: A Meta-Algorithm for Near-Constant Regret in General Games

2025-06-05 · Ashkan Soleymani, Georgios Piliouras, Gabriele Farina

Recent work [Soleymani et al., 2025] introduced a variant of Optimistic Multiplicative Weights Updates (OMWU) that adaptively controls the learning pace in a dynamic, non-monotone manner, achieving new state-of-the-art r…

The Collusion of Memory and Nonlinearity in Stochastic Approximation With Constant Stepsize

2024-05-27 · Dongyan Huo, Yixuan Zhang, Yudong Chen, Qiaomin Xie

In this work, we investigate stochastic approximation (SA) with Markovian data and nonlinear updates under constant stepsize $\alpha>0$. Existing work has primarily focused on either i.i.d. data or linear update rules. W…