Cited by 229Privacy-Preserving Technologies in DataStochastic Gradient Optimization TechniquesDomain Adaptation and Few-Shot Learning

Tackling System and Statistical Heterogeneity for Federated Learning with Adaptive Client Sampling

Open access
Luo, Bing, Xiao, Wenli, Wang, Shiqiang, Huang, Jianwei, Tassiulas, Leandros·2022·IEEE INFOCOM 2022 - IEEE Conference on Computer Communications

Abstract

Federated learning (FL) algorithms usually sample a fraction of clients in each round (partial participation) when the number of participants is large and the server’s communication bandwidth is limited. Recent works on the convergence analysis of FL have focused on unbiased client sampling, e.g., sampling uniformly at random, which suffers from slow wall-clock time for convergence due to high degrees of system heterogeneity and statistical heterogeneity. This paper aims to design an adaptive client sampling algorithm that tackles both system and statistical heterogeneity to minimize the wall-clock convergence time. We obtain a new tractable convergence bound for FL algorithms with arbitrary client sampling probabilities. Based on the bound, we analytically establish the relationship between the total learning time and sampling probabilities, which results in a non-convex optimization problem for training time minimization. We design an efficient algorithm for learning the unknown parameters in the convergence bound and develop a low-complexity algorithm to approximately solve the non-convex problem. Experimental results from both hardware prototype and simulation demonstrate that our proposed sampling scheme significantly reduces the convergence time compared to several baseline sampling schemes. Notably, our scheme in hardware prototype spends 73% less time than the uniform sampling baseline for reaching the same target loss.

Integrity signals

Registry

Crossref · 10.1109/infocom48880.2022.9796935

Cites

35 of 35 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • When time-division multiple-access (TDMA) protocols are considered, clients selected and scheduled earlier for model uploading could suffer from substantially shorter local model training time in a communication round and produce premature local models.

    “When time-division multiple-access (TDMA) protocols are considered for clients to upload their local models, clients selected and scheduled earlier for model uploading could suffer from substantially shorter local model training time in a communication round and produce premature local models [179].”

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Luo, B., Xiao, W., Wang, S., Huang, J., & Tassiulas, L.
Affiliations
  • Yale University (US)
  • Chinese University of Hong Kong, Shenzhen (CN)
  • IBM (United States) (US)
Venue
IEEE INFOCOM 2022 - IEEE Conference on Computer Communications
Publisher
IEEE
Published
2022-05-02
Pages
1739-1748
OpenAlex
W4226183928
Cited by
229
References
35
Citations by year
2026: 23 · 2025: 74 · 2024: 68 · 2023: 55 · 2022: 9
FWCI
28.46
Type
conference paper
Language
en
Open access
Locations
  • IEEE Conference on Computer Communications (INFOCOM) (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • arXiv (Cornell University)
Funders
University of Hong Kong
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Privacy-Preserving Technologies in Data
  • Physical Sciences › Computer Science › Artificial Intelligence › Stochastic Gradient Optimization Techniques
  • Physical Sciences › Computer Science › Artificial Intelligence › Domain Adaptation and Few-Shot Learning
Keywords
federated learning, statistical heterogeneity, system heterogeneity, convergence analysis, convergence bounds, training time reduction, non-convex optimization, partial participation, communication bandwidth

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review