Stochastic Smoothed Gradient Descent Ascent for Federated Minimax Optimization
Not on the map. Why?
Abstract (arXiv)
In recent years, federated minimax optimization has attracted growing interest due to its extensive applications in various machine learning tasks. While Smoothed Alternative Gradient Descent Ascent (Smoothed-AGDA) has proved its success in centralized nonconvex minimax optimization, how and whether smoothing technique could be helpful in federated setting remains unexplored. In this paper, we propose a new algorithm termed Federated Stochastic Smoothed Gradient Descent Ascent (FESS-GDA), which utilizes the smoothing technique for federated minimax optimization. We prove that FESS-GDA can be uniformly used to solve several classes of federated minimax problems and prove new or better analytical convergence results for these settings. We showcase the practical efficiency of FESS-GDA in practical federated learning tasks of training generative adversarial networks (GANs) and fair classification.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 31 of its 48 references that are in the map. First posted on arXiv 2 Nov 2023.
Builds on
31 of 48 references.
References · 31
- 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,592
- 2014Explaining and Harnessing Adversarial Examplescited by 7,287
- 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,326
- 2019Multi-Agent Reinforcement Learning: A Selective Overview of Theories and Algorithmscited by 555
- 2016Linear Convergence of Gradient and Proximal-Gradient Methods Under the Polyak-Lojasiewicz Conditioncited by 526
- 2019On Gradient Descent Ascent for Nonconvex-Concave Minimax Problemscited by 266
- 2021Achieving Linear Speedup with Partial Worker Participation in Non-IID Federated Learningcited by 192
- 2019Solving a Class of Non-Convex Min-Max Games Using Iterative First Order Methodscited by 148
- 2021Distributionally Robust Federated Averagingcited by 104
- 2020Robust Federated Learning: The Case of Affine Distribution Shiftscited by 102
- 2020Stochastic Recursive Gradient Descent Ascent for Stochastic Nonconvex-Strongly-Concave Minimax Problemscited by 75
- 2018Weakly-Convex Concave Min-Max Optimization: Provable Algorithms and Applications in Machine Learningcited by 62
19 more
- 2022FedVARP: Tackling the Variance Due to Partial Client Participation in Federated Learningcited by 62
- 2019Stochastic AUC Maximization with Deep Neural Networkscited by 61
- 2022FedNest: Federated Bilevel, Minimax, and Compositional Optimizationcited by 60
- 2020A Single-Loop Smoothed Gradient Descent-Ascent Algorithm for Nonconvex-Concave Min-Max Problemscited by 57
- 2021Faster Single-loop Algorithms for Minimax Optimization without Strong Concavitycited by 47
- 2021Local Stochastic Gradient Descent Ascent: Convergence Analysis and Communication Efficiencycited by 40
- 2022Federated Minimax Optimization: Improved Convergence Analyses and Algorithmscited by 37
- 2020Stochastic Hamiltonian Gradient Methods for Smooth Gamescited by 32
- 2020Single-Timescale Stochastic Nonconvex-Concave Optimization for Smooth Nonlinear TD Learningcited by 24
- 2022SAPD+: An Accelerated Stochastic Method for Nonconvex-Concave Minimax Problemscited by 23
- 2021Efficient Algorithms for Federated Saddle Point Optimizationcited by 20
- 2018A Proximal Alternating Direction Method of Multiplier for Linearly Constrained Nonconvex Minimizationcited by 14
- 2014Local Linear Convergence of Forward-Backward under Partial Smoothnesscited by 13
- 2023Solving a Class of Non-Convex Minimax Optimization in Federated Learningcited by 10
- 2022A Communication-efficient Algorithm with Linear Convergence for Federated Minimax Learningcited by 9
- 2023Federated Minimax Optimization with Client Heterogeneitycited by 8
- 2014Protecting Privacy through Distributed Computation in Multi-agent Decision Makingcited by 5
- 2022Adaptive Federated Minimax Optimization with Lower Complexitiescited by 5
- 2019SNAP: Finding Approximate Second-Order Stationary Solutions Efficiently for Non-convex Linearly Constrained Problemscited by 2
Built on by
Citing papers per year: 2024: 1; 2025: 2; 2026: 1.
4 papers.
- 2025Federated Instrumental Variable Analysis via Federated Generalized Method of Momentscited by 1
- 2025Federated Stochastic Minimax Optimization under Heavy-Tailed Noisescited by 1
- 2024Stability and Generalization for Distributed SGDAcited by 0
- 2026Communication-Efficient Agnostic Federated Learning via Faster Convergence and Compressioncited by 0
- 2026Communication-Efficient Agnostic Federated Learning via Faster Convergence and Compression29 Sep 2026
- 2025Federated Stochastic Minimax Optimization under Heavy-Tailed Noises6 Nov 2025
- 2025Federated Instrumental Variable Analysis via Federated Generalized Method of Moments27 May 2025
- 2024Stability and Generalization for Distributed SGDA14 Nov 2024