mlsanityData to 14 Oct 2026

FedStale: leveraging stale client updates in federated learning

arXiv 2405.04171 ↗First posted 7 May 2024cs.LG cs.AIcited by 5

Not on the map. Why?

Abstract (arXiv)

Federated learning algorithms, such as FedAvg, are negatively affected by data heterogeneity and partial client participation. To mitigate the latter problem, global variance reduction methods, like FedVARP, leverage stale model updates for non-participating clients. These methods are effective under homogeneous client participation. Yet, this paper shows that, when some clients participate much less than others, aggregating updates with different levels of staleness can detrimentally affect the training process. Motivated by this observation, we introduce FedStale, a novel algorithm that updates the global model in each round through a convex combination of "fresh" updates from participating clients and "stale" updates from non-participating ones. By adjusting the weight in the convex combination, FedStale interpolates between FedAvg, which only uses fresh updates, and FedVARP, which treats fresh and stale updates equally. Our analysis of FedStale convergence yields the following novel findings: i) it integrates and extends previous FedAvg and FedVARP analyses to heterogeneous client participation; ii) it underscores how the least participating client influences convergence error; iii) it provides practical guidelines to best exploit stale updates, showing that their usefulness diminishes as data heterogeneity decreases and participation heterogeneity increases. Extensive experiments featuring diverse levels of client data and participation heterogeneity not only confirm these findings but also show that FedStale outperforms both FedAvg and FedVARP in many settings.

Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). Builds on 30 of its 40 references that are in the map. First posted on arXiv 7 May 2024.

Builds on

30 of 40 references.

References · 30

  1. 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,669
  2. 2019Advances and Open Problems in Federated Learningcited by 3,046
  3. 2018Federated Optimization in Heterogeneous Networkscited by 2,987
  4. 2016Federated Learning: Strategies for Improving Communication Efficiencycited by 1,475
  5. 2019On the Convergence of FedAvg on Non-IID Datacited by 1,229
  6. 2020Adaptive Federated Optimizationcited by 1,046
  7. 2020Tackling the Objective Inconsistency Problem in Heterogeneous Federated Optimizationcited by 906
  8. 2019Towards Federated Learning at Scale: System Designcited by 832
  9. 2014Convex Optimization: Algorithms and Complexitycited by 575
  10. 2021Federated Learning Based on Dynamic Regularizationcited by 562
  11. 2019Clustered Federated Learning: Model-Agnostic Distributed Multi-Task Optimization under Privacy Constraintscited by 503
  12. 2014SAGA: A Fast Incremental Gradient Method With Support for Non-Strongly Convex Composite Objectivescited by 402
18 more
  1. 2021A Field Guide to Federated Optimizationcited by 315
  2. 2018SPIDER: Near-Optimal Non-Convex Optimization via Stochastic Path Integrated Differential Estimatorcited by 287
  3. 2017SARAH: A Novel Method for Machine Learning Problems Using Stochastic Recursive Gradientcited by 220
  4. 2021Achieving Linear Speedup with Partial Worker Participation in Non-IID Federated Learningcited by 193
  5. 2019A Survey on Distributed Machine Learningcited by 188
  6. 2013Minimizing Finite Sums with the Stochastic Average Gradientcited by 164
  7. 2020Optimal Client Sampling for Federated Learningcited by 124
  8. 2021Clustered Sampling: Low-Variance and Improved Representativity for Clients Selection in Federated Learningcited by 93
  9. 2021Fast Federated Learning in the Presence of Arbitrary Device Unavailabilitycited by 72
  10. 2022FedVARP: Tackling the Variance Due to Partial Client Participation in Federated Learningcited by 64
  11. 2017Non-convex Finite-Sum Optimization Via SCSG Methodscited by 61
  12. 2022A Unified Analysis of Federated Learning with Arbitrary Client Participationcited by 45
  13. 2021Anarchic Federated Learningcited by 42
  14. 2023On the Convergence of Federated Averaging with Cyclic Client Participationcited by 31
  15. 2022Federated Learning Under Intermittent Client Availability and Time-Varying Communication Constraintscited by 30
  16. 2020Federated Learning under Importance Samplingcited by 26
  17. 2023Federated Learning under Heterogeneous and Correlated Client Availabilitycited by 18
  18. 2022A General Theory for Federated Optimization with Asynchronous and Heterogeneous Clients Updatescited by 17

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 1; 2026: 4.

5 papers.