Skip to content
DraconiticResearch
Search Sources API
197,693 studies31 sourcesUpdated 52 min ago
PreprintCC BY 4.0arXiv

Robust-by-Design Distributional Learning from Contaminated Samples

Abstract

Modern data analysis pipelines increasingly rely on large datasets assembled through retrieval, scraping, automated filtering, and post-hoc curation, where the observed sample is often a contaminated mixture rather than the target population. Standard distributional objectives either ignore contamination and converge to the wrong target, or retain only a small trusted subset and discard most of the data. We study supervised and unsupervised learning when a clean reference sample is compared with a pooled sample from r=(1−ε)q+εz, where q is the latent target distribution and z is an unknown contaminant. Motivated by settings with noisy membership scores for all observations and exact labels for a small audited subset, we propose contamination-corrected maximum mean discrepancy (CC-MMD), a design-based estimator that combines proxy scores with audited residual corrections to recover the oracle MMD that would have been computed from the latent clean sample. CC-MMD requires no calibration assumption on the proxy scores and no structural assumptions on the contaminant beyond standard kernel regularity. We prove finite-population design-unbiasedness of the corrected kernel sums, establish asymptotic normality of the audit correction, and show consistency for the target discrepancy MMD2(p,q;k). Empirically, CC-MMD tracks the oracle under increasing contamination, improves parameter recovery and prediction in contaminated regression, and enables generative models trained on heavily corrupted mixtures to recover the clean target distribution. These results show that contaminated data need not be discarded or treated as the estimand. With sparse trusted labels and abundant noisy supervision, distributional objectives can be made robust by design.

Related

  1. Robust Covariance Estimation for Entry-wise Contaminated and Partially Observed Data via Expectation Maximization Algorithm
    Matys Savidan, Mohammed Nabil El Korso
    arXivPreprintarXiv licenceFull textStatisticsarXiv
  2. Wilcoxon Random Forests for Robust Distributional Prediction
    Danni Shi, Bryan E Shepherd, Chun Li
    arXivPreprintarXiv licenceFull textStatisticsarXiv
  3. Online Inference in Distributional Temporal-Difference Learning
    Yang Peng, Liangyu Zhang
    arXivPreprintCC BY 4.0Full textStatisticsarXiv
  4. Identifying Panel Conditioning with Refreshment Samples: Sharp Bounds and Design Assumptions
    Shoki Okubo
    arXivPreprintarXiv licenceFull textStatisticsarXiv
  5. Distributional Balancing with Machine Learning for Clinical Trial Augmentation Using Real-World Data
    Zern Ke, Mingshi Cui, Gemma Moran +1
    arXivPreprintarXiv licenceFull textStatisticsarXiv
BibTeX
@misc{gligic2026robustbydesign,
  title = {{Robust-by-Design Distributional Learning from Contaminated Samples}},
  author = {Nevena Gligić and Arya Farahi},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.40884},
  eprint = {2610.40884},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.40884},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - Robust-by-Design Distributional Learning from Contaminated Samples
AU  - Nevena Gligić
AU  - Arya Farahi
PY  - 2026
DA  - 2026/10/29
PB  - arXiv
DO  - 10.48550/arxiv.2610.40884
UR  - https://arxiv.org/abs/2610.40884
AB  - Modern data analysis pipelines increasingly rely on large datasets assembled through retrieval, scraping, automated filtering, and post-hoc curation, where the observed sample is often a contaminated mixture rather than the target population. Standard distributional objectives either ignore contamination and converge to the wrong target, or retain only a small trusted subset and discard most of the data. We study supervised and unsupervised learning when a clean reference sample is compared with a pooled sample from r=(1−ε)q+εz, where q is the latent target distribution and z is an unknown contaminant. Motivated by settings with noisy membership scores for all observations and exact labels for a small audited subset, we propose contamination-corrected maximum mean discrepancy (CC-MMD), a design-based estimator that combines proxy scores with audited residual corrections to recover the oracle MMD that would have been computed from the latent clean sample. CC-MMD requires no calibration assumption on the proxy scores and no structural assumptions on the contaminant beyond standard kernel regularity. We prove finite-population design-unbiasedness of the corrected kernel sums, establish asymptotic normality of the audit correction, and show consistency for the target discrepancy MMD^2(p,q;k). Empirically, CC-MMD tracks the oracle under increasing contamination, improves parameter recovery and prediction in contaminated regression, and enables generative models trained on heavily corrupted mixtures to recover the clean target distribution. These results show that contaminated data need not be discarded or treated as the estimand. With sparse trusted labels and abundant noisy supervision, distributional objectives can be made robust by design.
ER  -