Less Is More: Feature Engineering for Fairness and Performance of Machine Learning Software
Open Access
- 20 January 2026
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Software Engineering and Methodology
- Vol. 35 (2) , 1-36
Abstract
Machine Learning (ML) software employs statistical algorithms to perform high-stake tasks in our daily lives, whose results are usually discriminatory due to protected features (e.g., gender), i.e., one part (called privileged, e.g., male) may be more likely to obtain beneficial decisions than the other part (called unprivileged, e.g., female). In alleviating the unfairness, developers have obtained widely held beliefs about the tradeoff between performance and fairness for ML software. Surprisingly, recent research on feature engineering suggests that enlarging the feature set is the perfect way to kill two birds with one stone, i.e., achieving both higher performance and fairness. However, the experiments used in the prior study did not remove the effect of protected features, which have been suggested to be excluded in both industrial applications and academic studies. As a result, the study did not fully explore the tradeoff between performance and fairness. In this article, we first conduct an empirical study to replicate this prior study after excluding the protected features and observe that there is still a tradeoff between performance and fairness with enlarging the features, i.e., more features are not perfect, which would lead to higher performance and lower fairness. Due to more features causing more collection and pre-processing budgets, we aim to search for an effective alternative. Inspired by the “less is more” principle, we propose a novel feature ranking method, Hybrid-importance and Early-validation based Feature Ranking (HEFR) , to find an efficient subset to replace the full feature set with comparable performance and fairness. Our method, HEFR, employs hybrid feature importances to combine performance and fairness and conducts early validation to check the effectiveness of hybrid importances. We conduct experiments on seven datasets and three classifiers to evaluate our method with five baselines. The results have shown that (a) HEFR is efficient for ML software feature engineering: applying HEFR to choose about 10% of features would construct ML software with better or comparable performance and fairness, and (b) HEFR is actionable with small dataset sizes: applying HEFR with only 10% data size would still help choose the proper feature subset.Keywords
Funding Information
- National Natural Science Foundation of China (62172202, 62272221, 62172205, and 61972082)
- Major Program of the Natural Science Foundation of Jiangsu Higher Education Institutions of China (22KJA520008)
This publication has 48 references indexed in Scilit:
- Classification with costly features as a sequential decision-making problemMachine Learning, 2020
- The Five Laws of SE for AIIEEE Software, 2019
- An empirical study on pareto based multi-objective feature selection for software defect predictionJournal of Systems and Software, 2019
- Key Stakeholders’ Value Propositions for Feature Selection in Software-Intensive Products: An Industrial Case StudyIEEE Transactions on Software Engineering, 2018
- Deep Semantic Feature Learning for Software Defect PredictionIEEE Transactions on Software Engineering, 2018
- A benchmark study on the effectiveness of search-based data selection and feature selection for cross project defect predictionInformation and Software Technology, 2018
- Metamorphic Testing for Software Quality Assessment: A Study of Search EnginesIEEE Transactions on Software Engineering, 2015
- On stochastic orderings of the Wilcoxon Rank Sum test statistic—With applications to reproducibility probability estimation testingStatistics & Probability Letters, 2011
- Three naive Bayes approaches for discrimination-free classificationData Mining and Knowledge Discovery, 2010
- Gene Selection for Cancer Classification using Support Vector MachinesMachine Learning, 2002