atlas

Research map / Optimization / Nonconvex and smooth optimization

Regularized Gradient Descent Ascent for Two-Player Zero-Sum Markov Games

NeurIPS 2022 · Optimization › Nonconvex and smooth optimization · approach: Equilibrium learning in zero-sum games

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Add entropy regularization with a geometrically decaying weight and inner-loop GDAGDA for two-player zero-sum Markov games · Two-player zero-sum Markov gamesgradient updates to an ε-approximate Nash equilibrium: O(ε^{-3})Helped
Add online polynomial decay of the entropy regularization weightGDA for two-player zero-sum Markov games · Two-player zero-sum Markov gameslast-iterate convergence rate: O(k^{-1/3})Helped
Add a fixed positive entropy regularization weightGDA for entropy-regularized Markov games · Entropy-regularized two-player zero-sum Markov gamesconvergence to the regularized Nash equilibrium: linear convergenceHelped
Use diminishing entropy regularization instead of unregularized GDAGDA for a completely mixed synthetic Markov game · Synthetic completely mixed Markov gamelast-iterate convergenceHelped
Use unregularized GDA instead of diminishing-regularization GDAGDA for a deterministic synthetic Markov game · Synthetic deterministic Markov gameconvergence to the Nash equilibriumNo clear effect

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy