P2C: Path to Counterfactuals
Not on the map. Why?
Abstract (arXiv)
Machine-learning models are increasingly driving decisions in high-stakes settings, such as finance, law, and hiring, thus, highlighting the need for transparency. However, the key challenge is to balance transparency -- clarifying `why' a decision was made -- with recourse: providing actionable steps on `how' to achieve a favourable outcome from an unfavourable outcome. Counterfactual explanations reveal `why' an undesired outcome occurred and `how' to reverse it through targeted feature changes (interventions). Current counterfactual approaches have limitations: 1) they often ignore causal dependencies between features, and 2) they typically assume all interventions can happen simultaneously, an unrealistic assumption in practical scenarios where actions are typically taken in a sequence. As a result, these counterfactuals are often not achievable in the real world. We present P2C (Path-to-Counterfactuals), a model-agnostic framework that produces a plan (ordered sequence of actions) converting an unfavourable outcome to a causally consistent favourable outcome. P2C addresses both limitations by 1) Explicitly modelling causal relationships between features and 2) Ensuring that each intermediate state in the plan is feasible and causally valid. P2C uses the goal-directed Answer Set Programming system s(CASP) to generate the plan accounting for feature changes that happen automatically due to causal dependencies. Furthermore, P2C refines cost (effort) computation by only counting changes actively made by the user, resulting in realistic cost estimates. Finally, P2C highlights how its causal planner outperforms standard planners, which lack causal knowledge and thus can generate illegal actions.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 10 of its 20 references that are in the map. First posted on arXiv 28 Aug 2025.
Builds on
10 of 20 references.
References · 10
- 2017Counterfactual Explanations without Opening the Black Box: Automated Decisions and the GDPRcited by 1,089
- 2019Explaining Machine Learning Classifiers through Diverse Counterfactual Explanationscited by 614
- 2018Actionable Recourse in Linear Classificationcited by 328
- 2020Algorithmic Recourse: from Counterfactual Explanations to Interventionscited by 250
- 2019Model-Agnostic Counterfactual Explanations for Consequential Decisionscited by 204
- 2019Efficient Search for Diverse Coherent Explanationscited by 111
- 2017Interpretable Predictions of Tree-based Ensembles via Actionable Feature Tweakingcited by 76
- 2018Constraint Answer Set Programming without Groundingcited by 38
- 2022FOLD-SE: An Efficient Rule-based Machine Learning Algorithm with Scalable Explainabilitycited by 15
- 2021Answer-Set Programs for Reasoning about Counterfactual Interventions and Responsibility Scores for Classificationcited by 9
Built on by
Not cited yet.