FedStale: leveraging stale client updates in federated learning
Angelo Rodio, Giovanni Neglia

TL;DR
FedStale introduces a new federated learning algorithm that optimally combines fresh and stale client updates, improving convergence and performance in heterogeneous participation scenarios.
Contribution
The paper proposes FedStale, a novel algorithm that adaptively combines stale and fresh updates, extending existing methods to handle heterogeneous client participation effectively.
Findings
FedStale outperforms FedAvg and FedVARP in various heterogeneity settings.
The usefulness of stale updates decreases with less data heterogeneity and more participation heterogeneity.
The analysis reveals how the least participating client impacts convergence error.
Abstract
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAccess Control and Trust
