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

researchr

You are not signed in
Sign in
Sign up

Haibo Yang, Zhuqing Liu, Xin Zhang 0054, Jia Liu 0002. SAGDA: Achieving $\mathcal{O}(\epsilon^{-2})$ Communication Complexity in Federated Min-Max Learning. In Sanmi Koyejo, S. Mohamed, A. Agarwal, Danielle Belgrave, K. Cho, A. Oh, editors, Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, NeurIPS 2022, New Orleans, LA, USA, November 28 - December 9, 2022. 2022. [doi]

This author has not been identified. Look up 'Haibo Yang' in GoogleThis author has not been identified. Look up 'Zhuqing Liu' in GoogleThis author has not been identified. Look up 'Xin Zhang 0054' in GoogleThis author has not been identified. Look up 'Jia Liu 0002' in Google

runs on WebDSL