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: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: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
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
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.
arXiv:2606. 05073v1 Announce Type: new Abstract: Missing value imputation is a fundamental task in machine learning, with most existing methods assuming that all missing entries correspond to unobserved regular values.
By Lixing Zhang, Yidong Ouyang, Weifu Li, Shixiang Zhu, Guang Cheng, Liyan Xie
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:2607. 07767v1 Announce Type: cross Abstract: Missing values undermine statistical inference and machine learning pipelines, yet most imputation methods rely on heuristics or restrictive parametric assumptions that ignore the joint data distribution.
By Andrea Basteri, Carlo Ciliberto, Alessandro Rudi
Missing data are a fundamental challenge in statistical analysis and machine learning, as the choice of imputation method substantially impacts downstream inference. In this work, we propose two hybri...
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:2607. 28698v1 Announce Type: new Abstract: Flow matching assumes fully observed training data, which many real-world applications rarely provide.
By Fairoz Nower Khan, Nabuat Zaman Nahim, Peizhong Ju
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