- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes CG-DIFF, a diffusion-based method for continuous tabular imputation under the Self-Masking MNAR case. The proposed method combines a masked forward-diffusion objective trained only at observed positions, a Causal-Graph-guided Noise Estimator using KAN projections and graph-masked attention, and reverse sampling that repeatedly restores observed coordinates to their time-matched noisy values. Two graph supports are considered: parents plus self and Markov blanket plus self. Evaluation uses four synthetic SCM families with artificially generated Self-Masking MNAR and one complete ADNI subset. CG-DIFF is compared with nine imputation methods. Its Markov-blanket variant has the lowest reported mean RMSE in 9/12 synthetic settings and all three ADNI masking-rate settings.
Critical strengths
A coherent method for incorporating structural side information. CG-DIFF combines masked diffusion training, graph-restricted information exchange, and repeated restoration of observed values in a technically coherent framework. The model is motivated by the difficulty of learning missing-case behavior from observed values alone under MNAR.
Promising results with unusually explicit graph provenance. CG-DIFF achieves the lowest reported mean RMSE across all synthetic conditions between its two graph variants and obtains the lowest mean in all three controlled ADNI conditions. The authors also appropriately label the ADNI graph as a literature-informed working prior rather than ground truth and disclose the evidence behind each edge
Critical weaknesses
The evaluation does not substantiate real-world MNAR effectiveness or robustness to the required graph. ADNI supplies real covariates but not real missingness: the paper selects a complete, small subset and imposes the same artificial mechanism used in simulation. Only one monotone self-masking family is evaluated, with no lower-tail, two-sided, nonlinear, variable-specific, multivariate, site-dependent, or naturally occurring missingness. Moreover, synthetic CG-DIFF receives the generator DAG, while ADNI uses a single hand-curated DAG. There is no edge-deletion/addition/reversal study, estimated-graph comparison, alternative plausible ADNI graph, or random/dense/self-only matched-capacity control. So the evidence does not show whether the method works under the uncertain graphs and heterogeneous mechanisms encountered in practice.
The theoretical and empirical evidence is incomplete and inconsistent. Theorem 3.1 motivates an oracle Markov-blanket conditional-mean predictor under an unverified covariance condition; it does not establish a result for CG-DIFF’s noised inputs, mask dropout, multi-hop attention, or reverse sampler. Empirically, the Markov-blanket advantage over parents is small on average in Table 6, reverses in several Table 1 settings, and is unsupported by paired confidence intervals or tests. Baseline tuning spaces, budgets, stopping rules, selected configurations, and run seeds are also not sufficiently documented.
Questions for authors
- I was wondering if you tested with more diverse MNAR mechanisms or stronger real-world scenarios? If not, the real-world MNAR claim should be softened/narrowed.
- How robust is CG-DIFF to missing, incorrect, or estimated graph edges, especially for the ADNI graph?
- How does Theorem 3.1 connect to the actual CG-DIFF model, and does its covariance condition hold empirically?
- Please report paired uncertainty estimates and clarify whether baseline tuning was comparable.
- Would you please explain why relevant diffusion baselines like CSDI, ForestDiffusion are not included in the experiments?