Cited by 12Privacy-Preserving Technologies in DataAdversarial Robustness in Machine LearningCryptography and Data Security

The DOI matches its Crossref record; the references it cites are not checked yet.

Meta-federated learning

Open access
Aramoon, Omid, Chen, Pin-Yu, Qu, Gang, Tian, Yuan·2024·Federated Learning

Overview

Integrity signals

Registry

Crossref · 10.1016/b978-0-44-319037-7.00017-x

Cites

Statistics

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

Verification

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?

Citations

The citation lists haven’t been fetched yet

References 41 · Cited by 12

Research works printed but not linked: 1

  1. Weiszfeld, 1937, Sur le point pour lequel la somme des distances de n points donnés est minimum, Tohoku Mathematical Journal, First Series, 43, 355

Metadata

Authors
Aramoon, O., Chen, P.-Y., Qu, G., & Tian, Y.
Affiliations
  • University of Maryland, College Park (US)
  • IBM (United States) (US)
  • University of Virginia (US)
Venue
Federated Learning
Publisher
Elsevier
Published
2024
Pages
161-179
OpenAlex
W3127875616
Cited by
12
References
41
Citations by year
2026: 2 · 2025: 3 · 2024: 4
FWCI
5.92
Type
book chapter
Language
en
Open access
Locations
  • Elsevier eBooks (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • arXiv (Cornell University)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Privacy-Preserving Technologies in Data
  • Physical Sciences › Computer Science › Artificial Intelligence › Adversarial Robustness in Machine Learning
  • Physical Sciences › Computer Science › Computer Networks and Communications › Cryptography and Data Security
Keywords
federated learning, backdoor attacks, secure aggregation, adversarial attacks, adversarial triggers, privacy-preserving machine learning, robustness

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