Last-iterate convergence: Zero-sum games and constrained min-max optimization
© Constantinos Daskalakis and Ioannis Panageas. Motivated by applications in Game Theory, Optimization, and Generative Adversarial Networks, recent work of Daskalakis et al [Daskalakis et al., ICLR, 2018] and follow-up work of Liang and Stokes [Liang and Stokes, 2018] have established that a variant...
Main Authors: | Daskalakis, C, Panageas, I |
---|---|
Other Authors: | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory |
Format: | Article |
Language: | English |
Published: |
2022
|
Online Access: | https://hdl.handle.net/1721.1/143460 |
Similar Items
-
The complexity of constrained min-max optimization
by: Daskalakis, Constantinos, et al.
Published: (2022) -
The limit points of (optimistic) gradient descent in min-max optimization
by: Daskalakis, C, et al.
Published: (2022) -
Zero-Sum Polymatrix Games: A Generalization of Minmax
by: Cai, Yang, et al.
Published: (2017) -
Game Tree Searching by Min/Max Approximation
by: Rivest, Ronald L.
Published: (2023) -
Near-optimal no-regret algorithms for zero-sum
by: Daskalakis, Constantinos, et al.
Published: (2012)