mlsanityData to 14 Oct 2026

REFRESH: Responsible and Efficient Feature Reselection Guided by SHAP Values

arXiv 2403.08880 ↗First posted 13 Mar 2024cs.LGcited by 1

Not on the map. Why?

Abstract (arXiv)

Feature selection is a crucial step in building machine learning models. This process is often achieved with accuracy as an objective, and can be cumbersome and computationally expensive for large-scale datasets. Several additional model performance characteristics such as fairness and robustness are of importance for model development. As regulations are driving the need for more trustworthy models, deployed models need to be corrected for model characteristics associated with responsible artificial intelligence. When feature selection is done with respect to one model performance characteristic (eg. accuracy), feature selection with secondary model performance characteristics (eg. fairness and robustness) as objectives would require going through the computationally expensive selection process from scratch. In this paper, we introduce the problem of feature reselection, so that features can be selected with respect to secondary model performance characteristics efficiently even after a feature selection process has been done with respect to a primary objective. To address this problem, we propose REFRESH, a method to reselect features so that additional constraints that are desirable towards model performance can be achieved without having to train several new models. REFRESH's underlying algorithm is a novel technique using SHAP values and correlation analysis that can approximate for the predictions of a model without having to train these models. Empirical evaluations on three datasets, including a large-scale loan defaulting dataset show that REFRESH can help find alternate models with better model characteristics efficiently. We also discuss the need for reselection and REFRESH based on regulation desiderata.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 23 of its 55 references that are in the map. First posted on arXiv 13 Mar 2024.

Builds on

23 of 55 references.

References · 23

  1. 2017A Unified Approach to Interpreting Model Predictionscited by 6,555
  2. 2019Theoretically Principled Trade-off between Robustness and Accuracycited by 1,517
  3. 2020Systematic Evaluation of Privacy Risks of Machine Learning Modelscited by 292
  4. 2018Manipulating and Measuring Model Interpretabilitycited by 256
  5. 2019Explainable Machine Learning in Deploymentcited by 211
  6. 2019Explaining individual predictions when features are dependent: More accurate approximations to Shapley valuescited by 208
  7. 2020True to the Model or True to the Data?cited by 126
  8. 2019Asymmetric Shapley values: incorporating causal knowledge into model-agnostic explainabilitycited by 114
  9. 2020Causal Shapley Values: Exploiting Causal Knowledge to Explain Individual Predictions of Complex Modelscited by 107
  10. 2020On the Privacy Risks of Algorithmic Fairnesscited by 82
  11. 2021Shapley values for feature selection: The good, the bad, and the axiomscited by 54
  12. 2022Differential Privacy and Fairness in Decisions and Learning Tasks: A Surveycited by 47
11 more
  1. 2021A Comprehensive Evaluation Framework for Deep Model Robustnesscited by 42
  2. 2020Explainability for fair machine learningcited by 34
  3. 2020Principles to Practices for Responsible AI: Closing the Gapcited by 25
  4. 2020Causal Feature Selection for Algorithmic Fairnesscited by 25
  5. 2021CIFS: Improving Adversarial Robustness of CNNs via Channel-wise Importance-based Feature Selectioncited by 21
  6. 2019On the Legal Compatibility of Fairness Definitionscited by 19
  7. 2020FaiR-N: Fair and Robust Neural Networks for Structured Datacited by 16
  8. 2020Fairness Under Feature Exemptions: Counterfactual and Observational Measurescited by 15
  9. 2022Fast Feature Selection with Fairness Constraintscited by 4
  10. 2022FEAMOE: Fair, Explainable and Adaptive Mixture of Expertscited by 4
  11. 2022Quantifying Feature Contributions to Overall Disparity Using Information Theorycited by 2

Built on by

Cited by year

Citing papers per year: 2025: 1.

1 paper.