Cohort Squeeze: Beyond a Single Communication Round per Cohort in Cross-Device Federated Learning
Not on the map. Why?
Abstract (arXiv)
Virtually all federated learning (FL) methods, including FedAvg, operate in the following manner: i) an orchestrating server sends the current model parameters to a cohort of clients selected via certain rule, ii) these clients then independently perform a local training procedure (e.g., via SGD or Adam) using their own training data, and iii) the resulting models are shipped to the server for aggregation. This process is repeated until a model of suitable quality is found. A notable feature of these methods is that each cohort is involved in a single communication round with the server only. In this work we challenge this algorithmic design primitive and investigate whether it is possible to ``squeeze more juice" out of each cohort than what is possible in a single communication round. Surprisingly, we find that this is indeed the case, and our approach leads to up to 74% reduction in the total communication cost needed to train a FL model in the cross-device setting. Our method is based on a novel variant of the stochastic proximal point method (SPPM-AS) which supports a large collection of client sampling procedures some of which lead to further gains when compared to classical client selection approaches.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 33 of its 51 references that are in the map. First posted on arXiv 3 Jun 2024.
Builds on
33 of 51 references.
References · 33
- 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,669
- 2019Advances and Open Problems in Federated Learningcited by 3,046
- 2018Federated Optimization in Heterogeneous Networkscited by 2,987
- 2019On the Convergence of FedAvg on Non-IID Datacited by 1,229
- 2020Adaptive Federated Optimizationcited by 1,046
- 2018LEAF: A Benchmark for Federated Settingscited by 792
- 2018Federated Learning for Mobile Keyboard Predictioncited by 572
- 2019SGD: General Analysis and Improved Ratescited by 207
- 2018Applied Federated Learning: Improving Google Keyboard Query Suggestionscited by 204
- 2020Better Theory for SGD in the Nonconvex Worldcited by 158
- 2020Mime: Mimicking Centralized Stochastic Algorithms in Federated Learningcited by 154
- 2022ProxSkip: Yes! Local Gradient Steps Provably Lead to Communication Acceleration! Finally!cited by 134
21 more
- 2019Federated Learning for Emoji Prediction in a Mobile Keyboardcited by 118
- 2023Stochastic Controlled Averaging for Federated Learning with Communication Compressioncited by 101
- 2021FedCM: Federated Learning with Client-level Momentumcited by 77
- 2023FedExP: Speeding Up Federated Averaging via Extrapolationcited by 69
- 2018Stochastic (Approximate) Proximal Point Methods: Convergence, Optimality, and Adaptivitycited by 61
- 2021FedLab: A Flexible Federated Learning Frameworkcited by 55
- 2023FedSpeed: Larger Local Interval, Less Communication Round, and Higher Generalization Accuracycited by 49
- 2022On Convergence of FedProx: Local Dissimilarity Invariant Bounds, Non-smoothness and Beyondcited by 38
- 2021Proximal and Federated Random Reshufflingcited by 33
- 2022Variance Reduced ProxSkip: Algorithm, Theory and Application to Federated Learningcited by 33
- 2021Local Adaptivity in Federated Learning: Convergence and Consistencycited by 31
- 2022Server-Side Stepsizes and Sampling Without Replacement Provably Help in Federated Optimizationcited by 23
- 2022Faster federated optimization under second-order similaritycited by 18
- 2020Apollo: An Adaptive Parameter-wise Diagonal Quasi-Newton Method for Nonconvex Stochastic Optimizationcited by 16
- 2021Doubly Adaptive Scaled Algorithm for Machine Learning Using Second-Order Informationcited by 16
- 2023On the Role of Server Momentum in Federated Learningcited by 16
- 2021Accelerated, Optimal, and Parallel: Some Results on Model-Based Stochastic Optimizationcited by 14
- 2024FedP3: Federated Personalized and Privacy-friendly Network Pruning under Model Heterogeneitycited by 13
- 2023Stochastic Distributed Optimization under Average Second-order Similarity: Algorithms and Analysiscited by 11
- 2021On Second-order Optimization Methods for Federated Learningcited by 9
- 2023Sharper Analysis for Minibatch Stochastic Proximal Point Methods: Stability, Smoothness, and Deviationcited by 4
Built on by
Citing papers per year: 2024: 1; 2025: 0; 2026: 1.
2 papers.