arXiv Statistics ML By Alexis Ayme, R\'emi Khellaf

Handling Covariate Mismatch in Collaborative Linear Prediction

Read the original on arXiv Statistics ML →

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.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Statistics ML.

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 AI
Sep 24

Fed-ReMasker: Federated Tabular Imputation under Feature-Level Missingness

Fed-ReMasker is a federated learning approach that adapts the ReMasker masked autoencoder for tabular data imputation, specifically addressing feature-level missingness where entire features are absent at some centers. The method enables centers to impute unobserved features by leveraging knowledge from collaborating institutions. In benchmark tests on synthetic and real-world datasets, Fed-ReMasker achieves the lowest imputation error in the majority of scenarios and remains robust to client heterogeneity, closely matching the performance of a centralized model.

By Ioannis Papathanail, Rooholla Poursoleymani, Lubnaa Abdur Rahman, Stavroula Georgia Mougiakakou
arXiv Machine Learning
Oct 2

Hybrid Methods for Robust Tabular Data Imputation

The paper introduces two hybrid imputation methods, NuclearForest and SoftForest, that combine a low‑rank initialization (using Singular Value Thresholding or SoftImpute) with a single Random Forest refinement. These methods capture global covariance patterns and local nonlinear dependencies, respectively, and are benchmarked against seven existing techniques across MCAR, MAR, and MNAR scenarios. Results show comparable or superior imputation accuracy to state‑of‑the‑art iterative methods while achieving significant speedups of roughly 5.8× and 9.5× over MissForest.

By Jinwei Li, Michelle Bruch, Daniel Tenbrinck