Skip to yearly menu bar Skip to main content


Stochastic Smoothed Gradient Descent Ascent for Federated Minimax Optimization

Wei Shen · Minhui Huang · Jiawei Zhang · Cong Shen

MR1 & MR2 - Number 132
[ ]
Sat 4 May 6 a.m. PDT — 8:30 a.m. PDT


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 successful in centralized nonconvex minimax optimization, how and whether smoothing techniques could be helpful in a 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 applied 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.

Live content is unavailable. Log in and register to view live content