Layered Stacking Ensemble Promises Sharper Fixes for Missing Data

Missing values are the quiet saboteurs of modern data analysis. Whether the data come from clinical trials, national surveys, sensor networks or economic registers, some entries are almost always absent, and how analysts cope with those gaps can determine whether a study’s conclusions hold up or quietly fall apart. A new study published in PLOS One by Muhammad Asif and Klairung Samart proposes a fresh answer to this old problem: an imputation technique called Layered Stacking, which borrows the logic of ensemble machine learning to fill in the blanks with unusually accurate estimates of continuous values.

The most common response to incomplete records is deceptively simple: throw them away. Analysts who delete every row containing a missing entry, an approach known as complete-case analysis, end up with a dataset that is smaller, potentially biased and statistically less powerful. If the people who failed to answer a questionnaire differ systematically from those who did, the surviving sample no longer represents the population it was drawn from. Even when the missingness is benign, discarding data inflates uncertainty and weakens statistical estimates, a cost that grows rapidly as the proportion of missing entries climbs.

Imputation offers an alternative. Instead of deleting incomplete cases, imputation methods replace each missing value with a plausible estimate inferred from the rest of the data. Done well, this preserves sample size, retains information that deletion would destroy and yields more reliable downstream estimates. The catch is that imputation is itself a prediction problem: to fill in a missing number, an algorithm must model how that number relates to everything else in the record. The quality of the fill-in therefore depends entirely on the quality of the predictive model doing the filling, which is precisely where the new study concentrates its effort.

Asif and Samart’s proposal, Layered Stacking, is built on the idea of stacking, an ensemble strategy in which multiple different models are trained to solve the same problem and their predictions are then combined by a higher-level model that learns when to trust each one. Rather than relying on a single imputation algorithm, Layered Stacking organizes several base learners into layers, letting each layer refine the estimates produced by the one beneath it. The architecture is designed specifically for continuous missing values, the numeric fields where small imputation errors can compound into distorted means, variances and regression coefficients.

To find out whether the added complexity pays off, the researchers ran comprehensive simulation studies built on four distinct data-generating processes. Each simulated dataset was generated under the missing-at-random mechanism, the widely assumed scenario in which the probability that an entry is missing depends on other observed variables but not on the missing value itself. The experiments spanned sample sizes of 500, 1,000, 5,000 and 10,000 observations, and missingness rates of 10, 20, 30 and 40 percent, a grid that captures everything from small studies with modest gaps to large datasets with substantial holes.

The benchmark competition was demanding. Layered Stacking was pitted against five imputation techniques that are widely used in practice: k-nearest neighbors, which averages the values of the most similar complete records; support vector regression, which fits flexible boundaries in a transformed feature space; decision trees, which partition the data through a cascade of yes-or-no questions; random forests, which average many decorrelated trees; and extreme gradient boosting, the sequential ensemble method that has dominated tabular machine-learning competitions for years. Each method was asked to impute the same missing entries under the same conditions, allowing a direct, like-for-like comparison.

Performance was scored with two complementary metrics. The mean squared imputation error, or MSIE, penalizes large mistakes heavily and therefore rewards methods that rarely produce wildly wrong estimates. The mean absolute percentage imputation error, or MAPIE, expresses the average error as a percentage of the true value, making results comparable across variables measured on different scales. The authors also reported the standard deviation of the errors across replications, along with 95 percent confidence intervals, so that differences between methods could be judged against the noise inherent in repeated simulation runs rather than a single lucky or unlucky draw.

The headline result is that Layered Stacking generally achieved lower MSIE than all five benchmark models, with its advantage becoming particularly pronounced on larger datasets. That pattern makes intuitive sense: ensemble methods that learn how to combine base learners need enough data to estimate the combination reliably, so the payoff of stacking grows as sample size increases. For analysts working with the large, messy datasets that characterize contemporary research, the finding suggests that the extra computational cost of a layered ensemble may be repaid in measurably more accurate imputations, which in turn feed into more trustworthy statistical models built on top of the completed data.

Simulations alone can flatter a method in ways real data never do, so the authors also tested Layered Stacking on two real-world datasets. These datasets bring irregularities that no data-generating process fully captures: skewed distributions, awkward correlations between variables and missingness patterns shaped by human behavior rather than mathematical rules. The real-data evaluation served as a sanity check on the simulation findings, and the study reports that the method’s performance carried over, reinforcing the case that the gains are not an artifact of carefully controlled synthetic conditions.

The broader significance of the work lies in what it says about the state of imputation practice. Methods like k-nearest neighbors and random forest imputation have become default choices in statistical software, and extreme gradient boosting has been increasingly adopted for its raw predictive power. Showing that a layered stacking ensemble can beat these established baselines, especially at scale, nudges the field toward treating imputation not as a preprocessing afterthought but as a modeling problem worthy of the same ensemble sophistication applied to prediction tasks. For anyone who has watched a regression analysis wobble because a fifth of the data contained holes, the message is appealing: the blanks in a dataset need not be a permanent tax on statistical accuracy, and the tools for filling them are getting better.

Subject of Research: Machine learning methods for imputing missing continuous data

Article Title: A layered stacking ensemble approach for missing data imputation

Article References: Asif, M., & Samart, K. (2026). A layered stacking ensemble approach for missing data imputation. PLOS One, 21(10), e0359843. https://doi.org/10.1371/journal.pone.0359843

Image Credits: AI Generated

DOI: 10.1371/journal.pone.0359843

Keywords: missing data, imputation, stacking ensemble, machine learning, PLOS One, simulation study, missing at random, random forest, gradient boosting, statistics, data science, mean squared error