提出隐私保护聚类联邦学习框架,提升异构数据下模型精度与隐私安全。
Differentially Private Clustered Federated Learning with Privacy-Preserving Initialization and Normality-Driven Aggregation
- 分两阶段:先私密共享低秩适配压缩更新,再基于正态性驱动聚合
- 在隐私预算ε=2和ε=8下,平均准确率提升2.9%优于现有方法
- 适合需高隐私保障且数据异构的跨设备联邦学习场景
联邦学习(FL)可在保持原始数据本地化的同时训练全局模型。然而,现有FL存在用户信息泄露风险,实践中常结合差分隐私(DP)与安全向量求和以提供形式化隐私保障。在真实的跨设备部署中,数据高度异构,导致传统FL收敛慢、泛化差。聚类联邦学习(CFL)通过将用户分组降低组内异构性缓解此问题。但将CFL与DP结合仍具挑战:注入的DP噪声使客户端更新过噪,服务器无法用噪声聚合更新初始化聚类中心。为此,本文提出PINA,一种两阶段框架:第一阶段,各客户端微调轻量级低秩适配器(LoRA),私密共享更新的压缩草图;服务器利用这些草图构建鲁棒聚类中心。第二阶段,引入基于正态性的聚合机制,提升收敛速度与鲁棒性。实验表明,该方法在ε∈{2,8}的隐私预算下,平均准确率比现有最优DP-FL算法高出2.9%,同时保持聚类FL优势并提供对不信任服务器的形式化隐私保障。
原文摘要 · Abstract (English)
Federated learning (FL) enables training of a global model while keeping raw data on end-devices. Despite this, FL has shown to leak private user information and thus in practice, it is often coupled with methods such as differential privacy (DP) and secure vector sum to provide formal privacy guarantees to its participants. In realistic cross-device deployments, the data are highly heterogeneous, so vanilla federated learning converges slowly and generalizes poorly. Clustered federated learning (CFL) mitigates this by segregating users into clusters, leading to lower intra-cluster data heterogeneity. Nevertheless, coupling CFL with DP remains challenging: the injected DP noise makes individual client updates excessively noisy, and the server is unable to initialize cluster centroids with the less noisy aggregated updates. To address this challenge, we propose PINA, a two-stage framework that first lets each client fine-tune a lightweight low-rank adaptation (LoRA) adapter and privately share a compressed sketch of the update. The server leverages these sketches to construct robust cluster centroids. In the second stage, PINA introduces a normality-driven aggregation mechanism that improves convergence and robustness. Our method retains the benefits of clustered FL while providing formal privacy guarantees against an untrusted server. Extensive evaluations show that our proposed method outperforms state-of-the-art DP-FL algorithms by an average of 2.9% in accuracy for privacy budgets (epsilon in {2, 8}).
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。