mlsanityData to 7 Oct 2026

Fair Recourse for All: Ensuring Individual and Group Fairness in Counterfactual Explanations

arXiv 2601.20449 ↗First posted 28 Jan 2026cs.LG cs.AIcited by 1

Not on the map. Why?

Abstract (arXiv)

Explainable Artificial Intelligence (XAI) is becoming increasingly essential for enhancing the transparency of machine learning (ML) models. Among the various XAI techniques, counterfactual explanations (CFs) hold a pivotal role due to their ability to illustrate how changes in input features can alter an ML model's decision, thereby offering actionable recourse to users. Ensuring that individuals with comparable attributes and those belonging to different protected groups (e.g., demographic) receive similar and actionable recourse options is essential for trustworthy and fair decision-making. In this work, we address this challenge directly by focusing on the generation of fair CFs. Specifically, we start by defining and formulating fairness at: 1) individual fairness, ensuring that similar individuals receive similar CFs, 2) group fairness, ensuring equitable CFs across different protected groups and 3) hybrid fairness, which accounts for both individual and broader group-level fairness. We formulate the problem as an optimization task and propose a novel model-agnostic, reinforcement learning based approach to generate CFs that satisfy fairness constraints at both the individual and group levels, two objectives that are usually treated as orthogonal. As fairness metrics, we extend existing metrics commonly used for auditing ML models, such as equal choice of recourse and equal effectiveness across individuals and groups. We evaluate our approach on three benchmark datasets, showing that it effectively ensures individual and group fairness while preserving the quality of the generated CFs in terms of proximity and plausibility, and quantify the cost of fairness in the different levels separately. Our work opens a broader discussion on hybrid fairness and its role and implications for XAI and beyond CFs.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 40 of its 72 references that are in the map. First posted on arXiv 28 Jan 2026.

Builds on

40 of 72 references.

References · 40

  1. 2016Grad-CAM: Visual Explanations from Deep Networks via Gradient-based Localizationcited by 6,690
  2. 2017Explanation in Artificial Intelligence: Insights from the Social Sciencescited by 1,201
  3. 2017Counterfactual Explanations without Opening the Black Box: Automated Decisions and the GDPRcited by 1,086
  4. 2017Counterfactual Fairnesscited by 802
  5. 2019Explaining Machine Learning Classifiers through Diverse Counterfactual Explanationscited by 612
  6. 2018Actionable Recourse in Linear Classificationcited by 327
  7. 2018Explanations based on the Missing: Towards Contrastive Explanations with Pertinent Negativescited by 261
  8. 2019Interpretable Counterfactual Explanations Guided by Prototypescited by 223
  9. 2019Model-Agnostic Counterfactual Explanations for Consequential Decisionscited by 204
  10. 2021A survey on datasets for fairness-aware machine learningcited by 157
  11. 2018Counterfactual Fairness in Text Classification through Robustnesscited by 150
  12. 2021Counterfactual Explanations Can Be Manipulatedcited by 113
28 more
  1. 2021If Only We Had Better Counterfactual Explanations: Five Key Deficits to Rectify in the Evaluation of Counterfactual XAI Techniquescited by 82
  2. 2017Interpretable Predictions of Tree-based Ensembles via Actionable Feature Tweakingcited by 76
  3. 2020On the Fairness of Causal Algorithmic Recoursecited by 69
  4. 2021NICE: An Algorithm for Nearest Instance Counterfactual Explanationscited by 62
  5. 2019Counterfactual Risk Assessments, Evaluation, and Fairnesscited by 59
  6. 2022Learning Fair Node Representations with Graph Counterfactual Fairnesscited by 58
  7. 2020SCOUT: Self-aware Discriminant Counterfactual Explanationscited by 52
  8. 2021Exploring Counterfactual Explanations Through the Lens of Adversarial Examples: A Theoretical and Empirical Analysiscited by 52
  9. 2019Equalizing Recourse across Groupscited by 51
  10. 2019FOCUS: Flexible Optimizable Counterfactual Explanations for Tree Ensemblescited by 43
  11. 2021Evaluating Robustness of Counterfactual Explanationscited by 41
  12. 2019CERTIFAI: Counterfactual Explanations for Robustness, Transparency, Interpretability, and Fairness of Artificial Intelligence modelscited by 34
  13. 2022Fairness in Recommender Systems: Research Landscape and Future Directionscited by 30
  14. 2022Fairness in Recommendation: Foundations, Methods and Applicationscited by 27
  15. 2023GLOBE-CE: A Translation-Based Approach for Global Counterfactual Explanationscited by 27
  16. 2022Fairness and Explainability: Bridging the Gap Towards Fair Model Explanationscited by 22
  17. 2019Explaining Deep Learning Models with Constrained Adversarial Examplescited by 19
  18. 2020PermuteAttack: Counterfactual Explanation of Machine Learning Credit Scorecardscited by 16
  19. 2022"Explain it in the Same Way!" -- Model-Agnostic Group Fairness of Counterfactual Explanationscited by 9
  20. 2021Counterfactual Explanation with Multi-Agent Reinforcement Learning for Drug Target Predictioncited by 8
  21. 2023Fairness Aware Counterfactuals for Subgroupscited by 8
  22. 2024Feature Responsiveness Scores: Model-Agnostic Explanations for Recoursecited by 8
  23. 2020Explaining Deep Graph Networks with Molecular Counterfactualscited by 6
  24. 2023DualFair: Fair Representation Learning at Both Group and Individual Levels via Contrastive Self-supervisioncited by 6
  25. 2024On the (In)Compatibility between Group Fairness and Individual Fairnesscited by 6
  26. 2024A Survey of Privacy-Preserving Model Explanations: Privacy Risks, Attacks, and Countermeasurescited by 6
  27. 2024A Two-Stage Algorithm for Cost-Efficient Multi-instance Counterfactual Explanationscited by 5
  28. 2024A New Paradigm for Counterfactual Reasoning in Fairness and Recoursecited by 3

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 1.

1 paper.