mlsanityData to 7 Oct 2026

Can We Trust the Similarity Measurement in Federated Learning?

arXiv 2311.03369 ↗First posted 20 Oct 2023cs.LG cs.AI cs.CRcited by 1

Not on the map. Why?

Abstract (arXiv)

Is it secure to measure the reliability of local models by similarity in federated learning (FL)? This paper delves into an unexplored security threat concerning applying similarity metrics, such as the L_2 norm, Euclidean distance, and cosine similarity, in protecting FL. We first uncover the deficiencies of similarity metrics that high-dimensional local models, including benign and poisoned models, may be evaluated to have the same similarity while being significantly different in the parameter values. We then leverage this finding to devise a novel untargeted model poisoning attack, Faker, which launches the attack by simultaneously maximizing the evaluated similarity of the poisoned local model and the difference in the parameter values. Experimental results based on seven datasets and eight defenses show that Faker outperforms the state-of-the-art benchmark attacks by 1.1-9.0X in reducing accuracy and 1.2-8.0X in saving time cost, which even holds for the case of a single malicious client with limited knowledge about the FL system. Moreover, Faker can degrade the performance of the global model by attacking only once. We also preliminarily explore extending Faker to other attacks, such as backdoor attacks and Sybil attacks. Lastly, we provide a model evaluation strategy, called the similarity of partial parameters (SPP), to defend against Faker. Given that numerous mechanisms in FL utilize similarity metrics to assess local models, this work suggests that we should be vigilant regarding the potential risks of using these metrics.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 22 of its 52 references that are in the map. First posted on arXiv 20 Oct 2023.

Builds on

22 of 52 references.

References · 22

  1. 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,592
  2. 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,283
  3. 2018Federated Learning with Non-IID Datacited by 1,099
  4. 2018How To Backdoor Federated Learningcited by 745
  5. 2018Byzantine-Robust Distributed Learning: Towards Optimal Statistical Ratescited by 698
  6. 2020FLTrust: Byzantine-robust Federated Learning via Trust Bootstrappingcited by 330
  7. 2018The Hidden Vulnerability of Distributed Learning in Byzantiumcited by 324
  8. 2019A Little Is Enough: Circumventing Defenses For Distributed Learningcited by 285
  9. 2019Can You Really Backdoor Federated Learning?cited by 250
  10. 2018Mitigating Sybils in Federated Learning Poisoningcited by 158
  11. 2021Clustered Sampling: Low-Variance and Improved Representativity for Clients Selection in Federated Learningcited by 93
  12. 2019Zeno++: Robust Fully Asynchronous SGDcited by 53
10 more
  1. 2021SparseFed: Mitigating Model Poisoning Attacks in Federated Learning with Sparsificationcited by 46
  2. 2021Challenges and Approaches for Mitigating Byzantine Attacks in Federated Learningcited by 46
  3. 2021Untargeted Poisoning Attack Detection in Federated Learning via Behavior Attestationcited by 12
  4. 2021New Metrics to Evaluate the Performance and Fairness of Personalized Federated Learningcited by 11
  5. 2023G2uardFL: Safeguarding Federated Learning Against Backdoor Attacks through Attributed Client Graph Clusteringcited by 9
  6. 2023A Four-Pronged Defense Against Byzantine Attacks in Federated Learningcited by 9
  7. 2020Secure and Fault Tolerant Decentralized Learningcited by 6
  8. 2023Proof-of-Contribution-Based Design for Collaborative Machine Learning on Blockchaincited by 5
  9. 2023Kick Bad Guys Out! Conditionally Activated Anomaly Detection in Federated Learning with Zero-Knowledge Proof Verificationcited by 2
  10. 2023Avoid Adversarial Adaption in Federated Learning by Multi-Metric Investigationscited by 1

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 1.

1 paper.