Communication-Efficient Byzantine-Resilient Federated Zero-Order Optimization

Afonso de Sá Delgado Neto, Maximilian Egger, Mayank Bakshi, Rawad Bitar
6/20/2024
cs.LGcs.AI

No confident code implementation found for this paper.

Abstract

We introduce CYBER-0, the first zero-order optimization algorithm for memory-and-communication efficient Federated Learning, resilient to Byzantine faults. We show through extensive numerical experiments on the MNIST dataset and finetuning RoBERTa-Large that CYBER-0 outperforms state-of-the-art algorithms in terms of communication and memory efficiency while reaching similar accuracy. We provide theoretical guarantees on its convergence for convex loss functions.

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{neto2024communicationefficient,
  title  = {Communication-Efficient Byzantine-Resilient Federated Zero-Order Optimization},
  author = {Afonso de Sá Delgado Neto and Maximilian Egger and Mayank Bakshi and Rawad Bitar},
  year   = {2024},
  eprint = {2406.14362},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2406.14362v1}
}

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

Discussion