most citedFaster Single-loop Algorithms for Minimax Optimization without Strong Concavity

8 citations · 8 across the 1 of their papers we have counts for

collaborators

1 paper

cs.LG2021★ 8 cited

Faster Single-loop Algorithms for Minimax Optimization without Strong Concavity

Junchi Yang, Antonio Orvieto, Aurelien Lucchi +1

Gradient descent ascent (GDA), the simplest single-loop algorithm for nonconvex minimax optimization, is widely used in practical applications such as generative adversarial networ…