English

Beyond Pooling: Matching for Robust Generalization under Data Heterogeneity

Machine Learning 2026-02-10 v1 Artificial Intelligence

Abstract

Pooling heterogeneous datasets across domains is a common strategy in representation learning, but naive pooling can amplify distributional asymmetries and yield biased estimators, especially in settings where zero-shot generalization is required. We propose a matching framework that selects samples relative to an adaptive centroid and iteratively refines the representation distribution. The double robustness and the propensity score matching for the inclusion of data domains make matching more robust than naive pooling and uniform subsampling by filtering out the confounding domains (the main cause of heterogeneity). Theoretical and empirical analyses show that, unlike naive pooling or uniform subsampling, matching achieves better results under asymmetric meta-distributions, which are also extended to non-Gaussian and multimodal real-world settings. Most importantly, we show that these improvements translate to zero-shot medical anomaly detection, one of the extreme forms of data heterogeneity and asymmetry. The code is available on https://github.com/AyushRoy2001/Beyond-Pooling.

Keywords

Cite

@article{arxiv.2602.07154,
  title  = {Beyond Pooling: Matching for Robust Generalization under Data Heterogeneity},
  author = {Ayush Roy and Rudrasis Chakraborty and Lav Varshney and Vishnu Suresh Lokhande},
  journal= {arXiv preprint arXiv:2602.07154},
  year   = {2026}
}

Comments

AISTATS 2026

R2 v1 2026-07-01T10:25:23.277Z