The limit points of (optimistic) gradient descent in min-max optimization
© 2018 Curran Associates Inc.All rights reserved. Motivated by applications in Optimization, Game Theory, and the training of Generative Adversarial Networks, the convergence properties of first order methods in min-max problems have received extensive study. It has been recognized that they may cyc...
Main Authors: | Daskalakis, C, Panageas, I |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
Format: | Article |
Language: | English |
Published: |
2022
|
Online Access: | https://hdl.handle.net/1721.1/143126 |
Similar Items
-
Last-iterate convergence: Zero-sum games and constrained min-max optimization
by: Daskalakis, C, et al.
Published: (2022) -
The complexity of constrained min-max optimization
by: Daskalakis, Constantinos, et al.
Published: (2022) -
Deep MinMax Networks
by: Lohmiller, Winfried, et al.
Published: (2024) -
Quantum gradient descent and Newton’s method for constrained polynomial optimization
by: Rebentrost, Frank Patrick, et al.
Published: (2020) -
Convergence Rate of O(1/k) for Optimistic Gradient and Extragradient Methods in Smooth Convex-Concave Saddle Point Problems
by: Mokhtari, Aryan, et al.
Published: (2022)