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
One sentence stopped my AI agents inventing data. Bad data that looked normal still fooled them.
0dev.to

How many tokens per second should an LLM serve on one GPU?
0dev.to
The 3 Lies Your AI Coding Agent Tells You Every Day (And How to Verify Them with Deterministic MCP Gates)
0dev.to
Gemini 4 Neon
0Hacker News
America’s AI Chip War Is Heating Up in the Dumbest Possible Ways
0Wired
Palmer Luckey thinks China is ‘thrilled to have Jensen out,’ so he wants the ousted Nvidia CEO reinstated
0TechCrunch