- Rating
- 2
- Confidence
- 3
- Informativeness
- 1
- Presentation
- 1
- Soundness
- 2
Read review
Paper summary
This paper proposes PI-NAIM, a hybrid framework for missing data imputation that combines statistical and neural approaches. The method integrates MICE for relatively simple missingness patterns and a temporally enhanced GAIN model for more complex cases. A dynamic routing mechanism is intended to select the appropriate imputation pathway, while cross-path attention combines the imputation representations. The framework further incorporates curriculum learning across MCAR, MAR, and MNAR missingness mechanisms and jointly optimizes imputation accuracy and downstream prediction.
The authors evaluate PI-NAIM on MIMIC-III and CIFAR image datasets. The reported results show improvements in imputation RMSE and downstream AUROC over several baselines. However, important inconsistencies in the methodological description and experimental results make it difficult to assess the reliability of these improvements.
Critical strengths
1. Practical motivation and potentially useful hybrid design.
Combining efficient statistical imputation with more expressive neural models is a reasonable approach to handling heterogeneous missingness patterns. The proposed routing and fusion mechanisms could offer a useful accuracy-efficiency trade-off if their effectiveness were demonstrated convincingly.
2. Consideration of both imputation and downstream prediction.
The paper evaluates reconstruction quality alongside downstream predictive performance and considers multiple missingness mechanisms. This is valuable because improved reconstruction error does not necessarily translate into better task performance.
Critical weaknesses
1. Major inconsistencies and ambiguities in the proposed methodology.
The dynamic routing mechanism is not consistently defined. Section 2.2.1 introduces a learned gating network that predicts routing probabilities from missingness embeddings and missingness rates. However, Equation (5) specifies deterministic routing using a fixed missingness threshold of 0.2. It is therefore unclear whether the routing mechanism is actually learned or rule-based.
Furthermore, the paper describes routing each sample to one imputation pathway, while the cross-path attention module requires outputs from both MICE and GAIN. The interaction between selective routing and dual-path fusion is not explained. This ambiguity also affects the claimed computational efficiency.
The end-to-end optimization claim is insufficiently justified because MICE involves iterative statistical estimation rather than a conventional differentiable neural module. The paper does not explain how gradients propagate through MICE or how the routing and fusion components are jointly optimized.
2. Experimental evidence is insufficient and, in several places, inconsistent with the claims.
The ablation results in Appendix Table 5 contradict the accompanying conclusions. Full PI-NAIM achieves an AUROC of 0.8725, whereas removing adaptive fusion increases AUROC to 0.8764, and removing the imputation path increases it to 0.8775. Despite these results, the paper claims that the complete architecture achieves the highest AUROC and that every component contributes positively.
Additionally, the ablation RMSE values differ substantially in scale from the main results (Table 2), without a clear explanation of the evaluation settings. Important experimental details, including data splitting, missingness simulation, hyperparameters, and variability across runs, are insufficiently documented.
Finally, the paper claims computational efficiency but provides no quantitative comparison of runtime, memory usage, or computational cost. Without these measurements, a central motivation for the dynamic routing architecture remains unvalidated.
Questions for authors
Q1. Routing mechanism: Is the dynamic path selection based on the learned gating network in Equation (4) or the fixed missingness threshold in Equation (5)? If learned routing is used, how is the gating network optimized, and how are routing decisions made during inference?
Q2. End-to-end differentiability and cross-path fusion: How are gradients propagated through the MICE branch during joint training? If each sample is routed to only one branch, how does the cross-path attention module access both imputation outputs? Are both branches executed during inference?
Q3. Ablation inconsistencies: In Appendix Table 5, removing adaptive fusion or the imputation path improves AUROC compared with the full model. How do the authors reconcile these findings with the claim that every component improves downstream performance? Additionally, why are the RMSE values in Table 5 substantially different from those in Table 2?
Q4. Experimental reproducibility and efficiency: Could the authors provide complete experimental configurations, including data split procedures, missingness generation protocols, hyperparameters, and results across multiple random seeds? Since computational efficiency is a central motivation, could the authors also report training and inference costs compared with MICE, GAIN, and NAIM?
We thank the reviewer for the clear summary and the identification of the main inconsistencies. We agree the current version does not convincingly demonstrate the claimed improvements.
Method. We will replace the conflicting routing descriptions (learned gate in Section 2.2.1 vs. fixed 0.2 threshold in Eq. 5) with one mechanism: per-sample MR_i = 1 - (1/d)Σ_j M_ij, learned gate G(E,MR_i), training with Gumbel-softmax/straight-through or REINFORCE plus an auxiliary routing loss, hard thresholding only at inference. Routing one sample to one branch is incompatible with cross-path attention requiring both MICE and GAIN outputs; both branches currently run for every sample, so the efficiency claim is unsupported. We will either report the two-branch model, remove the efficiency claim, and position the contribution as missingness-aware fusion, or add a separate hard-routing variant without fusion with runtime, memory, FLOPs, and per-branch counts. MICE is not differentiable; we will state that its outputs are detached and that the gate/fusion are trained jointly with the neural path and task loss, and replace "end-to-end" with "jointly trained with a detached statistical branch" unless a differentiable surrogate is used. The fusion weight uses X_true and y, unavailable at test time; we will use test-time proxies (discriminator/ensemble confidence, reconstruction consistency, predictive entropy), learn lambda_t on validation data, rerun all downstream results, and certify no test labels or held-out true values enter the forward pass.
Experiments. Table 5 shows removing adaptive fusion or the imputation path improves AUROC; we will revise the claims, report and analyze any case where the full model is not best, and correct the parameter-count row. We will recompute the ablation RMSE under the Table 2 protocol and explain any scale difference. We will provide splits, missingness simulation, hyperparameters, seeds, mean +/- std, and significance tests. We will report training/inference costs versus MICE, GAIN, and NAIM, including runtime, memory, FLOPs, and per-branch counts; if the two-branch model does not save compute, we will remove that claim. We will resolve Table 2/5/Fig. 2d by recomputation, define or remove "Default"/"Event," recompute PSNR/SSIM/MSE on the same masked pixels and range for Table 3, remove the nonexistent "w/o NAIM Path" row, and delete Sections 2.7-2.10, which duplicate 2.3-2.6.
Q1. Learned gate (Eq. 4); Eq. 5 removed; gate trained with Gumbel/REINFORCE or an auxiliary routing loss; hard thresholding at inference; MR per sample. Q2. MICE detached; both branches run for every sample in the current implementation, so fusion has both outputs and routing does not decide the output; we will remove the efficiency claim or add a separate hard-routing variant without fusion, and state which variant produces each result. Q3. Claims revised to match the ablations; any component whose removal improves AUROC will be reported and analyzed; RMSE recomputed under the Table 2 protocol. Q4. Complete configurations and variability provided; costs versus MICE/GAIN/NAIM reported, including runtime, memory, FLOPs, and per-branch counts.
We apologize for the errors. The revision will include a reproducibility checklist, corrected references, one consistent method specification, and a complete protocol, and will drop any claim (including SOTA or efficiency) that the corrected experiments do not support.