Lower Complexity Bounds for Finite-Sum Convex-Concave Minimax Optimization Problems.
Guangzeng XieLuo LuoYijiang LianZhihua ZhangPublished in: ICML (2020)
Keyphrases
- lower complexity
- convex concave
- optimization problems
- objective function
- low complexity
- worst case
- evolutionary algorithm
- saddle point
- lower bound
- discrete tomography
- data complexity
- convex hull
- upper bound
- computational complexity
- cost function
- optimization methods
- solution path
- finite number
- variational inequalities
- compression ratio
- expressive power
- motion estimation