A Robust Classification Framework for Byzantine-Resilient Stochastic Gradient Descent

Shashank Reddy Chirra, Kalyan Varma Nadimpalli, Shrisha Rao
1/16/2023
cs.LGcs.AIcs.DC

No confident code implementation found for this paper.

Abstract

This paper proposes a Robust Gradient Classification Framework (RGCF) for Byzantine fault tolerance in distributed stochastic gradient descent. The framework consists of a pattern recognition filter which we train to be able to classify individual gradients as Byzantine by using their direction alone. This filter is robust to an arbitrary number of Byzantine workers for convex as well as non-convex optimisation settings, which is a significant improvement on the prior work that is robust to Byzantine faults only when up to 50% of the workers are Byzantine. This solution does not require an estimate of the number of Byzantine workers; its running time is not dependent on the number of workers and can scale up to training instances with a large number of workers without a loss in performance. We validate our solution by training convolutional neural networks on the MNIST dataset in the presence of Byzantine workers.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{chirra2023robust,
  title  = {A Robust Classification Framework for Byzantine-Resilient Stochastic Gradient Descent},
  author = {Shashank Reddy Chirra and Kalyan Varma Nadimpalli and Shrisha Rao},
  year   = {2023},
  eprint = {2301.07498},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2301.07498v1}
}

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/2301.07498.svg)](https://codeofpaper.com/paper/2301.07498)

Discussion