TernaryVote: Differentially Private, Communication Efficient, and Byzantine Resilient Distributed Optimization on Heterogeneous Data

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteurs principaux: Jin, Richeng, Gu, Yujie, Yue, Kai, He, Xiaofan, Zhang, Zhaoyang, Dai, Huaiyu
Format: Preprint
Publié: 2024
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866914681945325568
author Jin, Richeng
Gu, Yujie
Yue, Kai
He, Xiaofan
Zhang, Zhaoyang
Dai, Huaiyu
author_facet Jin, Richeng
Gu, Yujie
Yue, Kai
He, Xiaofan
Zhang, Zhaoyang
Dai, Huaiyu
contents Distributed training of deep neural networks faces three critical challenges: privacy preservation, communication efficiency, and robustness to fault and adversarial behaviors. Although significant research efforts have been devoted to addressing these challenges independently, their synthesis remains less explored. In this paper, we propose TernaryVote, which combines a ternary compressor and the majority vote mechanism to realize differential privacy, gradient compression, and Byzantine resilience simultaneously. We theoretically quantify the privacy guarantee through the lens of the emerging f-differential privacy (DP) and the Byzantine resilience of the proposed algorithm. Particularly, in terms of privacy guarantees, compared to the existing sign-based approach StoSign, the proposed method improves the dimension dependence on the gradient size and enjoys privacy amplification by mini-batch sampling while ensuring a comparable convergence rate. We also prove that TernaryVote is robust when less than 50% of workers are blind attackers, which matches that of SIGNSGD with majority vote. Extensive experimental results validate the effectiveness of the proposed algorithm.
format Preprint
id arxiv_https___arxiv_org_abs_2402_10816
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle TernaryVote: Differentially Private, Communication Efficient, and Byzantine Resilient Distributed Optimization on Heterogeneous Data
Jin, Richeng
Gu, Yujie
Yue, Kai
He, Xiaofan
Zhang, Zhaoyang
Dai, Huaiyu
Machine Learning
Cryptography and Security
Distributed, Parallel, and Cluster Computing
Signal Processing
Distributed training of deep neural networks faces three critical challenges: privacy preservation, communication efficiency, and robustness to fault and adversarial behaviors. Although significant research efforts have been devoted to addressing these challenges independently, their synthesis remains less explored. In this paper, we propose TernaryVote, which combines a ternary compressor and the majority vote mechanism to realize differential privacy, gradient compression, and Byzantine resilience simultaneously. We theoretically quantify the privacy guarantee through the lens of the emerging f-differential privacy (DP) and the Byzantine resilience of the proposed algorithm. Particularly, in terms of privacy guarantees, compared to the existing sign-based approach StoSign, the proposed method improves the dimension dependence on the gradient size and enjoys privacy amplification by mini-batch sampling while ensuring a comparable convergence rate. We also prove that TernaryVote is robust when less than 50% of workers are blind attackers, which matches that of SIGNSGD with majority vote. Extensive experimental results validate the effectiveness of the proposed algorithm.
title TernaryVote: Differentially Private, Communication Efficient, and Byzantine Resilient Distributed Optimization on Heterogeneous Data
topic Machine Learning
Cryptography and Security
Distributed, Parallel, and Cluster Computing
Signal Processing
url https://arxiv.org/abs/2402.10816