The complexity of nonconvex-strongly-concave minimax optimizationDownload PDFOpen Website

2021 (modified: 16 May 2022)UAI 2021Readers: Everyone
Abstract: 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 finite-sum settings. W...
0 Replies

Loading