arXiv Machine Learning

Privacy Preserving Gossip Learning

arXiv AI
Aug 18

Privacy-Preserving Decentralized Federated Learning via Explainable Adaptive Differential Privacy

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 Machine Learning
Aug 27

Theoretically Principled Federated Learning for Balancing Privacy and Utility

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 Machine Learning
Jul 23

Differentially Private Neural Network Training Under the Hidden State Assumption

arXiv:2407. 08233v3 Announce Type: replace Abstract: Current differentially private learning paradigms face a severe utility bottleneck: DP-SGD degrades performance through noise accumulation over training steps, while aggregation-based approaches such as PATE suffer from data inefficiency due to disjoint data partitioning.

By Ding Chen, Haochen Luo, Xiaofei Wang, Chen Liu
arXiv Machine Learning
Sep 25

SPADE-DFL: Communication-Efficient Decentralized Federated Learning via Derivative-Free Linearized ADMM

SPADE-DFL is a communication‑efficient decentralized federated learning algorithm that uses a primal–dual method to allow the number of local function‑value updates between neighbor exchanges to increase with the computation budget while maintaining non‑private convergence rates. For smooth nonconvex objectives, it achieves a time‑averaged stationarity and consensus bound of ≠O(T−1/3) with only ≠Theta(T−2/3) communication rounds, where T is the number of local updates per client. The method also supports client‑level differential privacy by isolating data‑dependent increments, proving privacy for the full interactive transcript and quantifying the resulting optimization error, and demonstrates higher mean test accuracy than existing decentralized learning methods on four classification tasks.

By Mengli Wei, Mengkai Zhu, Jiawen Chen, Wenwu Yu, Duxin Che
Hugging Face Trending Papers
Jun 1

IntraShuffler: A Privacy Preserving Framework for Heterogeneous DP Federated Learning

Heterogeneous Differential Privacy (HDP) in Federated Learning (FL) allows clients to select individual privacy budgets ($\varepsilon_i$) according to institutional policies and data sensitivity. In practice, many HDP-FL systems employ $\varepsilon$-aware server aggregation to improve model utility by re-weighting client updates according to their declared privacy budgets.