The paper introduces Byrd-NAFL, a Byzantine‑robust federated learning algorithm that incorporates Nesterov momentum at the server while keeping workers stateless. It applies any soft γ‑Byzantine resilient aggregation rule and provides finite‑time convergence guarantees for smooth non‑convex losses across all momentum factors β∈[0,1). Experiments on MNIST, CIFAR‑10, and Sentiment140 demonstrate faster convergence and higher accuracy than existing benchmarks under various attacks.
By Lihan Xu, Xiaoyi Fan, Gang Wang, Runhao Zeng, Xiping Hu, Yanjie Dong
arXiv:2609.07312v1 Announce Type: new
Abstract: This paper proposes a robust decentralized personalized federated learning method R-DPFL, that enables clients to reduce the impact of Byzantine attack...
By Xiao Ma, Hong Shen, Hui Tian, Wenqi Lyu, Wei Ke
arXiv:2608.21137v1 Announce Type: new
Abstract: Decentralized Federated Learning (DFL) promises trust-free collaborative learning by replacing the centralized parameter server with peer-to-peer model...
By Mouhamed Amine Bouchiha, Gregory Blanc, Yufei Han
Federated learning distributes data among $n$ clients, making it vulnerable to malicious attacks and data heterogeneity, which together pose challenges for robust learning. To tackle this issue, centered clipping and Huber aggregators have been exploited for Byzantine robustness.
arXiv:2607. 10970v1 Announce Type: new Abstract: Federated learning distributes data among $n$ clients, making it vulnerable to malicious attacks and data heterogeneity, which together pose challenges for robust learning.
By Zhi-Yong Wang, Hao Nan Sheng, Werner Stefan, Hing Cheung So, Linqi Song, Weitao Xu
arXiv:2609.39357v1 Announce Type: new
Abstract: Asynchronous SGD is a popular algorithm for distributed learning where each client's gradient update is applied on arrival. This leads to a speed-up, b...
By Kaoru Otsuka, Maxime Meyer, Yuki Takezawa, Makoto Yamada, Anastasia Koloskova
Asynchronous SGD is a popular algorithm for distributed learning where each client's gradient update is applied on arrival. This leads to a speed-up, but also an increased vulnerability to attacks, as...
arXiv:2412. 07151v1 Announce Type: cross Abstract: Distributed model training needs to be adapted to challenges such as the straggler effect and Byzantine attacks.
By Jiahe Yan, Pratik Chaudhari, Leonard Kleinrock
arXiv:2506. 18020v3 Announce Type: replace Abstract: Robust distributed learning algorithms aim to maintain reliable performance despite the presence of misbehaving workers.
By Thomas Boudou, Batiste Le Bars, Nirupam Gupta, Aur\'elien Bellet
The paper introduces a robust decentralized federated distillation approach that allows heterogeneous client models to collaborate using predictions on shared unlabeled public data. Each client evaluates received predictions across three modalities—class prediction, boundary decision, and prediction correlation—filters unreliable clients, assigns reliability-based weights, and constructs modality-specific teachers. The method validates distillation gradients against supervised gradients from private data, removes conflicting gradients, and proves convergence under Byzantine attacks, achieving improved accuracy on CIFAR-10 and CIFAR-100 under non‑IID data and malicious conditions.
By Xiao Ma, Hong Shen, Hui Tian, Wei Ke, Wenqi Lyu
arXiv:2610.20264v1 Announce Type: new
Abstract: Client-level fair federated learning, in the form of $q$-fair federated learning ($q$-FFL), agnostic federated learning, or tilted empirical risk minim...
By Tiantong Sun, Jinlin Liu, Xingru Wei, Zequan Fang, Wei Chen, Qiang Yang, Xiaojin Zhang
arXiv:2409. 17754v2 Announce Type: replace-cross Abstract: Federated Learning (FL) emerges as a distributed machine learning approach that addresses privacy concerns by training AI models locally on devices.
By Diego Cajaraville-Aboy, Ana Fern\'andez-Vilas, Rebeca P. D\'iaz-Redondo, Manuel Fern\'andez-Veiga