Achieving Optimal Breakdown Point for Byzantine Robust Gossip in Decentralized Machine Learning

This paper presents CG+, a novel decentralized machine learning algorithm that achieves optimal robustness against Byzantine node failures in sparse networks by effectively leveraging a new clipping threshold strategy for robust gossip communication.