Paperlane

no. 17 · Wednesday 18 November 2026

Semi-Supervised Learning with Noisy Proxy Covariates: Generalization Bounds and Distribution Regression

Kwangho Kim and Jisu Kim

math.IT · v2

Abstract

In many modern machine learning pipelines, abundant pretrained representations serve as noisy proxy covariates, while task-specific labels remain scarce. We study semi-supervised regression in this setting, and propose a simple two stage estimator that learns kernel eigenfeatures from all proxy covariates and fits a ridge predictor on labeled data. We derive finite sample bounds showing that fast labeled sample rates are recovered when proxy perturbation is controlled and unlabeled proxy covariates are sufficiently abundant. We also show that distribution regression is a direct special case, with analogous guarantees when the finite bag size is large enough. Experiments show consistent gains over supervised and semi-supervised baselines, especially in low label regimes.

journal
Proceedings of the 43rd International Conference on Machine Learning (ICML 2026)
fields
Information Theory
pdf ↗ page arXiv:2606.00512 ↗