Table of Contents
Fetching ...

An Adaptive Differentially Private Federated Learning Framework with Bi-level Optimization

Jin Wang, Hui Ma, Fei Xing, Ming Yan

TL;DR

This work tackles the joint challenges of privacy and heterogeneity in federated learning by introducing FedCompDP, an adaptive differentially private FL framework. It combines a lightweight local compression module, adaptive DP gradient clipping, and a constraint-aware robust aggregation strategy to mitigate DP-induced perturbations and Non-IID drift. Empirical results on CIFAR-10 and SVHN show improved convergence stability and higher accuracy over representative DP-FL baselines, validating the effectiveness of the three-component design. The approach offers practical privacy-preserving benefits for edge deployments and opens avenues for extending to decentralized and asynchronous FL setups.

Abstract

Federated learning enables collaborative model training across distributed clients while preserving data privacy. However, in practical deployments, device heterogeneity, non-independent, and identically distributed (Non-IID) data often lead to highly unstable and biased gradient updates. When differential privacy is enforced, conventional fixed gradient clipping and Gaussian noise injection may further amplify gradient perturbations, resulting in training oscillation and performance degradation and degraded model performance. To address these challenges, we propose an adaptive differentially private federated learning framework that explicitly targets model efficiency under heterogeneous and privacy-constrained settings. On the client side, a lightweight local compressed module is introduced to regularize intermediate representations and constrain gradient variability, thereby mitigating noise amplification during local optimization. On the server side, an adaptive gradient clipping strategy dynamically adjusts clipping thresholds based on historical update statistics to avoid over-clipping and noise domination. Furthermore, a constraint-aware aggregation mechanism is designed to suppress unreliable or noise-dominated client updates and stabilize global optimization. Extensive experiments on CIFAR-10 and SVHN demonstrate improved convergence stability and classification accuracy.

An Adaptive Differentially Private Federated Learning Framework with Bi-level Optimization

TL;DR

This work tackles the joint challenges of privacy and heterogeneity in federated learning by introducing FedCompDP, an adaptive differentially private FL framework. It combines a lightweight local compression module, adaptive DP gradient clipping, and a constraint-aware robust aggregation strategy to mitigate DP-induced perturbations and Non-IID drift. Empirical results on CIFAR-10 and SVHN show improved convergence stability and higher accuracy over representative DP-FL baselines, validating the effectiveness of the three-component design. The approach offers practical privacy-preserving benefits for edge deployments and opens avenues for extending to decentralized and asynchronous FL setups.

Abstract

Federated learning enables collaborative model training across distributed clients while preserving data privacy. However, in practical deployments, device heterogeneity, non-independent, and identically distributed (Non-IID) data often lead to highly unstable and biased gradient updates. When differential privacy is enforced, conventional fixed gradient clipping and Gaussian noise injection may further amplify gradient perturbations, resulting in training oscillation and performance degradation and degraded model performance. To address these challenges, we propose an adaptive differentially private federated learning framework that explicitly targets model efficiency under heterogeneous and privacy-constrained settings. On the client side, a lightweight local compressed module is introduced to regularize intermediate representations and constrain gradient variability, thereby mitigating noise amplification during local optimization. On the server side, an adaptive gradient clipping strategy dynamically adjusts clipping thresholds based on historical update statistics to avoid over-clipping and noise domination. Furthermore, a constraint-aware aggregation mechanism is designed to suppress unreliable or noise-dominated client updates and stabilize global optimization. Extensive experiments on CIFAR-10 and SVHN demonstrate improved convergence stability and classification accuracy.
Paper Structure (24 sections, 19 equations, 1 figure, 2 tables, 1 algorithm)