ResearchTrend.AI
SAGDA: Achieving $\mathcal{O}(ε^{-2})$ Communication Complexity in Federated Min-Max Learning
v1v2 (latest)

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

Haibo Yang
Zhuqing Liu
Xin Zhang
Jia-Wei Liu
ArXiv (abs)PDFHTMLGithub

Papers citing "SAGDA: Achieving $\mathcal{O}(ε^{-2})$ Communication Complexity in Federated Min-Max Learning"

0 / 0 papers shown

No papers found