arXiv Statistics ML

A Unified Framework for Inference with General Missingness Patterns and Machine Learning Imputation

arXiv Machine Learning
Oct 7

Assumption-lean logistic regression with missing covariates

arXiv:2610.07292v1 Announce Type: cross Abstract: Missing covariates are frequently encountered in supervised learning problems, and classical methods for estimation using such data use carefully cho...

By Jyotishka Ray Choudhury, Kabir Aladin Verchand, Richard J. Samworth, Ashwin Pananjady
arXiv Machine Learning
Jul 2

Deep learning with missing data

arXiv:2504. 15388v3 Announce Type: replace-cross Abstract: In the context of multivariate nonparametric regression with missing covariates, we propose Pattern Embedded Neural Networks (PENNs), which can be applied in conjunction with any existing imputation technique.

By Tianyi Ma, Tengyao Wang, Richard J. Samworth
arXiv Machine Learning
Aug 7

Handling Missing Data in Probabilistic Regression Trees

arXiv:2608. 06195v1 Announce Type: cross Abstract: Probabilistic Regression Trees (PRTrees) are a smooth and consistent alternative to classical regression trees, producing continuous predictions through probabilistic split assignments.

By Taiane Schaedler Prass, Alisson Silva Neimaier, Guilherme Pumi
arXiv Machine Learning
Aug 19

One Pipeline, Many Transformers: Pattern-Specific Imputation Specialists for Tabular Missing Data

The paper introduces a pre‑training pipeline that creates transformer‑based imputation specialists for tabular data with specific missingness patterns. By featurizing entries, generating synthetic data with configurable missingness modules, and fitting on millions of synthetic tables, the pipeline produces pattern‑specific models that outperform dedicated methods for each missingness pattern. A default model trained only on MCAR data, TabImpute, remains robust across all tested patterns, and the authors release the pipeline, models, and a new benchmark of 42 datasets and 11 missingness patterns.

By Jacob Feitelberg, Dwaipayan Saha, Kyuseong Choi, Zaid Ahmad, Anish Agarwal, Raaz Dwivedi
Hugging Face Trending Papers
Aug 6

Handling Missing Data in Probabilistic Regression Trees

Probabilistic Regression Trees (PRTrees) are a smooth and consistent alternative to classical regression trees, producing continuous predictions through probabilistic split assignments. This paper extends the PRTree framework to accommodate missing predictor values directly during tree construction, eliminating the need for prior imputation.

Hugging Face Trending Papers
Jun 3

Learning What Not to Impute: An Uncertainty-Aware Diffusion Framework for Meaningful Missingness

Missing value imputation is a fundamental task in machine learning, with most existing methods assuming that all missing entries correspond to unobserved regular values. In many real-world datasets, however, missingness may arise from two distinct sources: some entries are meaningfully missing (intrinsically absent and semantically valid), while others are missing due to the observation process and should be imputed.

arXiv AI
Oct 19

Missing value imputation with adversarial random forests - MissARF

The paper introduces MissARF, a new imputation technique that uses adversarial random forests (ARF) for density estimation and data synthesis. MissARF can perform both single and multiple imputations by sampling from the conditional distribution estimated by ARF, conditioned on observed values. Experiments show that MissARF achieves imputation quality comparable to leading methods while offering faster runtimes and no extra cost for multiple imputations.

By Pegah Golchian, Jan Kapar, David S. Watson, Marvin N. Wright
arXiv Statistics ML
Oct 9

Handling Covariate Mismatch in Collaborative Linear Prediction

The paper addresses the problem of covariate mismatch in collaborative linear prediction, where different centers collect different sets of features. It proposes estimators that leverage information across centers under center-wise MCAR missingness, including a plug‑in estimator for low dimensions and an impute‑then‑regress strategy with ridge regularization for higher dimensions. All methods comply with federated learning constraints, exchanging only aggregated statistics, and the authors provide theoretical learning rates and numerical validation.

By Alexis Ayme, R\'emi Khellaf