A Little Is Enough: Circumventing Defenses For Distributed Learning

Moran Baruch, Gilad Baruch, Yoav Goldberg
2/16/2019
cs.LGcs.CRcs.DC

Official code: moranant/attacking_distributed_learning (29 stars, last commit 2023-06-29).

Abstract

Distributed learning is central for large-scale training of deep-learning models. However, they are exposed to a security threat in which Byzantine participants can interrupt or control the learning process. Previous attack models and their corresponding defenses assume that the rogue participants are (a) omniscient (know the data of all other participants), and (b) introduce large change to the parameters. We show that small but well-crafted changes are sufficient, leading to a novel non-omniscient attack on distributed learning that go undetected by all existing defenses. We demonstrate our attack method works not only for preventing convergence but also for repurposing of the model behavior (backdooring). We show that 20% of corrupt workers are sufficient to degrade a CIFAR10 model accuracy by 50%, as well as to introduce backdoors into MNIST and CIFAR10 models without hurting their accuracy

View on arXivView PDF

Code Implementations(1)

An implementation for the paper "A Little Is Enough: Circumventing Defenses For Distributed Learning" (NeurIPS 2019)

296PythonOct 27, 20193 years ago

Cite this paper

@article{baruch2019little,
  title  = {A Little Is Enough: Circumventing Defenses For Distributed Learning},
  author = {Moran Baruch and Gilad Baruch and Yoav Goldberg},
  year   = {2019},
  eprint = {1902.06156},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/1902.06156}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/1902.06156.svg)](https://codeofpaper.com/paper/1902.06156)

Discussion