Fairness-Aware Unsupervised Feature Selection

• URL: http://arxiv.org/abs/2106.02216v1
• Date: Fri, 4 Jun 2021 02:38:05 GMT
• Title: Fairness-Aware Unsupervised Feature Selection
• Abstract summary: We develop a principled framework for a fairness-aware unsupervised feature selection problem. Our proposed framework can be regarded as a model-agnostic debiasing strategy. Experimental results on multiple real-world datasets demonstrate that our framework achieves a good trade-off between utility and fairness promotion.
• Score: 37.13136799987164
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Feature selection is a prevalent data preprocessing paradigm for various learning tasks. Due to the expensive cost of acquiring supervision information, unsupervised feature selection sparks great interests recently. However, existing unsupervised feature selection algorithms do not have fairness considerations and suffer from a high risk of amplifying discrimination by selecting features that are over associated with protected attributes such as gender, race, and ethnicity. In this paper, we make an initial investigation of the fairness-aware unsupervised feature selection problem and develop a principled framework, which leverages kernel alignment to find a subset of high-quality features that can best preserve the information in the original feature space while being minimally correlated with protected attributes. Specifically, different from the mainstream in-processing debiasing methods, our proposed framework can be regarded as a model-agnostic debiasing strategy that eliminates biases and discrimination before downstream learning algorithms are involved. Experimental results on multiple real-world datasets demonstrate that our framework achieves a good trade-off between utility maximization and fairness promotion.

Related papers

• An Empirical Study of Feature Selection Granularity [3.3545793786322347]
  Conventional feature selection algorithms compute feature importance scores globally across the entire feature set and then select the top-ranked features in a single step.<n>This approach raises a critical question: Can the presence of less informative (or noisy) features mask or obscure the true importance of other, more relevant features?
  arXiv  Detail & Related papers  (2026-07-27T08:24:40Z)
• Algorithmic Feature Highlighting for Human-AI Decision-Making [2.7830690575074435]
  We study algorithms that highlight a small subset of case-specific features for human consideration.<n>A central issue is how humans interpret the algorithm's choice of features.<n>We show that optimizing highlighting for sophisticated agents can be computationally intractable.
  arXiv  Detail & Related papers  (2026-04-24T05:23:06Z)
• Fairness-aware Bayes optimal functional classification [7.252020628689346]
  Algorithmic fairness has become a central topic in machine learning.<n>We study the classification of functional data under fairness constraints.<n>We propose a unified framework for fairness-aware functional classification.
  arXiv  Detail & Related papers  (2025-05-14T15:22:09Z)
• A Hybrid Framework for Statistical Feature Selection and Image-Based Noise-Defect Detection [55.2480439325792]
  This paper presents a hybrid framework that integrates both statistical feature selection and classification techniques to improve defect detection accuracy. We present around 55 distinguished features that are extracted from industrial images, which are then analyzed using statistical methods. By integrating these methods with flexible machine learning applications, the proposed framework improves detection accuracy and reduces false positives and misclassifications.
  arXiv  Detail & Related papers  (2024-12-11T22:12:21Z)
• Detecting and Identifying Selection Structure in Sequential Data [53.24493902162797]
  We argue that the selective inclusion of data points based on latent objectives is common in practical situations, such as music sequences. We show that selection structure is identifiable without any parametric assumptions or interventional experiments. We also propose a provably correct algorithm to detect and identify selection structures as well as other types of dependencies.
  arXiv  Detail & Related papers  (2024-06-29T20:56:34Z)
• Provable Optimization for Adversarial Fair Self-supervised Contrastive Learning [49.417414031031264]
  This paper studies learning fair encoders in a self-supervised learning setting. All data are unlabeled and only a small portion of them are annotated with sensitive attributes.
  arXiv  Detail & Related papers  (2024-06-09T08:11:12Z)
• Evaluating the Fairness of Discriminative Foundation Models in Computer Vision [51.176061115977774]
  We propose a novel taxonomy for bias evaluation of discriminative foundation models, such as Contrastive Language-Pretraining (CLIP) We then systematically evaluate existing methods for mitigating bias in these models with respect to our taxonomy. Specifically, we evaluate OpenAI's CLIP and OpenCLIP models for key applications, such as zero-shot classification, image retrieval and image captioning.
  arXiv  Detail & Related papers  (2023-10-18T10:32:39Z)
• Data AUDIT: Identifying Attribute Utility- and Detectability-Induced Bias in Task Models [8.420252576694583]
  We present a first technique for the rigorous, quantitative screening of medical image datasets. Our method decomposes the risks associated with dataset attributes in terms of their detectability and utility. Using our method, we show our screening method reliably identifies nearly imperceptible bias-inducing artifacts.
  arXiv  Detail & Related papers  (2023-04-06T16:50:15Z)
• Sequential Attention for Feature Selection [12.89764845700709]
  We propose a feature selection algorithm called Sequential Attention that achieves state-of-the-art empirical results for neural networks. We give theoretical insights into our algorithm for linear regression by showing that an adaptation to this setting is equivalent to the classical Orthogonal Matching Pursuit (OMP) algorithm.
  arXiv  Detail & Related papers  (2022-09-29T15:49:06Z)
• Deep Feature Selection Using a Novel Complementary Feature Mask [5.904240881373805]
  We deal with feature selection by exploiting the features with less importance scores. We propose a feature selection framework based on a novel complementary feature mask. Our method is generic and can be easily integrated into existing deep-learning-based feature selection approaches.
  arXiv  Detail & Related papers  (2022-09-25T18:03:30Z)
• MultiFair: Multi-Group Fairness in Machine Learning [52.24956510371455]
  We study multi-group fairness in machine learning (MultiFair) We propose a generic end-to-end algorithmic framework to solve it. Our proposed framework is generalizable to many different settings.
  arXiv  Detail & Related papers  (2021-05-24T02:30:22Z)
• Mitigating Bias in Set Selection with Noisy Protected Attributes [16.882719401742175]
  We show that in the presence of noisy protected attributes, in attempting to increase fairness without considering noise, one can, in fact, decrease the fairness of the result! We formulate a denoised'' selection problem which functions for a large class of fairness metrics. Our empirical results show that this approach can produce subsets which significantly improve the fairness metrics despite the presence of noisy protected attributes.
  arXiv  Detail & Related papers  (2020-11-09T06:45:15Z)
• 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)

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.