mlsanityData to 7 Oct 2026

LEGATO: A LayerwisE Gradient AggregaTiOn Algorithm for Mitigating Byzantine Attacks in Federated Learning

arXiv 2107.12490 ↗First posted 26 Jul 2021cs.LG cs.CR cs.DCcited by 4

Not on the map. Why?

Abstract (arXiv)

Federated learning has arisen as a mechanism to allow multiple participants to collaboratively train a model without sharing their data. In these settings, participants (workers) may not trust each other fully; for instance, a set of competitors may collaboratively train a machine learning model to detect fraud. The workers provide local gradients that a central server uses to update a global model. This global model can be corrupted when Byzantine workers send malicious gradients, which necessitates robust methods for aggregating gradients that mitigate the adverse effects of Byzantine inputs. Existing robust aggregation algorithms are often computationally expensive and only effective under strict assumptions. In this paper, we introduce LayerwisE Gradient AggregatTiOn (LEGATO), an aggregation algorithm that is, by contrast, scalable and generalizable. Informed by a study of layer-specific responses of gradients to Byzantine attacks, LEGATO employs a dynamic gradient reweighing scheme that is novel in its treatment of gradients based on layer-specific robustness. We show that LEGATO is more computationally efficient than multiple state-of-the-art techniques and more generally robust across a variety of attack settings in practice. We also demonstrate LEGATO's benefits for gradient descent convergence in the absence of an attack.

Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 27 of its 39 references that are in the map. First posted on arXiv 26 Jul 2021.

Builds on

27 of 39 references.

References · 27

  1. 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,592
  2. 2018Federated Optimization in Heterogeneous Networkscited by 2,971
  3. 2018Federated Learning with Non-IID Datacited by 1,099
  4. 2018Byzantine-Robust Distributed Learning: Towards Optimal Statistical Ratescited by 698
  5. 2020Federated Learning with Matched Averagingcited by 564
  6. 2018The Hidden Vulnerability of Distributed Learning in Byzantiumcited by 324
  7. 2019Robust Aggregation for Federated Learningcited by 314
  8. 2015Federated Optimization:Distributed Optimization Beyond the Datacentercited by 193
  9. 2018Mitigating Sybils in Federated Learning Poisoningcited by 158
  10. 2019Fall of Empires: Breaking Byzantine-tolerant SGD by Inner Product Manipulationcited by 136
  11. 2018Generalized Byzantine-tolerant SGDcited by 94
  12. 2019Are All Layers Created Equal?cited by 94
15 more
  1. 2016Learning from Untrusted Datacited by 90
  2. 2019Robust Federated Learning in a Heterogeneous Environmentcited by 88
  3. 2018DRACO: Byzantine-resilient Distributed Training via Redundant Gradientscited by 74
  4. 2019Byzantine-Robust Federated Machine Learning through Adaptive Model Averagingcited by 70
  5. 2018Lagrange Coded Computing: Optimal Design for Resiliency, Security and Privacycited by 66
  6. 2017Distributed Statistical Machine Learning in Adversarial Settings: Byzantine Gradient Descentcited by 59
  7. 2020IBM Federated Learning: an Enterprise Framework White Paper V0.1cited by 57
  8. 2019DETOX: A Redundancy-based Framework for Faster and More Robust Gradient Aggregationcited by 44
  9. 2019Attack-Resistant Federated Learning with Residual-based Reweightingcited by 40
  10. 2017Constant Approximation for k-Median and k-Means with Outliers via Iterative Roundingcited by 25
  11. 2017Byzantine-Tolerant Machine Learningcited by 18
  12. 2019Data Encoding for Byzantine-Resilient Distributed Optimizationcited by 10
  13. 2020Distributed Momentum for Byzantine-resilient Learningcited by 10
  14. 2018Asynchronous Byzantine Machine Learning (the case of SGD)cited by 7
  15. 2020Client Adaptation improves Federated Learning with Simulated Non-IID Clientscited by 3

Built on by

Cited by year

Citing papers per year: 2022: 1; 2023: 2; 2024: 1.

4 papers.