SAGDA: Achieving O(ε-2) Communication Complexity in Federated Min-Max Learning
- Award ID(s):
- 2110259
- PAR ID:
- 10435368
- Date Published:
- Journal Name:
- Proc. NeurIPS
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
No document suggestions found