NeurIPS 2020

Improved Algorithms for Convex-Concave Minimax Optimization


Meta Review

The paper studies minimax optimization for strongly convex / strong concave objectives. Authors propose a novel algorithm that achieves linear convergence rate and improved dependence on the condition numbers, compared to prior work. Overall, an interesting paper. Accept!