A Nesterov-Accelerated Byzantine-Robust Federated Learning

arXiv:2511.02657v2 Announce Type: replace Abstract: We investigate robust federated learning, where a group of workers collaboratively train a shared model under the orchestration of a central server in the presence of Byzantine adversaries capable of arbitrary and potentially malicious behaviors. To simultaneously enhance communication efficiency and resilience against such adversaries, we propose a Byzantine-resilient Nesterov-accelerated federated learning (Byrd-NAFL) algorithm. Byrd-NAFL seamlessly integrates Nesterov's momentum into the federated learning process alongside Byzantine-resilient aggregation rules to achieve fast and safe convergence against gradient corruption. We establish a finite-time convergence guarantee for Byrd-NAFL under non-convex and smooth loss functions with relaxed assumptions on the aggregated gradients. Extensive numerical experiments validate the effectiveness of Byrd-NAFL and demonstrate the superiority over existing benchmarks in terms of convergence speed, accuracy, and resilience to diverse malicious attacks.

Related

• Byzantine-Robust Federated Learning with Learnable Aggregation Weights
• SketchGuard: Scaling Byzantine-Robust Decentralized Federated Learning via Sketch-Based Screening
• Tight Stability Bounds for Robust Distributed Learning: Byzantine Failures Hurt Generalization More than Data Poisoning
• Delayed Momentum Aggregation: Communication-efficient Byzantine-robust Federated Learning with Partial Participation

Source: arXiv cs.LG | 2026-09-04