- Rating
- 2
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes SCORE-EM, an EM-inspired framework for causal discovery from missing-at-random (MAR) data. The method addresses the difficulty of applying SCORE to incomplete observations, where conventional imputation may distort the density-score information used for causal ordering. SCORE-EM iteratively updates missing values through MALA-based conditional sampling under a fitted additive noise model (ANM), followed by structural model refitting and causal ordering refinement using pooled SCORE statistics. The final DAG is reconstructed using multiple-imputation CAM pruning.
The authors evaluate SCORE-EM on synthetic nonlinear ANMs with Erdős–Rényi and scale-free graph structures at 30% and 50% missingness, as well as on the Sachs protein-signaling dataset with artificially introduced MAR missingness. The proposed method achieves higher mean F1 scores than the evaluated missing-data baselines across the synthetic configurations and consistently improves mean order divergence over other ordering-based methods. Additional statistical tests support the aggregate performance improvements, although the relative performance in SHD varies across graph structures and missingness settings.
Critical strengths
- A well-motivated approach to causal discovery with incomplete data.
The paper addresses an important and practically relevant limitation of SCORE, which requires complete observations to estimate the density-score quantities used for causal ordering. The motivation is clearly presented, and the proposed framework provides a concrete approach to incorporating structural information into missing-value estimation.
In particular, Appendix 13 offers a useful mathematical illustration of how point imputation and misspecified nonlinear multiple imputation can distort SCORE's Hessian-based leaf criterion. Although this example does not establish the superiority of SCORE-EM over correctly specified multiple-imputation methods, it provides a sound motivation for considering structure-aware conditional sampling.
- Encouraging empirical improvements in causal ordering and graph recovery.
SCORE-EM achieves the highest reported mean F1 among the evaluated missing-data methods across all 24 synthetic configurations and consistently obtains lower mean order divergence than the other ordering-based baselines. Appendix 12 further reports statistically significant aggregate improvements using paired Wilcoxon signed-rank tests with Holm correction.
These results provide meaningful empirical evidence for the effectiveness of the overall SCORE-EM framework. In particular, the consistent improvements in order divergence are relevant because accurate causal ordering is itself an important objective of ordering-based causal discovery.
Critical weaknesses
- Insufficient characterization of the mathematical scope and practical robustness of end-to-end DAG recovery.
MAR ignorability (Section 3.2) does not by itself guarantee causal identifiability. The manuscript does not establish sufficient joint-observation, positivity, and structural assumptions under which the full-data distribution and causal ordering or DAG can be identified from MAR observations at the population level. Nor does it provide theoretical results characterizing how recovery guarantees or estimation error deteriorate as missingness increases. Experiments at 30% and 50% missingness under specific MAR mechanisms do not adequately characterize the conditions under which reliable recovery can be expected.
Furthermore, Equation (1) allows general nonlinear parent interactions, whereas provisional parent selection (Appendix 9.4) and final CAM pruning (Appendix 10) use additive regression models. For example, with independent standard Gaussian root variables, the interaction-only mechanism contains genuine causal parents whose population additive effects vanish. Thus, correct causal ordering need not guarantee correct edge recovery. Although this limitation is also inherited from CAM-based approaches, the applicable functional assumptions should be clarified.
The experimental results further illustrate the importance of characterizing end-to-end recovery: at 50% missingness, MissDAG achieves lower mean SHD in all six sparse ER1/SF1 settings (Appendix Tables 6–8), despite SCORE-EM's favorable F1 and ordering results among the relevant baselines. These setting-specific exceptions do not negate the positive aggregate results, but they leave the reliability of final DAG recovery insufficiently understood.
- Insufficient evidence isolating the contribution of iterative structural refinement.
The central algorithmic distinction is the iterative feedback between ANM-guided imputation and SCORE-based ordering, although MissDAG already couples missing-data inference with structural learning. Section 6.1 treats MI+SCORE as an ablation baseline, but the methods differ in their imputation models (Extra-Trees versus ANM-guided MALA), ensemble sizes (20 versus 4), and pruning-stage imputations (Appendices 8–10).
Consequently, the reported improvements support the effectiveness of the overall SCORE-EM pipeline but do not isolate the contribution of iterative structural feedback from these other design choices. This limits the evidence for the paper's distinctive algorithmic contribution and its significance.
Questions for authors
- Population identifiability and theoretical recovery under MAR
Under what joint-observation patterns, positivity conditions, and nonlinear ANM assumptions can causal ordering or DAG structure be identified from MAR observations at the population level? Under such conditions, can the authors establish theoretical recovery guarantees or estimation error bounds characterizing the deterioration in performance as observation probabilities decrease, including their dependence on sample size and signal strength?
- Assessing identifiability conditions in practice
How could practitioners assess whether their incomplete data plausibly satisfy the model assumptions and identification conditions needed for causal recovery under SCORE-EM? In particular, which conditions can be assessed from observable information (such as joint-observation overlap, model diagnostics, or stability of estimated SCORE leaf statistics), and which cannot be verified without additional assumptions? How should practitioners assess sensitivity when these conditions cannot be established from the data alone? 3. Functional assumptions and CAM pruning
What is the intended functional model class for end-to-end DAG recovery, given that Equation (1) allows general nonlinear interactions while the parent-selection and CAM pruning procedures use additive regressions? In particular, how does the method account for interaction-only parental effects that have zero population additive contributions?
- Independent contribution of iterative refinement
Can the authors provide a controlled ablation comparing full SCORE-EM with a version that removes iterative structural or ordering feedback while keeping the imputation model, number of completions, pruning procedure, and computational budget as comparable as possible? This would help determine the independent benefit of the proposed feedback mechanism.
- Population soundness of the iterative procedure
Assuming exact density-score estimation and exact conditional sampling from the fitted ANM, does the population-level SCORE-EM iteration recover the true causal ordering? Can an incorrect ordering and the imputations fitted under it form a self-consistent fixed point? If so, what guarantee does the proposed procedure provide?
3 comments
Thank you for the thoughtful responses and the additional experiments. The rebuttal clarifies why additive pruning can miss parents whose effects arise only through interactions. My main remaining question is under what model conditions the method can recover the DAG.
Given the true ordering and imputation from the true conditional distribution, let denote the increase in population prediction error when predecessor is removed from the additive regression for node . Could the authors state concrete sufficient conditions under which for every true parent and for every nonparent? A correctly specified additive model with nonredundant parent effects would be a natural starting point. Stating these conditions would clarify when the edge-selection step can be expected to work.
Thank you for this suggestion. A concrete sufficient setting is a correctly specified additive SEM,
\qquad \varepsilon_j\overset{\mathrm{ind}}{\sim}N(0,\sigma_j^2),\quad \sigma_j^2>0,$$ where each true-parent function is continuous, nonconstant, square-integrable, and belongs to the additive regression class used for population pruning. We assume the regression class contains the true conditional mean. Let $P_j$ denote all predecessors under the true topological ordering. Under MAR, exact sampling of missing entries from the true conditional distribution preserves the full-data distribution at the population level. Since the structural noise is independent of all predecessors, the optimal population squared prediction error using the full additive model is $\sigma_j^2$. Removing a nonparent leaves the true conditional mean representable, so $\Delta_{jk}=0$. For every true parent, $$\Delta_{jk}\ge \mathbb E\left[ \mathrm{Var}\left( f_{jk}(X_k)\mid X_{P_j\setminus\lbrace k\rbrace} \right) \right]>0.$$ The lower bound follows because even unrestricted prediction from the remaining predecessors cannot eliminate this conditional variation. Strict positivity follows from the everywhere-positive joint density implied by independent nondegenerate Gaussian noises, together with the continuity and nonconstancy of each parent function, which exclude deterministic redundancy. Thus, under these conditions, population risk-based pruning recovers exactly the true parent sets, conditional on the true ordering and oracle imputation. This result characterizes the population separation underlying CAM pruning; consistency of finite-sample spline estimation, significance testing, and imputation requires additional conditions. We will add these sufficient conditions and the corresponding argument to clarify the scope of DAG recovery.
We thank the reviewer for the thoughtful comments.
W1–W2. MissDAG's lower SHD on sparse graphs at 50% missingness arises in pruning, not ordering, and under identical pruning SCORE-EM's ordering lowers OD from 1.73 to 0.58 relative to MI+SCORE; both ablations are in our response to Reviewer yeq6.
Q1. One sufficient setting is a fully observed subset Z and partially observed variables W, with R indicating joint observation of all W. If R⊥W∣Z and P(R=1∣Z=z)>0 almost surely, then p(z,w)=p(z)p(w∣z,R=1) identifies the joint distribution; our synthetic masks have this form. More generally, if each missingness pattern's probability depends only on its observed entries and complete rows have positive probability, the ignorable likelihood (Eq. 3) identifies the joint law; this covers Sachs.
Given the joint distribution, the DAG is identified under causal sufficiency, acyclicity, and smooth nonlinear ANMs with Gaussian noise (Peters et al., 2014), and population SCORE recovers a valid order (Rolland et al., 2022, Lemma 1). Let γ>0 be the minimum nonleaf Hessian-diagonal variance over all valid leaf-removal sequences. If estimated variances are within γ/2 of their oracle values at every stage, recursive SCORE recovers a valid order. This does not show that SCORE-EM attains this accuracy, and our estimator's DAG recovery also requires consistent parent selection (Q3).
Imputation bias vanishes at the true model for any missingness rate, so the rate enters through estimation error; bounds in observation probabilities, sample size, and signal strength require controlling score-estimation, imputation, and refinement errors jointly, which we leave to future work.
Q2. Practitioners can inspect complete-case fractions, pairwise co-observation counts, and joint counts for each node with its estimated parents. Model-dependent diagnostics include sampler stability, residual normality and constant variance, held-out predictive coverage, leaf-statistic gaps relative to between-imputation variability, and edge-selection frequencies. Stability does not establish correctness (Q5).
Observed data cannot generally distinguish MAR from an observationally equivalent MNAR model, establish causal sufficiency, or validate mechanisms outside observed support. We recommend shifting imputed Xj values by δσ^j for δ∈[−0.5,−0.25,0,0.25,0.5], repeating ordering and pruning, and reporting sensitivity.
Q3. Equation (1) is broader than the class supported by our edge selection. SCORE's population ordering criterion permits interactions, but provisional screening and final CAM pruning use additive regressions and can miss interaction-only parents even with complete data and the true order.
For independent standard Gaussian roots, let X3=(X12−1)(X22−1)+ε with centered noise. Then E[X3∣X1]=E[X3∣X2]=0, so the population additive projection is zero. We will clarify in Section 3 and Appendices 9.4 and 10 that edge recovery requires a detectable additive component for each parent and consistent selection. We will add this limitation and the counterexample.
Q4. We compared full SCORE-EM with a variant holding the initial order fixed during MALA sampling and ANM refitting. Both used the same imputation model, number of completions, iteration cap, and MI-CAM pruning, and both estimated a final order from the completed datasets.
Across experiments at d=10, feedback improved mean F1 from 0.746 to 0.759, reduced SHD from 8.85 to 8.58, and reduced OD from 0.950 to 0.688 (28%). The fixed-order variant's OD is already well below MI+SCORE's (1.1–7.0 in Tables 4 and 6), so ANM-guided sampling provides most of the ordering gain and feedback adds the remainder; graph-recovery gains are modest.
Q5. Exact scores and conditional sampling do not guarantee recovery from arbitrary initialization. For independent X,ε∼N(0,1) and Y=X2−1+ε, let X be MCAR at rate κ. Under reversed order (Y,X) with fitted X∣Y∼N(0,1), completion yields qκ=(1−κ)pXY+κpXpY. Under qκ, symmetry gives E[X∣Y]=0 and Var(X)=1, so Gaussian regression refitting preserves this conditional. As κ→1, the curvature variance for X tends to zero while that for Y stays positive, so SCORE retains the reversed order. Numerically, this requires κ>0.94 (standardized) or 0.98 (raw) in this example; at κ≤0.9 SCORE rejects the reversed order.
Under MAR, true conditional imputations preserve the joint law, so the truth is also a fixed point. Q1's accuracy condition guarantees the ordering, but not that the iteration reaches it. We claim neither global convergence nor monotone observed-data likelihood, and will clarify these limits and add the counterexample.