A survey for federated learning evaluations: Goals and measures
Open accessAbstract
Evaluation is a systematic approach to assessing how well a system achieves its intended purpose. Federated learning (FL) is a novel paradigm for privacy-preserving machine learning that allows multiple parties to collaboratively train models without sharing sensitive data. However, evaluating FL is challenging due to its interdisciplinary nature and diverse goals, such as utility, efficiency, and security. In this survey, we first review the major evaluation goals adopted in the existing studies and then explore the evaluation metrics used for each goal. We also introduceFedEval, an open-source platform that provides a standardized and comprehensive evaluation framework for FL algorithms in terms of their utility, efficiency, and security. Finally, we discuss several challenges and future research directions for FL evaluation.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
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 systems in healthcare must manage varying computational resources across devices, creating demand for transformable, lightweight algorithms.
“FL systems in healthcare must manage varying computational resources across devices, such as cutting-edge servers in hospitals in comparison to low-power IoT devices used in remote monitoring, creating demand for transformable, lightweight algorithms [22].”
From Federated Learning in Smart Healthcare: A Comprehensive Review on Privacy, Security, and Predictive Analytics with IoT Integration (2024) · cites this paper as [22]
The citation lists haven’t been fetched yet
References 118 · Cited by 64
- Authors
- Chai, D., Wang, L., Yang, L., Zhang, J., Chen, K., & Yang, Q.
- Affiliations
- Hong Kong University of Science and Technology (HK)
- Peking University (CN)
- Hong Kong University of Science and Technology, Hong Kong, China
- Venue
- IEEE Transactions on Knowledge and Data Engineering
- Published
- 2024-10
- Volume
- 36
- Issue
- 10
- Pages
- 5007-5024
- ISSN
- 1041-4347 (ISSN-L)
- 1558-2191
- 2326-3865
- OpenAlex
- W4393241167
- Cited by
- 64
- References
- 118
- Citations by year
- 2026: 27 · 2025: 29 · 2024: 7 · 2023: 1
- FWCI
- 9.30
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Licence
- Locations
- IEEE Transactions on Knowledge and Data Engineering (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- Rare & Special e-Zone (The Hong Kong University of Science and Technology) (submittedVersion)
- arXiv (Cornell University)
- Funders
- Key-Area Research and Development Program of Guangdong Province (2021B0101400001)
- Hong Kong (RGC TRS T41-603/20R)
- National Key Research and Development Program of China (2018AAA0101100)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Privacy-Preserving Technologies in Data
- Physical Sciences › Computer Science › Artificial Intelligence › Machine Learning and Data Classification
- Physical Sciences › Computer Science › Artificial Intelligence › Stochastic Gradient Optimization Techniques
- Keywords
- federated learning, evaluation metrics, evaluation goals, privacy-preserving machine learning, utility, efficiency, security (computing)
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