EPISODE: Episodic Gradient Clipping with Periodic Resampled Corrections for Federated Learning with Heterogeneous Data
Michael Crawshaw, Yajie Bao, Mingrui Liu
Abstract
Gradient clipping is an important technique for deep neural networks with exploding gradients, such as recurrent neural networks. Recent studies have shown that the loss functions of these networks do not satisfy the conventional smoothness condition, but instead satisfy a relaxed smoothness condition, i.e., the Lipschitz constant of the gradient scales linearly in terms of the gradient norm. Due to this observation, several gradient clipping algorithms have been developed for nonconvex and relaxed-smooth functions. However, the existing algorithms only apply to the single-machine or multiple-machine setting with homogeneous data across machines. It remains unclear how to design provably efficient gradient clipping algorithms in the general Federated Learning (FL) setting with heterogeneous data and limited communication rounds. In this paper, we design EPISODE, the very first algorithm to solve FL problems with heterogeneous data in the nonconvex and relaxed smoothness setting. The key ingredients of the algorithm are two new techniques called episodic gradient clipping and periodic resampled corrections. At the beginning of each round, EPISODE resamples stochastic gradients from each client and obtains the global averaged gradient, which is used to (1) determine whether to apply gradient clipping for the entire round and (2) construct local gradient corrections for each client. Notably, our algorithm and analysis provide a unified framework for both homogeneous and heterogeneous data under any noise level of the stochastic gradient, and it achieves state-of-the-art complexity results. In particular, we prove that EPISODE can achieve linear speedup in the number of machines, and it requires significantly fewer communication rounds. Experiments on several heterogeneous datasets, including text classification and image classification, show the superior performance of EPISODE over several strong baselines in FL. The code is available at https://github.com/MingruiLiu-ML-Lab/episode .
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 7ae98e58-89f3-4188-8b0c-e18affbb0fd9Cited by top-tier papers5
- Federated Learning with Client Subsampling, Data Heterogeneity, and Unbounded Smoothness: A New Algorithm and Lower BoundsMichael Crawshaw, Yajie Bao, Mingrui LiuNeurIPS 2023 · 23 citations
- Bilevel Optimization under Unbounded Smoothness: A New Algorithm and Convergence AnalysisJie Hao, Xiaochuan Gong, Mingrui LiuICLR 2024 · 14 citations
- An Accelerated Algorithm for Stochastic Bilevel Optimization under Unbounded SmoothnessXiaochuan Gong, Jie Hao, Mingrui LiuNeurIPS 2024 · 10 citations
- An improved analysis of per-sample and per-update clipping in federated learningBo Li, Xiaowen Jiang, Mikkel N. Schmidt, Tommy Sonne Alstrøm et al.ICLR 2024 · 9 citations
- Complexity Lower Bounds of Adaptive Gradient Algorithms for Non-convex Stochastic Optimization under Relaxed SmoothnessMichael Crawshaw, Mingrui LiuICLR 2025
Builds on18
- Deep Learning with Differential PrivacyMartín Abadi, Andy Chu, Ian J. Goodfellow, H. Brendan McMahan et al.CCS 2016 · 7,620 citations
- 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
- Why Gradient Clipping Accelerates Training: A Theoretical Justification for AdaptivityJingzhao Zhang, Tianxing He, Suvrit Sra, Ali JadbabaieICLR 2020 · 598 citations
- Don't Use Large Mini-batches, Use Local SGDTao Lin, Sebastian U. Stich, Kumar Kshitij Patel, Martin JaggiICLR 2020 · 462 citations
Related papers
- A Communication-Efficient Distributed Gradient Clipping Algorithm for Training Deep Neural NetworksMingrui Liu, Zhenxun Zhuang, Yunwen Lei, Chunyang LiaoNeurIPS 2022 · 29 citations
- Understanding Clipping for Federated Learning: Convergence and Client-Level Differential PrivacyXinwei Zhang, Xiangyi Chen, Mingyi Hong, Steven Wu et al.ICML 2022 · 134 citations
- Linear Convergence in Federated Learning: Tackling Client Heterogeneity and Sparse GradientsAritra Mitra, Rayana H. Jaafar, George J. Pappas, Hamed HassaniNeurIPS 2021 · 193 citations
- Heterogeneity-Guided Client Sampling: Towards Fast and Efficient Non-IID Federated LearningHuancheng Chen, Haris VikaloNeurIPS 2024 · 15 citations
- Federated Learning under Periodic Client Participation and Heterogeneous Data: A New Communication-Efficient Algorithm and AnalysisMichael Crawshaw, Mingrui LiuNeurIPS 2024 · 22 citations
