- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper proposes a Bayesian method (called MissBGM) for imputation of tabular missing data, specifically going beyond point-wise estimates and providing a detailed discussion on uncertainty quantification. A number of empirical results are provided (showing MissBGM in a very favorable light compared to classical methods), along with a theoretical analysis.
Critical strengths
Excellent empirical results. A number of baselines methods are included and the proposed method is clearly out-performant of them. There can be no doubt that the proposed method can outperform a wide range of as-is approaches that appear in the literature, on the tasks considered.
Consideration of an explicit model of missingness is also a main strength of this work. Such a consideration is not present in much of the literature, where the MCAR model is taken essentially as an off-the-shelf supervised learning problem. In this sense, the problem setting is a modern one, deserved of consideration.
Critical weaknesses
Critical Weakness: Unrefined framing of the problem, in particular wrt related work.
It is difficult to pin down a general suggestion on how to improve the framing, but the issue is visible in: "This challenge is particularly acute..." in the Introduction, where there is no challenge explicitly mentioned. There is no motivating application. The sentence "Unlike existing methods that often focus on point estimates" definitely implies the proposed method - since point estimates are often (not always) a focus. Language should be more scientific and exact.
It feels like there is a missing 2.3 Bayesian-based Imputation Methods for which there is definitely a wealth of literature to discuss. The positioning feels incomplete without this; particularly regarding the previous point implying that the main limitation of existing work is the focus on point estimates.
Without a motivating application, we should expect more than only a few datasets, or at least more modern (e.g., the Wine dataset is from 1991), it is is difficult to motivate modern AI-powered generative modelling for such data.
This is consequential to the assessment because it becomes difficult to judge the potential impact of the work in this arguably-saturated field on missing-data imputation.
Authors should reconsider sentences such as "we establish convergence to a uniquely separated pseudo-true tempered target under explicit criterion, approximation, and optimization conditions" in the abstract -- such claims require more specifics for the reader to understand, the reader should not be expected to read the entire paper in order to understand the a abstract.
Questions for authors
What exactly is identified under MNAR ?
Why does the theory discuss , while the method defaults to =0.01 ? (and appears very sensitive in this small range)
Why are fully Bayesian imputation methods absent from the Related Work and comparisons?
What are the computational costs in absolute terms for the datasets?
Is there evidence of downstream-task success from your proposed approach?
8 comments
Response to Reviewer GN3k (2/3)
Missing literature for Bayesian imputation methods
Thank you for highlighting established Bayesian imputation methods. Our original paper already cited Rubin (1987), Schafer (1997), and van Buuren and Groothuis-Oudshoorn (2011), and our baseline ICE used Bayesian-ridge predictive sampling.
To further strengthen the empirical comparison, we additionally implemented two Bayesian approachs: MICE-norm and sbgcop. MICE-norm propagates regression-parameter and predictive uncertainty through Bayesian normal-regression conditionals. sbgcop performs Bayesian Gaussian-copula inference for dependence parameters and missing latent values, with empirical marginal reconstruction on the observed scale. These provide two established Bayesian imputation approaches with different modeling assumptions.
We additionally benchmarked these two methods under both simulation and real data MNAR settings and compared them with MissBGM and MissBGM-S. Each table entry reports predictive-mean RMSE using 1,000 retained imputations per run. The run each method with 10 seeds and show the average RMSE.
| Mechanism | Missing rate | MissBGM | MissBGM-S | MICE-norm | sbgcop | |
|---|---|---|---|---|---|---|
| MNAR | 500 | 30% | 1.620 | 1.281 | 1.623 | 1.621 |
| MNAR | 500 | 50% | 1.585 | 1.218 | 1.594 | 1.588 |
| MNAR | 500 | 70% | 1.673 | 1.263 | 1.677 | 1.677 |
| MNAR | 1,000 | 30% | 1.568 | 1.284 | 1.576 | 1.580 |
| MNAR | 1,000 | 50% | 1.538 | 1.199 | 1.548 | 1.544 |
| MNAR | 1,000 | 70% | 1.619 | 1.203 | 1.629 | 1.625 |
| MNAR | 5,000 | 30% | 1.599 | 1.288 | 1.601 | 1.590 |
| MNAR | 5,000 | 50% | 1.574 | 1.328 | 1.578 | 1.576 |
| MNAR | 5,000 | 70% | 1.662 | 1.548 | 1.672 | 1.671 |
| Dataset | MissBGM | MissBGM-S | MICE-norm | sbgcop |
|---|---|---|---|---|
| Wine | 0.682 | 0.725 | 0.767 | 0.768 |
| Breast | 0.511 | 0.576 | 0.543 | 0.576 |
| Concrete | 0.529 | 0.569 | 0.599 | 0.693 |
MissBGM-S achieves lowest RMSE across all MNAR simulation settings and outperform the two baselines by a large margin. MissBGM achieves better performance than the best baseline in 8 out of 9 settings. In the MNAR real datasets, MissBGM is the still the best among all methods, outperforming the best baseline (MICE-norm) by 5.9–11.7%. These results again support the supriority of our MissBGM methods.
Computational cost
Thank you for requesting dataset-specific computational costs. Appendix H reports running times on a moderate size of dataset with , , and a missing rate of . All experiments were conducted on the same Linux-based high-performance computing cluster managed by Slurm. The compute nodes were equipped with NVIDIA RTX 5000 Ada GPUs and dual-socket CPUs with 48 CPU cores per node. For each experiment, we requested a maximum wall-clock time of 3 days and 300 GB of memory. We summarize the running time as below.
| Method | Running time (minutes) |
|---|---|
| Mean | 0.13 |
| OT | 5.88 |
| Miceforest | 215.60 |
| ICE | 5.62 |
| GAIN | 11.15 |
| ForestDiffusion | 1,071.00 |
| TabCSDI | 2,905.83 |
| MissBGM | 16.17 |
The training and inference on a moderate size of dataset (, ) of MissBGM only takes less than 17 minutes while a few deep imputers (e.g., ForestDiffusion, TabCSDI) will take more than 10 hours.
In supplementary experiments, we further compared MissBGM and MissBGM-S across the 12 MNAR simulation settings. Note that MissBGM-S uses short HMC chains during training (2 burn-in sweeps and 4 retained samples). The ratio of mean total runtime for MissBGM-S to MissBGM ranged from 1.11 to 1.35. On Wine, Breast, Concrete and Gisette, MissBGM-S required 1.4, 3.9, 6.1, and 201.2 minutes, respectively, compared with 1.1, 3.1, 4.8, and 164.2 minutes for MissBGM. Overall, the running time of MissBGM-S is 11-35% higher than MissBGM.
Response to Reviewer GN3k (3/3)
Downstream task
Thank you for highlighting the importance of downstream evaluation. We have conducted a series of downstream experiments to improve coefficient estimation in linear regression using different imputation methods.
We retain the data-generating process, with fixed population parameters and analytically known regression coefficients. We use as the fully observed outcome and as predictors. Across 10 independent datasets of , we evaluate MNAR missing rates of 20% and 50%, with MCAR 20% as a reference. Missingness affects the 45 target predictors. The outcome is included in every imputation model. Each method provides 10 completed datasets, followed by separate OLS fits and Rubin pooling with Barnard–Rubin degrees of freedom for pointwise 95% confidence intervals. All configurations were fixed without task-specific tuning.
The table summarizes all 45 coefficients corresponding to potentially missing predictors. Bias and RMSE are calculated across datasets for each coefficient and then averaged across coefficients.
| Setting | Method | Mean absolute bias | Mean coefficient RMSE ↓ | coverage rate | Mean interval width |
|---|---|---|---|---|---|
| MNAR 20% | MissBGM | 0.00459 | 0.01697 | 99.56% | 0.09746 |
| MNAR 20% | MissBGM-S | 0.00464 | 0.01737 | 98.67% | 0.08935 |
| MNAR 20% | not-MIWAE | 0.00563 | 0.02322 | 88.00% | 0.07551 |
| MNAR 20% | GINA | 0.01171 | 0.02532 | 94.00% | 0.10381 |
| MNAR 50% | MissBGM | 0.01031 | 0.02276 | 100.00% | 0.15416 |
| MNAR 50% | MissBGM-S | 0.01140 | 0.02457 | 98.67% | 0.13040 |
| MNAR 50% | not-MIWAE | 0.01035 | 0.03142 | 84.44% | 0.09184 |
| MNAR 50% | GINA | 0.02956 | 0.05623 | 90.22% | 0.20168 |
| MCAR 20% | MissBGM | 0.00362 | 0.01581 | 99.56% | 0.09267 |
| MCAR 20% | MissBGM-S | 0.00436 | 0.01629 | 98.44% | 0.08465 |
| MCAR 20% | not-MIWAE | 0.00534 | 0.02121 | 88.67% | 0.07259 |
| MCAR 20% | GINA | 0.00824 | 0.02169 | 95.78% | 0.09479 |
| Complete-data reference | OLS | 0.00345 | 0.01558 | 94.89% | 0.06617 |
Default MissBGM achieves the lowest mean coefficient RMSE among all imputation methods in all three settings, reducing it over the best baseline (not-MIWAE), by 26.92%, 27.56%, and 25.46%, respectively. MissBGM-S also outperforms both baselines in mean coefficient RMSE and produces narrower intervals than default MissBGM.
These results provide direct evidence of downstream estimation of coefficient benefits from our MissBGM models. We will update the results in the revised paper.
Response to Reviewer GN3k (1/3)
We appreciate the reviewer's comments and suggestions. We address these points with additional experiments and have updated the paper and supplementary material. I apologize that I have to reply with three posts/replies here.
What exactly is identified under MNAR?
Without identifying restrictions, the observed-data distribution does not determine p(xmis∣xobs,r) (Linero & Daniels, 2018). Theorem 1 establishes consistency for a criterion-induced imputation law, rather than general identification under MNAR. In particular, A6 assumes uniqueness and separation of that law. Recovery of the true law by the default profiled estimator additionally requires A8, including correct specification and Fisher consistency of the profiling criterion.
Possible MNAR identification conditions include (i) no self-censoring, Rj⊥Xj∣X−j,R−j, with the required positivity conditions (Sadinle & Reiter, 2017); (ii) Gaussian selection models under appropriate conditions (Miao, Ding & Geng, 2016); or (iii) valid shadow variables under appropriate conditions (Miao et al., 2024). We do not claim that our current model architecture automatically satisfies these conditions.
In our MNAR simulation design, the full-data and missing-value conditional distributions are identifiable. Given fully observed anchors A, the target variables satisfy
R_j=\mathbf{1}\\{X_j\leq\mu_j(A)+\sigma_j\kappa\\},$$ where $\sigma_j > 0$ and the errors are independent standard Gaussian variables, independent of $A$. The observed response probability $P(R_j=1\mid A)=\Phi(\kappa)$ identifies $\kappa$. Writing $\lambda=\varphi(\kappa)/\Phi(\kappa)$, the observed conditional moments identify $$\sigma_j^2= \frac{\operatorname{Var}(X_j\mid A,R_j=1)} {1-\kappa\lambda-\lambda^2}, \qquad \mu_j(A)=E(X_j\mid A,R_j=1)+\sigma_j\lambda,$$ where the denominator is strictly positive. Thus, the observed-data law uniquely determines the Gaussian parameters and, under the stipulated conditional independence, the joint missing-value distribution through the corresponding upper-tail truncated Gaussian distributions. This establishes identification under our simulation assumptions. We have added this clarification to the revised paper. ## Role of $\beta$ in theory and practice Theorem 1 is formulated for a fixed $\beta$, including $\beta=0.01$, under A1–A6. It establishes convergence to the corresponding criterion-induced imputation law. The special role of $\beta=1$ is that it recovers the untempered model conditional. Identification and recovery of the true law require additional assumptions, including A8 for the profiled estimator. The default $\beta=0.01$ is an empirical choice for the original MAP procedure. To investigate the untempered alternative, we additionally implemented **MissBGM-S**, using $\beta=1$ in both training and inference. MissBGM-S replaces the MAP updates with alternating HMC updates of both $Z$ and $X_{\mathrm{mis}}$ conditional on the current parameters, making training consistent with the test stage. We then update $(\theta,\phi)$ using the average complete-data log-likelihood gradient over retained joint samples. MissBGM-S uses $\beta=1$ and a Bayesian neural network (use_bnn=True). We updated both the simulation and real-data benchmarks to include MissBGM-S in the revised paper. MissBGM-S reduced imputation RMSE and improved empirical coverage in all MNAR simulation settings, with improvements of 6.9%–25.7% relative to default MissBGM. On real datasets, MissBGM-S achieves slightly higher RMSE than the original MissBGM. We therefore retain both methods in the revised paper. We also updated the source code so the new results can be reproduced. These results demonstrate that improved MNAR performance is feasible without tempering ($\beta=1$).