Algorithmic recourse under imperfect causal knowledge: a probabilistic approach
Amir-Hossein Karimi, Bodo Julius von Kügelgen, Bernhard Schölkopf, Isabel Valera
Abstract
Recent work has discussed the limitations of counterfactual explanations to recommend actions for algorithmic recourse, and argued for the need of taking causal relationships between features into consideration. Unfortunately, in practice, the true underlying structural causal model is generally unknown. In this work, we first show that it is impossible to guarantee recourse without access to the true structural equations. To address this limitation, we propose two probabilistic approaches to select optimal actions that achieve recourse with high probability given limited causal knowledge (e.g., only the causal graph). The first captures uncertainty over structural equations under additive Gaussian noise, and uses Bayesian model averaging to estimate the counterfactual distribution. The second removes any assumptions on the structural equations by instead computing the average effect of recourse actions on individuals similar to the person who seeks recourse, leading to a novel subpopulation-based interventional notion of recourse. We then derive a gradient-based procedure for selecting optimal recourse actions, and empirically show that the proposed approaches lead to more reliable recommendations under imperfect causal knowledge than non-probabilistic baselines.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext b86f3de1-7714-4e97-91a2-78c425b9d06eCited by top-tier papers40
- Counterfactual Explanations Can Be ManipulatedDylan Slack, Anna Hilgard, Himabindu Lakkaraju, Sameer SinghNeurIPS 2021 · 182 citations
- Towards Robust and Reliable Algorithmic RecourseSohini Upadhyay, Shalmali Joshi, Himabindu LakkarajuNeurIPS 2021 · 145 citations
- On the Fairness of Causal Algorithmic RecourseJulius von Kügelgen, Amir-Hossein Karimi, Umang Bhatt, Isabel Valera et al.AAAI 2022 · 99 citations
- FOCUS: Flexible Optimizable Counterfactual Explanations for Tree EnsemblesAna Lucic, Harrie Oosterhuis, Hinda Haned, Maarten de RijkeAAAI 2022 · 87 citations
- Explaining Black-Box Algorithms Using Probabilistic Contrastive CounterfactualsSainyam Galhotra, Romila Pradhan, Babak SalimiSIGMOD 2021 · 85 citations
Builds on1
Related papers
- Learning Feasible Causal Algorithmic Recourse: A Prior Structural Knowledge Free ApproachHaotian Wang, Hao Zou, Xueguang Zhou, Shangwen Wang et al.WWW 2025 · 1 citation
- Improvement-Focused Causal Recourse (ICR)Gunnar König, Timo Freiesleben, Moritz Grosse-WentrupAAAI 2023 · 21 citations
- On the Adversarial Robustness of Causal Algorithmic RecourseRicardo Dominguez-Olmedo, Amir-Hossein Karimi, Bernhard SchölkopfICML 2022 · 80 citations
- Performative Validity of Recourse ExplanationsGunnar König, Hidde Fokkema, Timo Freiesleben, Celestine Mendler-Dünner et al.NeurIPS 2025 · 12 citations
- Distributionally Robust Recourse ActionDuy Nguyen, Ngoc Bui, Viet Anh NguyenICLR 2023 · 1 citation
