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
arXiv:2504. 17471v2 Announce Type: replace-cross Abstract: Gossip Learning (GL) is a decentralized learning paradigm where users iteratively exchange and aggregate models with a small set of neighboring peers.
By Yacine Belal, Mohamed Maouche, Sonia Ben Mokhtar
The paper investigates the effects of label‑flipping poisoning attacks in a three‑client federated intrusion detection system (IDS) trained on CICIDS2017 with non‑IID attack subtype distributions. Flipping 60% of training labels from a single Byzantine client reduces the attacker’s own detection accuracy from 99.96% to 84.33%, while the federated global ensemble remains stable across all tested poison rates. The study shows that the self‑compromise signal can be detected as an anomaly, enabling Byzantine client identification without target data exfiltration, and notes that the current aggregation uses a Federated Forest rather than FedAvg, with future work planned to extend to parametric classifiers.
By Asmah Muallem, Firdous Kausar, Sajid Hussain, Lei Qian
arXiv:2608. 06637v1 Announce Type: cross Abstract: Robust aggregation methods are widely used in federated learning to mitigate the impact of adversarial client behavior.
By Srinivasan Subramanian, Md. Abdullah Al Hafiz Khan, Kazi Aminul Islam
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
SketchGuard is a Byzantine‑robust decentralized federated learning method that separates neighbor screening from model aggregation by using a Count Sketch representation. The approach mitigates a vulnerability where an adaptive adversary can hide large perturbations in the sketch’s null space, by adopting a commit‑then‑sketch protocol that ensures the sketch seed is chosen only after model commitment. The authors prove convergence in both convex and non‑convex settings, demonstrate that SketchGuard achieves state‑of‑the‑art robustness against six attacks—including the adaptive null‑space attack—across various network topologies and data heterogeneity, while reducing per‑neighbor communication to a model‑dimension‑independent size.
By Murtaza Rangwala, Farag Azzedin, Richard O. Sinnott, Rajkumar Buyya