Decoupled SGDA for Games with Intermittent Strategy Communication
Ali Zindari, Parham Yazdkhasti, Anton Rodomanov, Tatjana Chavdarova, Sebastian U. Stich
Abstract
We introduce Decoupled SGDA, a novel adaptation of Stochastic Gradient Descent Ascent (SGDA) tailored for multiplayer games with intermittent strategy communication. Unlike prior methods, Decoupled SGDA enables players to update strategies locally using outdated opponent strategies, significantly reducing communication overhead. For Strongly-Convex-Strongly-Concave (SCSC) games, it achieves near-optimal communication complexity comparable to the best-known GDA rates. For weakly coupled games where the interaction between players is lower relative to the non-interactive part of the game, Decoupled SGDA significantly reduces communication costs compared to standard SGDA. Additionally, Decoupled SGDA outperforms federated minimax approaches in noisy, imbalanced settings. These results establish Decoupled SGDA as a transformative approach for distributed optimization in resource-constrained environments.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 40316725-9e6f-41da-bfe4-01439c710550Builds on11
- SCAFFOLD: Stochastic Controlled Averaging for Federated LearningSai Praneeth Karimireddy, Satyen Kale, Mehryar Mohri, Sashank J. Reddi et al.ICML 2020 · 3,875 citations
- A Unified Theory of Decentralized SGD with Changing Topology and Local UpdatesAnastasia Koloskova, Nicolas Loizou, Sadra Boreiri, Martin Jaggi et al.ICML 2020 · 623 citations
- Decentralized Q-learning in Zero-sum Markov GamesMuhammed O. Sayin, Kaiqing Zhang, David S. Leslie, Tamer Basar et al.NeurIPS 2021 · 105 citations
- Federated Minimax Optimization: Improved Convergence Analyses and AlgorithmsPranay Sharma, Rohan Panda, Gauri Joshi, Pramod K. VarshneyICML 2022 · 63 citations
- Linear Lower Bounds and Conditioning of Differentiable GamesAdam Ibrahim, Waïss Azizian, Gauthier Gidel, Ioannis MitliagkasICML 2020 · 52 citations
Related papers
- SAGDA: Achieving Communication Complexity in Federated Min-Max LearningHaibo Yang, Zhuqing Liu, Xin Zhang, Jia LiuNeurIPS 2022
- A Communication-efficient Algorithm with Linear Convergence for Federated Minimax LearningZhenyu Sun, Ermin WeiNeurIPS 2022 · 20 citations
- Jointly Improving the Sample and Communication Complexities in Decentralized Stochastic Minimax OptimizationXuan Zhang, Gabriel Mancino-Ball, Necdet Serhat Aybat, Yangyang XuAAAI 2024 · 14 citations
- Minibatch vs Local SGD for Heterogeneous Distributed LearningBlake E. Woodworth, Kumar Kshitij Patel, Nati SrebroNeurIPS 2020 · 231 citations
- Stability and Generalization of the Decentralized Stochastic Gradient Descent Ascent AlgorithmMiaoxi Zhu, Li Shen, Bo Du, Dacheng TaoNeurIPS 2023 · 12 citations
