SAGDA: Achieving O(ε-2) Communication Complexity in Federated Min-Max Learning (Conference Paper) | NSF PAGES

skip to main content

Citation Details

SAGDA: Achieving O(ε-2) Communication Complexity in Federated Min-Max Learning

Award ID(s):: 2110259

NSF-PAR ID:: 10435368

Author(s) / Creator(s):: Yang, H.; Liu, Z.; Zhang, X.; Liu, J.

Date Published:: 2022-12-01

Journal Name:: Proc. NeurIPS

Format(s):: Medium: X

Sponsoring Org:: National Science Foundation

Free Publicly Accessible Full Text
Accepted Manuscript1.0
Conference Paper:
The DOI is not currently available.