Federated Learning with Client Subsampling, Data Heterogeneity, and Unbounded Smoothness: A New Algorithm and Lower Bounds
Michael Crawshaw, Yajie Bao, Mingrui Liu
摘要
We study the problem of Federated Learning (FL) under client subsampling and data heterogeneity with an objective function that has potentially unbounded smoothness. This problem is motivated by empirical evidence that the class of relaxed smooth functions, where the Lipschitz constant of the gradient scales linearly with the gradient norm, closely resembles the loss functions of certain neural networks such as recurrent neural networks (RNNs) with possibly exploding gradient. We introduce EPISODE++, the first algorithm to solve this problem. It maintains historical statistics for each client to construct control variates and decide clipping behavior for sampled clients in the current round. We prove that EPISODE++ achieves linear speedup in the number of participating clients, reduced communication rounds, and resilience to data heterogeneity. Our upper bound proof relies on novel techniques of recursively bounding the client updates under unbounded smoothness and client subsampling, together with a refined high probability analysis. In addition, we prove a lower bound showing that the convergence rate of a special case of clipped minibatch SGD (without randomness in the stochastic gradient and with randomness in client subsampling) suffers from an explicit dependence on the maximum gradient norm of the objective in a sublevel set, which may be large. This effectively demonstrates that applying gradient clipping to minibatch SGD in our setting does not eliminate the problem of exploding gradients. Our lower bound is based on new constructions of hard instances tailored to client subsampling and a novel analysis of the trajectory of the algorithm in the presence of clipping. Lastly, we provide an experimental evaluation of EPISODE++ when training RNNs on federated text classification tasks, demonstrating that EPISODE++ outperforms strong baselines in FL. The code is available at https://github.com/MingruiLiu-ML-Lab/episode_plusplus.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了最后一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper6
- Bilevel Optimization under Unbounded Smoothness: A New Algorithm and Convergence AnalysisJie Hao, Xiaochuan Gong, Mingrui LiuICLR 2024 · 被引用 14 次
- An Accelerated Algorithm for Stochastic Bilevel Optimization under Unbounded SmoothnessXiaochuan Gong, Jie Hao, Mingrui LiuNeurIPS 2024 · 被引用 10 次
- Error Feedback under (L0, L1)-Smoothness: Normalization and MomentumSarit Khirirat, Abdurakhmon Sadiev, Artem Riabinin, Eduard Gorbunov 等NeurIPS 2025 · 被引用 10 次
- Handling Spatial-Temporal Data Heterogeneity for Federated Continual Learning via Tail AnchorHao Yu, Xin Yang, Le Zhang, Hanlin Gu 等CVPR 2025
- Methods with Local Steps and Random Reshuffling for Generally Smooth Non-Convex Federated OptimizationYury Demidovich, Petr Ostroukhov, Grigory Malinovsky, Samuel Horváth 等ICLR 2025
它引用的顶会 Paper20
- SCAFFOLD: Stochastic Controlled Averaging for Federated LearningSai Praneeth Karimireddy, Satyen Kale, Mehryar Mohri, Sashank J. Reddi 等ICML 2020 · 被引用 3,875 次
- On the Convergence of FedAvg on Non-IID DataXiang Li, Kaixuan Huang, Wenhao Yang, Shusen Wang 等ICLR 2020 · 被引用 2,930 次
- A Unified Theory of Decentralized SGD with Changing Topology and Local UpdatesAnastasia Koloskova, Nicolas Loizou, Sadra Boreiri, Martin Jaggi 等ICML 2020 · 被引用 623 次
- Why Gradient Clipping Accelerates Training: A Theoretical Justification for AdaptivityJingzhao Zhang, Tianxing He, Suvrit Sra, Ali JadbabaieICLR 2020 · 被引用 598 次
- Don't Use Large Mini-batches, Use Local SGDTao Lin, Sebastian U. Stich, Kumar Kshitij Patel, Martin JaggiICLR 2020 · 被引用 462 次
相关 Paper
- EPISODE: Episodic Gradient Clipping with Periodic Resampled Corrections for Federated Learning with Heterogeneous DataMichael Crawshaw, Yajie Bao, Mingrui LiuICLR 2023 · 被引用 2 次
- A Communication-Efficient Distributed Gradient Clipping Algorithm for Training Deep Neural NetworksMingrui Liu, Zhenxun Zhuang, Yunwen Lei, Chunyang LiaoNeurIPS 2022 · 被引用 29 次
- Tight High-Probability Bounds for Nonconvex Heavy-Tailed Scenario under Weaker AssumptionsWeixin An, Yuanyuan Liu, Fanhua Shang, Han Yu 等NeurIPS 2025
- Federated Learning under Periodic Client Participation and Heterogeneous Data: A New Communication-Efficient Algorithm and AnalysisMichael Crawshaw, Mingrui LiuNeurIPS 2024 · 被引用 22 次
- Stability and Convergence of Stochastic Gradient Clipping: Beyond Lipschitz Continuity and SmoothnessVien V. Mai, Mikael JohanssonICML 2021 · 被引用 53 次
