AI & ML
Semi-Supervised Learning with Noisy Proxy Covariates: Generalization Bounds and Distribution Regression
arXiv stat.ML0 views
arXiv:2606.00512v2 Announce Type: replace-cross 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.
Source:https://arxiv.org/abs/2606.00512PreviousOn Minimal Observation Time for Recovering Latent Hawkes NetworksNextGraph Cascades: Contagion-Based Mesoscopic Rewiring for Structure-Aware Graph Machine Learning
Related posts
BenchAudit – Auditing LLM benchmarks for leaks, data reuse, and harness gaps
0Hacker News New
Guillotine DJ – Announcement Trailer
0Hacker News New
Researchers hijack Hugging Face account for popular Kokoro AI model
0Hacker News New
Automated LLM Fine-Tuning: GPU Selection, Dataset Analysis and Feedback
0Hacker News New
Human-written Launch HN posts get more upvotes than AI-generated ones
0Hacker News New

Parallels Desktop review
0TechRadar