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

A Performance Evaluation of Federated Learning Algorithms

Open access
Nilsson, Adrian, Smith, Simon, Ulm, Gregor, Gustavsson, Emil, Jirstrand, Mats·2018·Proceedings of the Second Workshop on Distributed Infrastructures for Deep Learning

Abstract

Federated learning is an approach to distributed machine learning where a global model is learned by aggregating models that have been trained locally on data-generating clients. Contrary to centralized optimization, clients can be very large in number and face challenges of data and network heterogeneity. Examples of clients include smartphones and connected vehicles, which highlights the practical relevance of federated learning. We benchmark three federated learning algorithms and compare their performance against a centralized approach where data resides on the server. The algorithms Federated Averaging (FedAvg), Federated Stochastic Variance Reduced Gradient, and CO-OP are evaluated on the MNIST dataset, using both i.i.d. and non-i.i.d. partitionings of the data. Our results show that FedAvg achieves the highest accuracy among the federated algorithms, regardless of how data was partitioned. Our comparison between FedAvg and centralized learning shows that they are practically equivalent when i.i.d. data is used. However, the centralized approach outperforms FedAvg with non-i.i.d. data.

Integrity signals

Registry

Crossref · 10.1145/3286490.3286559

Cites

10 of 10 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?

  • Federated learning provides an alternative paradigm for accurate and generalizable machine learning by only sharing numerical model updates from decentralized data.

    “Federated ML (FL) provides an alternative paradigm for accurate and generalizable ML, by only sharing numerical model updates.”
  • The three algorithms were evaluated on MINIST dataset with non-i.i.d. and i.i.d. partitioning of data.

    “These algorithms were evaluated on MINIST dataset with the use of non-i.i.d. and i.i.d.partitioning of data.”
  • Nilsson et al. benchmarked three FL algorithms: FedAvg, CO-OP, and Federated-Stochastic Variance Reduced Gradient.

    “Nilsson et al. benchmarked three FL algorithms.They compared the performance of these three algorithms by residing the data on the server [125].The algorithms include federated averaging (FedAvg), CO-OP, and Federated-Stochastic Variance Reduced Gradient.”
  • FedAvg resulted as the highest accuracy algorithm among all three.

    “The research resulted in FedAvg as the highest accuracy algorithm among all.”
  • FedAvg achieves the highest accuracy of 98% among FedAvg, CO-OP, and Federated Stochastic Variance Reduced Gradient on MNIST, regardless of data partitioning.

    “FedAvg achieves the highest accuracy of 98% among these algorithms, regardless of the manner of data partitioning.”

Cites

Flagged first, then by citations

2 of the 12 references couldn’t be matched to a known paper.

Cited by

Sorted by citations

Authors
Nilsson, A., Smith, S., Ulm, G., Gustavsson, E., & Jirstrand, M.
Affiliations
Fraunhofer Chalmers Research Centre for Industrial Mathematics (SE)
Venue
Proceedings of the Second Workshop on Distributed Infrastructures for Deep Learning
Publisher
ACM
Published
2018-12-10
Pages
1-8
OpenAlex
W2900594532
Cited by
328
References
12
Citations by year
2026: 31 · 2025: 52 · 2024: 80 · 2023: 68 · 2022: 51 · 2021: 24 · 2020: 15 · 2019: 7
FWCI
4.68
Type
conference paper
Language
en
Open access
Locations
  • Publikationsdatenbank der Fraunhofer-Gesellschaft (Fraunhofer-Gesellschaft) (submittedVersion)
  • Fraunhofer-Publica (Fraunhofer-Gesellschaft) (submittedVersion)
  • Chalmers Research (Chalmers University of Technology) (submittedVersion)
Funders
VINNOVA (2016-04260)
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, FedAvg, co-ops, centralized learning, non-IID data, data heterogeneity, network heterogeneity, MNIST, distributed learning

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