Synthesizing explainable counterfactual policies for algorithmic recourse with program synthesis
Not on the map. Why?
Abstract (arXiv)
Being able to provide counterfactual interventions - sequences of actions we would have had to take for a desirable outcome to happen - is essential to explain how to change an unfavourable decision by a black-box machine learning model (e.g., being denied a loan request). Existing solutions have mainly focused on generating feasible interventions without providing explanations on their rationale. Moreover, they need to solve a separate optimization problem for each user. In this paper, we take a different approach and learn a program that outputs a sequence of explainable counterfactual actions given a user description and a causal graph. We leverage program synthesis techniques, reinforcement learning coupled with Monte Carlo Tree Search for efficient exploration, and rule learning to extract explanations for each recommended action. An experimental evaluation on synthetic and real-world datasets shows how our approach generates effective interventions by making orders of magnitude fewer queries to the black-box classifier with respect to existing solutions, with the additional benefit of complementing them with interpretable explanations.
Key facts. Cited by 8 papers in the map (data through 7 Oct 2026). Builds on 23 of its 46 references that are in the map. First posted on arXiv 18 Jan 2022.
Builds on
23 of 46 references.
References · 23
- 2017Explanation in Artificial Intelligence: Insights from the Social Sciencescited by 1,201
- 2017Counterfactual Explanations without Opening the Black Box: Automated Decisions and the GDPRcited by 1,086
- 2019Explaining Machine Learning Classifiers through Diverse Counterfactual Explanationscited by 612
- 2018Actionable Recourse in Linear Classificationcited by 327
- 2020Algorithmic Recourse: from Counterfactual Explanations to Interventionscited by 250
- 2016Visualizing the Effects of Predictor Variables in Black Box Supervised Learning Modelscited by 212
- 2019Model-Agnostic Counterfactual Explanations for Consequential Decisionscited by 204
- 2018Local Rule-Based Explanations of Black Box Decision Systemscited by 165
- 2020Multi-Objective Counterfactual Explanationscited by 157
- 2016DeepCoder: Learning to Write Programscited by 145
- 2020Algorithmic recourse under imperfect causal knowledge: a probabilistic approachcited by 139
- 2020A survey of algorithmic recourse: definitions, formulations, solutions, and prospectscited by 118
11 more
- 2019The Hidden Assumptions Behind Counterfactual Explanations and Principal Reasonscited by 115
- 2018Leveraging Grammar and Reinforcement Learning for Neural Program Synthesiscited by 83
- 2017Interpretable Predictions of Tree-based Ensembles via Actionable Feature Tweakingcited by 76
- 2013Causal Discovery from Changescited by 52
- 2018A Simple and Effective Model-Based Variable Importance Measurecited by 50
- 2020Decisions, Counterfactual Explanations and Strategic Behaviorcited by 44
- 2019Synthesizing Action Sequences for Modifying Model Decisionscited by 22
- 2019Learning Compositional Neural Programs with Recursive Tree Search and Planningcited by 17
- 2021Consequence-aware Sequential Counterfactual Generationcited by 17
- 2019Extracting Incentives from Black-Box Decisionscited by 7
- 2021Learning compositional programs with arguments and samplingcited by 2
Built on by
Citing papers per year: 2022: 1; 2023: 2; 2024: 4; 2025: 0; 2026: 1.
8 papers.
- 2022Personalized Algorithmic Recourse with Preference Elicitationcited by 9
- 2023The Utility of "Even if..." Semifactual Explanation to Optimise Positive Outcomescited by 8
- 2024Exploiting Preference Elicitation in Interactive and User-centered Algorithmic Recourse: An Initial Explorationcited by 8
- 2024Time Can Invalidate Algorithmic Recoursecited by 8
- 2024Collective Counterfactual Explanations: Balancing Individual Goals and Collective Dynamicscited by 1
- 2024Learning Actionable Counterfactual Explanations in Large State Spacescited by 1
- 2026From Universal to Individualized Actionability: Revisiting Personalization in Algorithmic Recoursecited by 1
- 2023Personalized Path Recourse for Reinforcement Learning Agentscited by 0
- 2026From Universal to Individualized Actionability: Revisiting Personalization in Algorithmic Recourse9 Apr 2026
- 2024Time Can Invalidate Algorithmic Recourse10 Oct 2024
- 2024Learning Actionable Counterfactual Explanations in Large State Spaces25 Apr 2024
- 2024Exploiting Preference Elicitation in Interactive and User-centered Algorithmic Recourse: An Initial Exploration8 Apr 2024
- 2024Collective Counterfactual Explanations: Balancing Individual Goals and Collective Dynamics7 Feb 2024
- 2023Personalized Path Recourse for Reinforcement Learning Agents14 Dec 2023
- 2023The Utility of "Even if..." Semifactual Explanation to Optimise Positive Outcomes29 Oct 2023
- 2022Personalized Algorithmic Recourse with Preference Elicitation27 May 2022