Near-Optimal Complexity of Finite-Sum Nonconvex-Strongly-Concave Minimax Optimization BHSY6QQCVK

Expressions

The mentions of the inventory that name this resource. Each name links to the card of its inventory row.

Item	Kind	Where	Source
Near-optimal minimax complexity	statement	theorem 1	arxiv
49JZXMKYA3	statement	lemma 1	arxiv
4RAV7KYPC5	statement	lemma 4	arxiv
Averaged smoothness	statement	theorem 2	arxiv
Exposure cost of a dual path	statement	proposition 3	arxiv
Bilinear upper bound from existing methods	statement	proposition 1	arxiv
Incremental first-order oracle	definition	definition 1	arxiv
RPDA upper bound	statement	theorem 3	arxiv
Bilinear comparison	statement	proposition 2	arxiv
Inner contraction and total movement	statement	lemma 3	arxiv
Individual smoothness	statement	theorem 4	arxiv
Adaptive search cost	statement	lemma 2	arxiv
Zero-respecting algorithm	definition	definition 2	arxiv
The boundary case $\kappa=1$	statement	proposition 4	arxiv