- Rating
- 3
- Confidence
- 2
- Informativeness
- 3
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes Causal Integrated Gradients (CIG) and Causal Expected Gradients (CEG), extending traditional gradient-based feature attribution to account for causal dependencies between input features. Given a pretrained predictive model and a causal DAG, the method learns surrogate causal mechanisms from observational data and uses their derivatives to decompose feature attributions into direct and indirect effects, redistributing importance toward upstream causes. Its main contribution is incorporating causal structure into gradient-based attribution while maintaining computational efficiency compared with causal Shapley values. The authors validate their approach on synthetic data with known causal effects, simulated gene regulatory networks (Dyngen), and real single-cell gene expression data (IFN-β), demonstrating improved recovery of causal regulators and substantially lower computational costs. Additional experiments assess robustness to graph misspecification and surrogate estimation errors.
Critical strengths
-
The proposed method is computationally more efficient than existing dependency-aware approaches, particularly causal Shapley values. This makes it suitable for high-dimensional applications such as RNA-seq gene expression data, where computational costs can become prohibitive.
-
The idea of incorporating causal dependencies into integrated gradients through differentiable surrogate models is interesting and relatively straightforward. Using surrogate derivatives instead of sampling from interventional distributions provides a practical alternative while building on an established attribution method.
-
The authors evaluate the method under different settings, ranging from a known SCM and DAG, to a known DAG with learned mechanisms, and finally to an approximate DAG in a real biological dataset. This progression provides additional credibility to the proposed methodology and its potential applicability.
Critical weaknesses
-
While the authors investigate graph misspecification and surrogate approximation errors, the evaluation does not explicitly examine the impact of latent confounders on the learned causal mechanisms. Since CIG relies on surrogate derivatives estimated from observational data, it would be useful to assess how sensitive its attributions are to unobserved common causes, particularly in biological settings.
-
The main synthetic comparison uses the true SCM for both CIG and causal Shapley values, whereas practical applications rely on estimated causal mechanisms. Comparing both approaches under the same learned causal model would help clarify their relative robustness to estimation errors, beyond the demonstrated computational advantages.
Questions for authors
-
Have the authors considered evaluating CIG under different levels of latent confounding? Since the surrogate models are trained on observational data, it would be useful to understand how errors in the estimated causal mechanisms affect attribution quality, beyond the graph misspecification experiments already presented.
-
Have the authors considered introducing sparsity-inducing regularization (e.g., L1 or group Lasso) in the surrogate models to reduce the influence of potentially spurious causal edges? Given that the method relies on an approximate DAG in real-world settings, it would be interesting to assess whether such constraints improve attribution robustness or reduce computational costs.
3 comments
Response to Reviewer fvrG (2/2)
(Part 2/2)
W2 (compare CIG and causal Shapley under the same learned causal model).
We agree this is the comparison that matters in practice and have added it at 100 features (Appendix F, "Matched model evaluations", Fig. F.2). In the learned-surrogate setting, causal Shapley values sample from the learned surrogate as an additive-noise SCM, with Gaussian noise whose per-node standard deviation is that of the surrogate's training residuals. CIG and CEG use the same surrogate. We vary each method's budget, from 1 to 512 cycles for causal Shapley values. At the one budget both reach (about model evaluations per sample), CEG scores 0.76 against 0.43 for causal Shapley values on root nodes (Fig. F.2, right), and even at 512 cycles causal Shapley values stay below CIG and CEG. Estimation error lowers all methods by a similar amount (0.05–0.07, since the surrogate is trained for only 10 epochs in this experiment), so the ranking is the same as with the true SCM, and CIG is not more sensitive to estimation error than causal Shapley values. With the 50 epochs used below, the learned surrogate matches the true mechanisms almost exactly.
Across 100–1000 features, we reran the comparison of CIG with true and learned mechanisms on the revised benchmark, for both the MLP and the Lasso (Appendix F, Figs. F.5–F.6). With the MLP, the two give nearly identical curves, and with the Lasso the learned surrogate is at most about 0.02 lower; both stay far above IG. The learned surrogate is also faster, because its Jacobian is computed analytically for the graph's edges.
Q2 (sparsity-inducing regularization on the surrogate).
The surrogate is already sparse in structure, since it only parameterizes edges in the supplied graph, and our corruption study (Appendix K) shows that spurious edges barely affect root-cause attribution, unlike missing or reversed edges.
The reviewer's suggestion fits our surrogate naturally: each edge has its own coefficient vector over the basis expansion, so a group Lasso with one group per edge can switch an edge off entirely, removing it from the surrogate Jacobian. A plain penalty would zero individual basis coefficients, so an edge would leave the surrogate Jacobian only once all of its coefficients vanish; the group Lasso is its edge-level version. We implemented it (proximal block soft-thresholding after each optimizer step, so edges reach exact zeros) and tested it with 50% spurious edges added (new Table K.2). Root-cause attribution stays at 0.93–0.97 up to , because spurious edges never hurt it: the unregularized surrogate already shrinks them enough. On all nodes, spurious edges do have a small cost (0.08 at ), and the penalty removes it: at , which prunes all spurious edges and about a fifth of the true ones, the graph with spurious edges scores as well as the true graph with the same penalty (Table K.2). Too large a penalty () deletes the graph, bringing root-cause attribution down to the level of IG. In practice we would recommend choosing by held-out reconstruction error of the surrogate. Sparsity cannot fix missing or reversed edges, the corruptions that do degrade CIG, since it can only delete edges. On cost, pruning does not make training cheaper, since every candidate edge is still fitted, and makes attribution cheaper only by a constant factor (Appendix D). We added the table and this discussion to Appendix K and a sentence to the Limitations.
I appreciate the author's detailed responses and the performed experiments. I decide to maintain my score.
Response to Reviewer fvrG (1/2)
(Part 1/2)
We thank the reviewer for the positive assessment and the concrete suggestions.
W1 / Q1 (latent confounding).
We agree this was missing. To quantify it, we added hidden confounders to the synthetic benchmark (100 features, MLP, 5 seeds; new Appendix L). The confounders are neither features nor nodes of the supplied graph. We test two types: per-edge confounders, each acting on both ends of one of 25% of the edges, and 3 global factors, each acting on 30% of the nodes. We vary their strength ρ, the share of a confounded node's exogenous variance that comes from its confounders, from 0 (the unconfounded benchmark) to 0.75, keeping total variances fixed. The surrogate is learned from the confounded data on the true graph. To separate the cost of its bias from everything else, we also run CIG and CEG with the true mechanisms. The ground-truth CATE treats each sample's confounder values as fixed background: they are held at their realized values, and only the independent noise is resampled.
As expected, confounding strongly biases the learned mechanisms. Attribution quality, however, degrades gradually rather than collapsing. On root nodes (Fig. L.1), CIG with the learned surrogate goes from 0.79 at ρ=0 to about 0.70 at ρ=0.75, with CEG close to it, still about twice as high as IG (0.31–0.35). About half of the loss comes from the surrogate's bias. The other half also occurs with the true mechanisms, because the CATE holds each sample's confounder contributions fixed as background, whereas CIG credits each node for its full residual change, including the part driven by the confounders. All nodes show the same pattern with smaller margins; with global confounders at ρ=0.75, the learned-surrogate curves approach IG. More accurate mechanisms would reduce the part due to the surrogate's bias, which we now note in the Limitations. On real data, we added the analogous check for the most likely confounder in the IFN-β data, the stimulation itself: fitting the surrogate on control cells only, so that the stimulation cannot bias the learned mechanisms, leaves the IFN-β conclusions unchanged (Appendix I; see our answer to Reviewer UQnW, Q3). We also tested a latent confounder in a biological simulation (new Appendix L.2): a hidden batch variable in Dyngen, coupled to time in the training data and not part of the graph, which the model exploits as a shortcut. With the surrogate fitted to these confounded cells, CIG and CEG still rank the TFs near the top (AUROC 0.98), whereas DeepSHAP, EG, IG and DeepLIFT rank them at or below chance. CIG and CEG also give the batch genes, which the model uses as a shortcut, about 40% less importance than IG and EG, less than a uniform share. They still rank these genes above chance (AUROC 0.56–0.63), as expected, since the model does use them: CIG moves part of their credit to upstream regulators rather than removing it. Unlike those of the graph-agnostic methods, their attributions do not cluster by batch.