The paper introduces a general learning framework that protects privacy in federated learning by distorting model parameters, enabling a trade‑off between privacy and utility. The algorithm supports arbitrary privacy measurements and delivers personalized utility‑privacy balances for each parameter, client, and communication round. The authors prove that the gap between their algorithm’s utility loss and the optimal loss is sub‑linear in iterations, provide a convergence rate, and demonstrate empirically that their method outperforms baselines under the same privacy budget.
By Xiaojin Zhang, Wenjie Li, Yiming Li, Wei Chen, Shutao Xia, Qiang Yang
arXiv:2606. 31742v1 Announce Type: cross Abstract: Explainable AI (XAI) methods have demonstrated significant success in recent years at identifying relevant features in input data that drive deep learning model decisions, enhancing interpretability for users.
By Maximilian Andreas Hoefler, Karsten Mueller, Wojciech Samek
arXiv:2412. 12640v2 Announce Type: replace Abstract: The increasing demand for data privacy, alongside the benefits of aggregating data from networked devices, has catalyzed the emergence of federated learning (FL).
By Rui Zhang, Ka-Ho Chow
arXiv:2509. 10691v3 Announce Type: replace-cross Abstract: Decentralized federated learning enables collaborative model training without a central server, but shared model updates can still leak sensitive information through inversion, reconstruction, and membership inference attacks.
By Fardin Jalil Piran, Zhiling Chen, Yang Zhang, Qianyu Zhou, Jiong Tang, Farhad Imani
arXiv:2604. 07125v2 Announce Type: replace-cross Abstract: This article presents DDP-SA, a scalable privacy-preserving federated learning framework that jointly leverages client-side local differential privacy (LDP) and full-threshold additive secret sharing (ASS) for secure aggregation.
By Wenjing Wei, Farid Nait-Abdesselam, Alla Jammine
The paper introduces DP‑BR‑FedAvg, a federated learning framework that combines Gaussian‑mechanism differential privacy with a coordinate‑wise trimmed‑mean Byzantine‑robust aggregation rule. It is evaluated on a simulated cross‑institutional classification task involving fraud and clinical‑risk scoring, where it improves the F1‑score for a minority class from 0.030 (plain FedAvg) to 0.119 while bounding privacy loss. The study demonstrates that privacy and robustness mechanisms interact, and that system design for regulated, adversarial, cross‑institutional settings must account for this interaction.
By Srikumar Nayak