cs.LGNov 17, 2026

Projected Penalty-Gradient Tracking for Communication-Efficient Byzantine-Resilient Federated Learning

Authors: Yanjie Dong

Abstract

We investigate communication-efficient federated learning over heterogeneous datasets in the presence of Byzantine adversaries capable of uploading arbitrary information. Penalty-based methods bound the influence of each worker through the bounded gradient of a penalty function; however, the bound is lost once the uploads are compressed, since a Byzantine worker can accumulate an unbounded state at the server. To retain the Byzantine resilience under compressed uploads, we propose a projected penalty-gradient tracking framework, where each honest worker uploads a compressed residual of its penalty gradient and the server projects each reconstructed state onto the known penalty-gradient ball. The framework accommodates any contractive compressor and yields two algorithms: fault-resilient proximal gradient with consistent sparsification (FRPG-CS), whose shared mask is protected by freshly drawn reserve rows, and lazily aggregated FRPG (LAG-FRPG), whose uploads are event-triggered. For smooth and strongly convex losses, we establish a finite-time bound on the expected objective gap, where the Byzantine error floor is independent of the compressor and the compression error decays faster than the optimization error. We also bound the expected number of lazy uploads and derive certificates that separate the finite-penalty model bias from the optimization error. Experiments on MNIST and Fashion-MNIST show that the proposed algorithms attain the highest accuracy among twelve methods under the Min-Max attack, whereas a compressed-momentum benchmark and a local-update benchmark remain preferable in attack-free accuracy and total traffic, respectively.

Figures & tables

Appendix figures & tables2 assets

Supplementary material from the paper’s appendix.

Appendix

Explore similar work

CardsList
  1. A Byzantine-Robust Federated Learning with Nesterov Momentum

    Nov 4, 2025Lihan Xu, Xiaoyi Fan, Gang Wang +3Federated Learning AggregationByzantine-Robust Federated Learning

  2. Optimal Byzantine-resilient Federated Learning with User-level Differential Privacy

    Nov 7, 2026Ming Xiang, Stratis Ioannidis, Edmund Yeh +2Federated LearningByzantine-Robust Federated Learning

  3. Byzantine-Robust and Differentially Private Federated Optimization under Weaker Assumptions

    Mar 24, 2026Rustem Islamov, Grigory Malinovsky, Alexander Gaponov +3Byzantine-Robust Federated LearningDifferentially Private Federated Learning