Fair Causal Feature Selection

• URL: http://arxiv.org/abs/2306.10336v2
• Date: Mon, 18 Sep 2023 05:07:53 GMT
• Title: Fair Causal Feature Selection
• Authors: Zhaolong Ling, Enqi Xu, Peng Zhou, Liang Du, Kui Yu, and Xindong Wu
• Abstract summary: We propose a Fair Causal Feature Selection algorithm, called FairCFS. FairCFS constructs a localized causal graph that identifies the Markov blankets of class and sensitive variables. Experiments on seven public real-world datasets validate that FairCFS has comparable accuracy compared to eight state-of-the-art feature selection algorithms.
• Score: 17.29310476978056
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Fair feature selection for classification decision tasks has recently garnered significant attention from researchers. However, existing fair feature selection algorithms fall short of providing a full explanation of the causal relationship between features and sensitive attributes, potentially impacting the accuracy of fair feature identification. To address this issue, we propose a Fair Causal Feature Selection algorithm, called FairCFS. Specifically, FairCFS constructs a localized causal graph that identifies the Markov blankets of class and sensitive variables, to block the transmission of sensitive information for selecting fair causal features. Extensive experiments on seven public real-world datasets validate that FairCFS has comparable accuracy compared to eight state-of-the-art feature selection algorithms, while presenting more superior fairness.

Related papers

• Fair Streaming Feature Selection [9.327911386140109]
  We propose FairSFS, a novel algorithm for fair streaming feature selection. We show that FairSFS not only maintains accuracy that is on par with leading streaming feature selection methods but also significantly improves fairness metrics.
  arXiv  Detail & Related papers  (2024-06-20T15:22:44Z)
• On the Power of Randomization in Fair Classification and Representation [4.423655941492362]
  We show the power of randomization to minimize the loss of accuracy that results when we impose fairness constraints. We construct DP-fair, EO-fair, and PE-fair representations that have provably optimal accuracy and suffer no accuracy loss compared to the optimal DP-fair, EO-fair, and PE-fair classifiers respectively on the original data distribution.
  arXiv  Detail & Related papers  (2024-06-05T10:55:11Z)
• Fair-CDA: Continuous and Directional Augmentation for Group Fairness [48.84385689186208]
  We propose a fine-grained data augmentation strategy for imposing fairness constraints. We show that group fairness can be achieved by regularizing the models on transition paths of sensitive features between groups. Our proposed method does not assume any data generative model and ensures good generalization for both accuracy and fairness.
  arXiv  Detail & Related papers  (2023-04-01T11:23:00Z)
• Chasing Fairness Under Distribution Shift: A Model Weight Perturbation Approach [72.19525160912943]
  We first theoretically demonstrate the inherent connection between distribution shift, data perturbation, and model weight perturbation. We then analyze the sufficient conditions to guarantee fairness for the target dataset. Motivated by these sufficient conditions, we propose robust fairness regularization (RFR)
  arXiv  Detail & Related papers  (2023-03-06T17:19:23Z)
• Fairness via Adversarial Attribute Neighbourhood Robust Learning [49.93775302674591]
  We propose a principled underlineRobust underlineAdversarial underlineAttribute underlineNeighbourhood (RAAN) loss to debias the classification head.
  arXiv  Detail & Related papers  (2022-10-12T23:39:28Z)
• How Biased are Your Features?: Computing Fairness Influence Functions with Global Sensitivity Analysis [38.482411134083236]
  Fairness in machine learning has attained significant focus due to the widespread application in high-stake decision-making tasks. We introduce the Fairness Influence Function (FIF), which breaks down bias into its components among individual features and the intersection of multiple features. Experiments demonstrate that FairXplainer captures FIFs of individual feature and intersectional features, provides a better approximation of bias based on FIFs, demonstrates higher correlation of FIFs with fairness interventions, and detects changes in bias due to fairness affirmative/punitive actions in the classifier.
  arXiv  Detail & Related papers  (2022-06-01T04:02:16Z)
• Counterfactual Fairness with Partially Known Causal Graph [85.15766086381352]
  This paper proposes a general method to achieve the notion of counterfactual fairness when the true causal graph is unknown. We find that counterfactual fairness can be achieved as if the true causal graph were fully known, when specific background knowledge is provided.
  arXiv  Detail & Related papers  (2022-05-27T13:40:50Z)
• Information Theoretic Measures for Fairness-aware Feature Selection [27.06618125828978]
  We develop a framework for fairness-aware feature selection, based on information theoretic measures for the accuracy and discriminatory impacts of features. Specifically, our goal is to design a fairness utility score for each feature which quantifies how this feature influences accurate as well as nondiscriminatory decisions.
  arXiv  Detail & Related papers  (2021-06-01T20:11:54Z)
• Algorithmic Decision Making with Conditional Fairness [48.76267073341723]
  We define conditional fairness as a more sound fairness metric by conditioning on the fairness variables. We propose a Derivable Conditional Fairness Regularizer (DCFR) to track the trade-off between precision and fairness of algorithmic decision making.
  arXiv  Detail & Related papers  (2020-06-18T12:56:28Z)
• Causal Feature Selection for Algorithmic Fairness [61.767399505764736]
  We consider fairness in the integration component of data management. We propose an approach to identify a sub-collection of features that ensure the fairness of the dataset.
  arXiv  Detail & Related papers  (2020-06-10T20:20:10Z)
• Fair Inputs and Fair Outputs: The Incompatibility of Fairness in Privacy and Accuracy [0.0]
  We argue that privacy and need-to-know are desirable properties of a decision system. We show that for an optimal classifier these three properties are in general incompatible. We provide an algorithm to verify if the trade-off between the three properties exists in a given dataset.
  arXiv  Detail & Related papers  (2020-05-19T04:32:16Z)

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.