Practical do-Shapley Explanations with Estimand-Agnostic Causal Inference

Álvaro Parafita, Tomas Garriga, Axel Brando, Francisco J. Cazorla
9/24/2025
cs.LG

No confident code implementation found for this paper. 1 possible match can be shown below.

Abstract

Among explainability techniques, SHAP stands out as one of the most popular, but often overlooks the causal structure of the problem. In response, do-SHAP employs interventional queries, but its reliance on estimands hinders its practical application. To address this problem, we propose the use of estimand-agnostic approaches, which allow for the estimation of any identifiable query from a single model, making do-SHAP feasible on complex graphs. We also develop a novel algorithm to significantly accelerate its computation at a negligible cost, as well as a method to explain inaccessible Data Generating Processes. We demonstrate the estimation and computational performance of our approach, and validate it on two real-world datasets, highlighting its potential in obtaining reliable explanations.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 1 weaker match is hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{parafita2025practical,
  title  = {Practical do-Shapley Explanations with Estimand-Agnostic Causal Inference},
  author = {Álvaro Parafita and Tomas Garriga and Axel Brando and Francisco J. Cazorla},
  year   = {2025},
  eprint = {2509.20211},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2509.20211v2},
  journal = {NEURIPS 2025 2025}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2509.20211.svg)](https://codeofpaper.com/paper/2509.20211)

Discussion