Missing Data and Prediction
Sarah Fletcher Mercaldo, Jeffrey D. Blume

TL;DR
This paper introduces Pattern Mixture Kernel Submodels (PMKS), a computationally efficient method for handling missing data that improves prediction accuracy over standard strategies, especially under Missing at Random conditions.
Contribution
The paper demonstrates that PMKS provides superior predictive performance compared to traditional missing data methods and introduces the MIMI model for assessing MAR assumptions.
Findings
PMKS outperforms zero, mean, and complete-case imputation.
PMKS generally exceeds multiple imputation in predictive accuracy.
MIMI model helps evaluate the MAR assumption.
Abstract
Missing data are a common problem for both the construction and implementation of a prediction algorithm. Pattern mixture kernel submodels (PMKS) - a series of submodels for every missing data pattern that are fit using only data from that pattern - are a computationally efficient remedy for both stages. Here we show that PMKS yield the most predictive algorithm among all standard missing data strategies. Specifically, we show that the expected loss of a forecasting algorithm is minimized when each pattern-specific loss is minimized. Simulations and a re-analysis of the SUPPORT study confirms that PMKS generally outperforms zero-imputation, mean-imputation, complete-case analysis, complete-case submodels, and even multiple imputation (MI). The degree of improvement is highly dependent on the missingness mechanism and the effect size of missing predictors. When the data are Missing at…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStatistical Methods and Bayesian Inference · Bayesian Methods and Mixture Models · Statistical Methods and Inference
