SAGDA: Achieving $\mathcal{O}(\epsilon^{-2})$ Communication Complexity in Federated Min-Max Learning.
Haibo YangZhuqing LiuXin ZhangJia LiuPublished in: NeurIPS (2022)
Keyphrases
- min max
- supervised learning
- learning algorithm
- learning systems
- reinforcement learning
- learning process
- active learning
- learning problems
- communication systems
- prior knowledge
- neural network
- online learning
- information sharing
- learning tasks
- support vector
- learning environment
- background knowledge
- mobile learning
- learning scheme
- case study