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

Romoa: Robust Model Aggregation for the Resistance of Federated Learning to Model Poisoning Attacks

Mao, Yunlong, Yuan, Xinyu, Zhao, Xinyang, Zhong, Sheng·2021·Lecture Notes in Computer Science

Integrity signals

Registry

Crossref · 10.1007/978-3-030-88418-5_23

Cites

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

  • Statistical methods such as Euclidean distance, cosine similarity, k-means, and Pearson correlation coefficient can be used to measure differences between benign and malicious models.

    “The first one is a similarity-based malicious model detection algorithm, which considers that statistical methods (such as euclidean distance [40], [52], cosine similarity [37], [38], k-means [46], Pearson correlation coefficient [49], [51], etc.) can be used to measure the differences between benign and malicious models [36], [80].”

    From Poisoning attacks in federated learning: A survey (2023) · cites this paper as [37]

Cites

Flagged first, then by citations

3 of the 39 references couldn’t be matched to a known paper.

Cited by

Sorted by citations

Authors
Mao, Y., Yuan, X., Zhao, X., & Zhong, S.
Affiliations
Nanjing University (CN)
Corresponding author
Mao, Yunlong
Venue
Lecture Notes in Computer Science
Published
2021
Pages
476-496
ISSN
  • 0302-9743 (ISSN-L)
  • 1611-3349
OpenAlex
W3201824817
Cited by
48
References
39
Citations by year
2026: 2 · 2025: 10 · 2024: 15 · 2023: 16 · 2022: 5
FWCI
4.16
Type
conference paper
Language
en
Open access
closed
Locations
Lecture notes in computer science (publishedVersion)
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 › Artificial Intelligence › Cryptography and Data Security
Keywords
federated learning, model poisoning, Byzantine-robust aggregation, attack detection, similarity measurement, privacy-preserving machine 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