Algorithmic recourse under imperfect causal knowledge: a probabilistic approach
Amir-Hossein Karimi, Bodo Julius von Kügelgen, Bernhard Schölkopf, Isabel Valera
摘要
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.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了最后一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper40
- Counterfactual Explanations Can Be ManipulatedDylan Slack, Anna Hilgard, Himabindu Lakkaraju, Sameer SinghNeurIPS 2021 · 被引用 182 次
- Towards Robust and Reliable Algorithmic RecourseSohini Upadhyay, Shalmali Joshi, Himabindu LakkarajuNeurIPS 2021 · 被引用 145 次
- On the Fairness of Causal Algorithmic RecourseJulius von Kügelgen, Amir-Hossein Karimi, Umang Bhatt, Isabel Valera 等AAAI 2022 · 被引用 99 次
- FOCUS: Flexible Optimizable Counterfactual Explanations for Tree EnsemblesAna Lucic, Harrie Oosterhuis, Hinda Haned, Maarten de RijkeAAAI 2022 · 被引用 87 次
- Explaining Black-Box Algorithms Using Probabilistic Contrastive CounterfactualsSainyam Galhotra, Romila Pradhan, Babak SalimiSIGMOD 2021 · 被引用 85 次
它引用的顶会 Paper1
相关 Paper
- Learning Feasible Causal Algorithmic Recourse: A Prior Structural Knowledge Free ApproachHaotian Wang, Hao Zou, Xueguang Zhou, Shangwen Wang 等WWW 2025 · 被引用 1 次
- Improvement-Focused Causal Recourse (ICR)Gunnar König, Timo Freiesleben, Moritz Grosse-WentrupAAAI 2023 · 被引用 21 次
- On the Adversarial Robustness of Causal Algorithmic RecourseRicardo Dominguez-Olmedo, Amir-Hossein Karimi, Bernhard SchölkopfICML 2022 · 被引用 80 次
- Performative Validity of Recourse ExplanationsGunnar König, Hidde Fokkema, Timo Freiesleben, Celestine Mendler-Dünner 等NeurIPS 2025 · 被引用 12 次
- Distributionally Robust Recourse ActionDuy Nguyen, Ngoc Bui, Viet Anh NguyenICLR 2023 · 被引用 1 次
