Tackling Privacy Heterogeneity in Differentially Private Federated Learning
Organizations: Department of Information Engineering, The Chinese University of Hong Kong, Hong Kong · School of Science and Engineering, Shenzhen Institute of Artificial Intelligence and Robotics for Society, Shenzhen Key Laboratory of Crowd Intelligence Empowered Low-Carbon Energy Network, and CSIJRI Joint Research Centre on Smart Energy Storage, The Chinese University of Hong Kong, Shenzhen, Guangdong, 518172, P.R. China
Abstract
Differentially private federated learning (DP-FL) enables clients to collaboratively train machine learning models while preserving the privacy of their local data. However, most existing DP-FL approaches assume that all clients share a uniform privacy budget, an assumption that does not hold in real-world scenarios where privacy requirements vary widely. This privacy heterogeneity poses a significant challenge: conventional client selection strategies, which typically rely on data quantity, cannot distinguish between clients providing high-quality updates and those introducing substantial noise due to strict privacy constraints. To address this gap, we present the first systematic study of privacy-aware client selection in DP-FL. We establish a theoretical foundation by deriving a convergence analysis that quantifies the impact of privacy heterogeneity on training error. Building on this analysis, we propose a privacy-aware client selection strategy, formulated as a convex optimization problem, that adaptively adjusts selection probabilities to minimize training error. Extensive experiments on benchmark datasets demonstrate that our approach achieves up to a 10% improvement in test accuracy on CIFAR-10 compared to existing baselines under heterogeneous privacy budgets. These results highlight the importance of incorporating privacy heterogeneity into client selection for practical and effective federated learning.
Figures & tables
| Ref. | Client Selection Method | DP |
|---|---|---|
| [ 4 ] | Unbiased selection | ✓ |
| [ 5 ] | Unbiased selection | ✓ |
| [ 6 ] | Unbiased selection | ✓ |
| [ 7 ] | Unbiased selection | ✓ |
| [ 8 ] | Importance sampling based selection | ✗ |
| UCB-CS [ 9 ] | Bandit based selection | ✗ |
| Symbol | Meaning |
|---|---|
| Selection probability of client | |
| Unbiased selection probability of client | |
| Privacy budget of client | |
| Noise variance of client | |
| Local dataset of client | |
| Subsampling ratio of client |
| Mechanism | Non-IID Degree | Test Accuracy |
|---|---|---|
| Privacy-aware | (IID) | 68.71% |
| 65.12% | ||
| 68.50% | ||
| 67.63% | ||
| Unbiased | (IID) | 28.02% |
| 14.69% |
| Mechanism | Non-IID Degree | Test Accuracy |
|---|---|---|
| Privacy-aware | (IID) | 53.53% |
| 55.26% | ||
| 54.80% | ||
| 48.94% | ||
| Unbiased | (IID) | 14.68% |
| 16.47% |
| (32) | ||||
Differentially Private Federated Learning
Differentially private federated learning trains shared models across data-holding clients while limiting what updates reveal about individual records or users.
See all 59 papers