mlsanityData to 14 Oct 2026

Fairness-Aware Unsupervised Feature Selection

arXiv 2106.02216 ↗First posted 4 Jun 2021cs.LG cs.AIcited by 10

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. Cited by 10 papers in the map (data through 14 Oct 2026). Builds on 13 of its 34 references that are in the map. First posted on arXiv 4 Jun 2021.

Builds on

13 of 34 references.

References · 13

  1. 2019A Survey on Bias and Fairness in Machine Learningcited by 1,917
  2. 2015The Variational Fair Autoencodercited by 223
  3. 2019Flexibly Fair Representation Learning by Disentanglementcited by 196
  4. 2018Fair Clustering Through Fairletscited by 176
  5. 2018The Frontiers of Fairness in Machine Learningcited by 141
  6. 2019Fairness in Deep Learning: A Computational Perspectivecited by 123
  7. 2018Invariant Representations without Adversarial Trainingcited by 112
  8. 2019Assessing Algorithmic Fairness with Unobserved Protected Class Using Data Combinationcited by 79
  9. 2019Scalable Fair Clusteringcited by 78
  10. 2019Guarantees for Spectral Clustering with Fairness Constraintscited by 72
  11. 2016A causal framework for discovering and removing direct and indirect discriminationcited by 71
  12. 2016Feature Selection: A Data Perspectivecited by 50
1 more
  1. 2018Fair Coresets and Streaming Algorithms for Fair k-Means Clusteringcited by 12

Built on by

Cited by year

Citing papers per year: 2022: 1; 2023: 3; 2024: 3; 2025: 3.

10 papers.