AI & ML
Handling Covariate Mismatch in Collaborative Linear Prediction
arXiv stat.TH0 views
arXiv:2602.02083v2 Announce Type: replace Abstract: Training predictive models across multiple centers typically assumes that all centers collect the same set of covariates. In practice, however, they may record different features of their observations, a setting we refer to as covariate mismatch. We study linear prediction under this challenging setting, assuming center-wise MCAR missingness patterns, and develop estimators that exploit information across centers despite heterogeneous feature sets. In the low-dimensional regime, we propose a plug-in estimator of the oracle linear predictor based on component-wise aggregation of covariance and cross-moment estimates. In higher dimensions, we study an impute-then-regress strategy that first completes the missing covariates using an exchangeability-preserving imputation procedure and then fits a ridge-regularized linear model. All proposed estimators are compatible with federated learning constraints: individual-level data remain local to each center, and only aggregated quantities are exchanged. We provide asymptotic and finite-sample learning rates for our predictors, explicitly characterizing their behaviour with the global dimension, the center-specific feature partition, and the distribution of samples across centers, and validate our approach through numerical experiments.
Source:https://arxiv.org/abs/2602.02083Related posts
Hybrid retrieval with reciprocal rank fusion: notes from a RAG prototype
0dev.to
It is in co-creating, together. As humans do.
0dev.to
C64 Basic Dungeon Crawler: Stairs, Levels and Levelling Up (Part 11)
0Hacker News
Anthropic's internal AI use, at retail prices, now exceeds its employee pay
0Hacker News
Launch HN: Momentic (YC W24) – Agents that catch bugs by using your app
0Hacker News

Behavioral Design Unpacked: Nudges, Funnels & Persuasion | UX Unpacked #3
0dev.to UX