Federated fairness-aware classification under differential privacy

• URL: http://arxiv.org/abs/2603.24392v1
• Date: Wed, 25 Mar 2026 15:09:12 GMT
• Title: Federated fairness-aware classification under differential privacy
• Abstract summary: We study the joint impact of differential privacy and fairness on classification in a federated setting.<n>We propose a two-step algorithm, namely FDP-Fair and CDP-Fair.<n>Our theoretical findings are complemented by extensive numerical experiments on both synthetic and real datasets.
• Score: 9.340058165047717
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Privacy and algorithmic fairness have become two central issues in modern machine learning. Although each has separately emerged as a rapidly growing research area, their joint effect remains comparatively under-explored. In this paper, we systematically study the joint impact of differential privacy and fairness on classification in a federated setting, where data are distributed across multiple servers. Targeting demographic disparity constrained classification under federated differential privacy, we propose a two-step algorithm, namely FDP-Fair. In the special case where there is only one server, we further propose a simple yet powerful algorithm, namely CDP-Fair, serving as a computationally-lightweight alternative. Under mild structural assumptions, theoretical guarantees on privacy, fairness and excess risk control are established. In particular, we disentangle the source of the private fairness-aware excess risk into a) intrinsic cost of classification, b) cost of private classification, c) non-private cost of fairness and d) private cost of fairness. Our theoretical findings are complemented by extensive numerical experiments on both synthetic and real datasets, highlighting the practicality of our designed algorithms.

Related papers

• Where to Intervene? Benchmarking Fairness-Aware Learning on Differentially Private Synthetic Tabular Data [0.0]
  We present the first systematic evaluation of fairness interventions on private synthetic data.<n>We compare four pipeline configurations: (Baseline) training on original data; (DP-only) training on DP synthetic data; (Fair-only) applying fairness mechanisms on original data; and (DP+Fair) combining fairness mechanisms with DP synthetic data.
  arXiv  Detail & Related papers  (2026-07-08T14:33:00Z)
• Fairness Meets Privacy: Integrating Differential Privacy and Demographic Parity in Multi-class Classification [6.28122931748758]
  We show that differential privacy can be integrated into a fairness-enhancing pipeline with minimal impact on fairness guarantees.<n>We design a postprocessing algorithm, called DP2DP, that enforces both demographic parity and differential privacy.<n>Our analysis reveals that our algorithm converges towards its demographic parity objective at essentially the same rate as the best non-private methods from the literature.
  arXiv  Detail & Related papers  (2025-11-24T08:31:02Z)
• A Stochastic Optimization Framework for Private and Fair Learning From Decentralized Data [14.748203847227542]
  We develop a novel algorithm for private and fair federated learning (FL) Our algorithm satisfies inter-silo record-level differential privacy (ISRL-DP) Experiments demonstrate the state-of-the-art fairness-accuracy framework tradeoffs of our algorithm across different privacy levels.
  arXiv  Detail & Related papers  (2024-11-12T15:51:35Z)
• Differentially Private Fair Binary Classifications [1.8087157239832476]
  We first propose an algorithm for learning a classifier with only fairness guarantee. We then refine this algorithm to incorporate differential privacy. Empirical evaluations conducted on the Adult and Credit Card datasets illustrate that our algorithm outperforms the state-of-the-art in terms of fairness guarantees.
  arXiv  Detail & Related papers  (2024-02-23T20:52:59Z)
• Improving the Variance of Differentially Private Randomized Experiments through Clustering [16.166525280886578]
  We propose a new differentially private mechanism, "Cluster-DP"<n>We demonstrate that selecting higher-quality clusters, according to a quality metric we introduce, can decrease the variance penalty without compromising privacy guarantees.
  arXiv  Detail & Related papers  (2023-08-02T05:51:57Z)
• Breaking the Communication-Privacy-Accuracy Tradeoff with $f$-Differential Privacy [51.11280118806893]
  We consider a federated data analytics problem in which a server coordinates the collaborative data analysis of multiple users with privacy concerns and limited communication capability. We study the local differential privacy guarantees of discrete-valued mechanisms with finite output space through the lens of $f$-differential privacy (DP) More specifically, we advance the existing literature by deriving tight $f$-DP guarantees for a variety of discrete-valued mechanisms.
  arXiv  Detail & Related papers  (2023-02-19T16:58:53Z)
• Practical Approaches for Fair Learning with Multitype and Multivariate Sensitive Attributes [70.6326967720747]
  It is important to guarantee that machine learning algorithms deployed in the real world do not result in unfairness or unintended social consequences. We introduce FairCOCCO, a fairness measure built on cross-covariance operators on reproducing kernel Hilbert Spaces. We empirically demonstrate consistent improvements against state-of-the-art techniques in balancing predictive power and fairness on real-world datasets.
  arXiv  Detail & Related papers  (2022-11-11T11:28:46Z)
• DP2-Pub: Differentially Private High-Dimensional Data Publication with Invariant Post Randomization [58.155151571362914]
  We propose a differentially private high-dimensional data publication mechanism (DP2-Pub) that runs in two phases. splitting attributes into several low-dimensional clusters with high intra-cluster cohesion and low inter-cluster coupling helps obtain a reasonable privacy budget. We also extend our DP2-Pub mechanism to the scenario with a semi-honest server which satisfies local differential privacy.
  arXiv  Detail & Related papers  (2022-08-24T17:52:43Z)
• Private Domain Adaptation from a Public Source [48.83724068578305]
  We design differentially private discrepancy-based algorithms for adaptation from a source domain with public labeled data to a target domain with unlabeled private data. Our solutions are based on private variants of Frank-Wolfe and Mirror-Descent algorithms.
  arXiv  Detail & Related papers  (2022-08-12T06:52:55Z)
• On Deep Learning with Label Differential Privacy [54.45348348861426]
  We study the multi-class classification setting where the labels are considered sensitive and ought to be protected. We propose a new algorithm for training deep neural networks with label differential privacy, and run evaluations on several datasets.
  arXiv  Detail & Related papers  (2021-02-11T15:09:06Z)
• How to Democratise and Protect AI: Fair and Differentially Private Decentralised Deep Learning [43.73144358534933]
  We build a fair and differentially private decentralised deep learning framework called FDPDDL. It enables parties to derive more accurate local models in a fair and private manner. We show that FDPDDL achieves high fairness, yields comparable accuracy to centralised and distributed frameworks, and delivers better accuracy than the standalone framework.
  arXiv  Detail & Related papers  (2020-07-18T09:06:10Z)
• Differential Privacy of Hierarchical Census Data: An Optimization Approach [53.29035917495491]
  Census Bureaus are interested in releasing aggregate socio-economic data about a large population without revealing sensitive information about any individual. Recent events have identified some of the privacy challenges faced by these organizations. This paper presents a novel differential-privacy mechanism for releasing hierarchical counts of individuals.
  arXiv  Detail & Related papers  (2020-06-28T18:19:55Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.