mlsanityData to 14 Oct 2026

TESSERACT: Gradient Flip Score to Secure Federated Learning Against Model Poisoning Attacks

arXiv 2110.10108 ↗First posted 19 Oct 2021cs.LGcited by 3

Not on the map. Why?

Abstract (arXiv)

Federated learning---multi-party, distributed learning in a decentralized environment---is vulnerable to model poisoning attacks, even more so than centralized learning approaches. This is because malicious clients can collude and send in carefully tailored model updates to make the global model inaccurate. This motivated the development of Byzantine-resilient federated learning algorithms, such as Krum, Bulyan, FABA, and FoolsGold. However, a recently developed untargeted model poisoning attack showed that all prior defenses can be bypassed. The attack uses the intuition that simply by changing the sign of the gradient updates that the optimizer is computing, for a set of malicious clients, a model can be diverted from the optima to increase the test error rate. In this work, we develop TESSERACT---a defense against this directed deviation attack, a state-of-the-art model poisoning attack. TESSERACT is based on a simple intuition that in a federated learning setting, certain patterns of gradient flips are indicative of an attack. This intuition is remarkably stable across different learning algorithms, models, and datasets. TESSERACT assigns reputation scores to the participating clients based on their behavior during the training phase and then takes a weighted contribution of the clients. We show that TESSERACT provides robustness against even a white-box version of the attack.

Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 12 of its 20 references that are in the map. First posted on arXiv 19 Oct 2021.

Builds on

12 of 20 references.

References · 12

  1. 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,669
  2. 2019On the Convergence of FedAvg on Non-IID Datacited by 1,229
  3. 2018LEAF: A Benchmark for Federated Settingscited by 792
  4. 2018Byzantine-Robust Distributed Learning: Towards Optimal Statistical Ratescited by 711
  5. 2017Federated Multi-Task Learningcited by 672
  6. 2018Local SGD Converges Fast and Communicates Littlecited by 605
  7. 2019Local Model Poisoning Attacks to Byzantine-Robust Federated Learningcited by 493
  8. 2018Sparsified SGD with Memorycited by 376
  9. 2020FLTrust: Byzantine-robust Federated Learning via Trust Bootstrappingcited by 346
  10. 2018The Hidden Vulnerability of Distributed Learning in Byzantiumcited by 329
  11. 2018Parallel Restarted SGD with Faster Convergence and Less Communication: Demystifying Why Model Averaging Works for Deep Learningcited by 278
  12. 2017Towards Poisoning of Deep Learning Algorithms with Back-gradient Optimizationcited by 197

Built on by

Cited by year

Citing papers per year: 2022: 1; 2023: 0; 2024: 1; 2025: 1.

3 papers.