33 citations · 53 across the 14 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
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…
math.OC2021★ 10 cited
The Complexity of Nonconvex-Strongly-Concave Minimax Optimization
Siqi Zhang, Junchi Yang, Cristóbal Guzmán +2
This paper studies the complexity for finding approximate stationary points of nonconvex-strongly-concave (NC-SC) smooth minimax problems, in both general and averaged smooth finit…