SAGDA: Achieving \mathcal{O}(\epsilon {-2}) Communication Complexity in Federated Min-Max Learning

Open in new window