How unfair is private learning ?

• URL: http://arxiv.org/abs/2206.03985v1
• Date: Wed, 8 Jun 2022 16:03:44 GMT
• Title: How unfair is private learning ?
• Authors: Amartya Sanyal, Yaxi Hu, Fanny Yang
• Abstract summary: We show that, when the data has a long-tailed structure, it is not possible to build accurate learning algorithms that are both private and fair. We show that relaxing overall accuracy can lead to good fairness even with strict privacy requirements.
• Score: 13.815080318918833
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: As machine learning algorithms are deployed on sensitive data in critical decision making processes, it is becoming increasingly important that they are also private and fair. In this paper, we show that, when the data has a long-tailed structure, it is not possible to build accurate learning algorithms that are both private and results in higher accuracy on minority subpopulations. We further show that relaxing overall accuracy can lead to good fairness even with strict privacy requirements. To corroborate our theoretical results in practice, we provide an extensive set of experimental results using a variety of synthetic, vision~(\cifar and CelebA), and tabular~(Law School) datasets and learning algorithms.

Related papers

• Oracle-Efficient Differentially Private Learning with Public Data [21.771932463130252]
  We present the first computationally efficient, algorithms to provably leverage public data to learn privately whenever a function class is learnable non-privately. We provide specialized algorithms with improved sample complexities in the special cases when the function class is convex or when the task is binary classification.
  arXiv  Detail & Related papers  (2024-02-13T23:40:50Z)
• PILLAR: How to make semi-private learning more effective [12.292092677396347]
  In Semi-Supervised Semi-Private (SP) learning, the learner has access to both public unlabelled and private labelled data. We propose a computationally efficient algorithm that achieves significantly lower private labelled sample complexity and can be efficiently run on real-world datasets.
  arXiv  Detail & Related papers  (2023-06-06T18:45:05Z)
• Personalization Improves Privacy-Accuracy Tradeoffs in Federated Optimization [57.98426940386627]
  We show that coordinating local learning with private centralized learning yields a generically useful and improved tradeoff between accuracy and privacy. We illustrate our theoretical results with experiments on synthetic and real-world datasets.
  arXiv  Detail & Related papers  (2022-02-10T20:44:44Z)
• A Graph Federated Architecture with Privacy Preserving Learning [48.24121036612076]
  Federated learning involves a central processor that works with multiple agents to find a global model. The current architecture of a server connected to multiple clients is highly sensitive to communication failures and computational overloads at the server. We use cryptographic and differential privacy concepts to privatize the federated learning algorithm that we extend to the graph structure.
  arXiv  Detail & Related papers  (2021-04-26T09:51:24Z)
• Can Active Learning Preemptively Mitigate Fairness Issues? [66.84854430781097]
  dataset bias is one of the prevailing causes of unfairness in machine learning. We study whether models trained with uncertainty-based ALs are fairer in their decisions with respect to a protected class. We also explore the interaction of algorithmic fairness methods such as gradient reversal (GRAD) and BALD.
  arXiv  Detail & Related papers  (2021-04-14T14:20:22Z)
• 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)
• On the Privacy Risks of Algorithmic Fairness [9.429448411561541]
  We study the privacy risks of group fairness through the lens of membership inference attacks. We show that fairness comes at the cost of privacy, and this cost is not distributed equally.
  arXiv  Detail & Related papers  (2020-11-07T09:15:31Z)
• Fairness in Semi-supervised Learning: Unlabeled Data Help to Reduce Discrimination [53.3082498402884]
  A growing specter in the rise of machine learning is whether the decisions made by machine learning models are fair. We present a framework of fair semi-supervised learning in the pre-processing phase, including pseudo labeling to predict labels for unlabeled data. A theoretical decomposition analysis of bias, variance and noise highlights the different sources of discrimination and the impact they have on fairness in semi-supervised learning.
  arXiv  Detail & Related papers  (2020-09-25T05:48:56Z)
• Fairness Constraints in Semi-supervised Learning [56.48626493765908]
  We develop a framework for fair semi-supervised learning, which is formulated as an optimization problem. We theoretically analyze the source of discrimination in semi-supervised learning via bias, variance and noise decomposition. Our method is able to achieve fair semi-supervised learning, and reach a better trade-off between accuracy and fairness than fair supervised learning.
  arXiv  Detail & Related papers  (2020-09-14T04:25:59Z)
• Differentially private cross-silo federated learning [16.38610531397378]
  Strict privacy is of paramount importance in distributed machine learning. In this paper we combine additively homomorphic secure summation protocols with differential privacy in the so-called cross-silo federated learning setting. We demonstrate that our proposed solutions give prediction accuracy that is comparable to the non-distributed setting.
  arXiv  Detail & Related papers  (2020-07-10T18:15:10Z)
• Learning Individually Fair Classifier with Path-Specific Causal-Effect Constraint [31.86959207229775]
  In this paper, we propose a framework for learning an individually fair classifier. We define the it probability of individual unfairness (PIU) and solve an optimization problem where PIU's upper bound, which can be estimated from data, is controlled to be close to zero. Experimental results show that our method can learn an individually fair classifier at a slight cost of accuracy.
  arXiv  Detail & Related papers  (2020-02-17T02:46:17Z)

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.