FedPF在保护隐私的同时实现公平联邦学习,平衡了公平性与模型性能。
FedPF: Accurate Target Privacy Preserving Federated Learning Balancing Fairness and Utility
- 将公平与隐私的权衡建模为零和博弈,动态调节约束条件。
- 在三个数据集上实现最高42.9%的歧视降低,同时保持高模型精度。
- 适合资源受限设备,适用于需兼顾隐私与公平性的实际部署场景。
联邦学习(FL)可在不共享数据的前提下实现协作训练,但参与者面临核心挑战:如何在保障不同人口群体公平性的同时保护敏感客户端数据。本文提出一种差分隐私公平联邦学习算法FedPF,将多目标优化转化为公平性与隐私约束对抗模型性能的零和博弈。理论分析揭示,在有限样本的联邦设置下,保护敏感属性的隐私机制会削弱检测和纠正人口偏差的统计能力。我们进一步证明理论边界与非单调的公平性-效用关系一致:适度的公平约束可提升泛化能力,过度强化则导致性能下降。实验表明,即便在严格隐私约束下,FedPF仍保持最低歧视水平,且在多个数据集上实现最高42.9%的歧视减少,同时维持竞争力的准确率。硬件级模拟显示,该算法计算开销低,适用于资源受限的边缘设备。代码已开源。
原文摘要 · Abstract (English)
Federated Learning (FL) enables collaborative model training without data sharing, yet participants face a fundamental challenge, e.g., simultaneously ensuring fairness across demographic groups while protecting sensitive client data. We introduce a differentially private fair FL algorithm (FedPF) that transforms this multi-objective optimization into a zero-sum game where fairness and privacy constraints compete against model utility. Our theoretical analysis reveals an inverse relationship: privacy mechanisms that protect sensitive attributes can reduce the statistical power available for detecting and correcting demographic biases under finite samples in federated settings. We further show that our theoretical bounds are consistent with a non-monotonic fairness-utility relationship, which is empirically validated by experiments where moderate fairness constraints improve generalization before excessive enforcement degrades performance. Compared with mainstream algorithms, even under strict privacy constraints, FedPF still maintains the lowest discrimination level among all tested algorithms while retaining high utility. Experimental validation demonstrates up to 42.9 % discrimination reduction across three datasets while maintaining competitive accuracy, but more importantly, reveals that achieving strong privacy and fairness simultaneously requires carefully balanced tradeoffs rather than optimizing either objective in isolation. Furthermore, hardware-level simulations demonstrate that FedPF maintains a low computational footprint, making it suitable for resource-constrained edge devices. The source code for our proposed algorithm is publicly accessible at https://github.com/szpsunkk/FedPF.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。