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
SALA: Semantically Aligned Latent Actions Enable Dual-Axis Scaling of Embodied Foundation Models
0arXiv cs.RO
What Can a VLA Learn from the Agent That Calls It? Task-Level Experience Distillation for Embodied Navigation
0arXiv cs.RO
Fast Inference-Time Policy Refinement via Action-Affine World Models
0arXiv cs.RO
Data-Driven Configuration of Protective Separation Zones in Collaborative Robot Cells from Operator Occupancy
0arXiv cs.RO
VLALagBench: Understanding When and Why VLA Inference Latency Matters
0arXiv cs.RO
Linear Recurrent Memory Suffices to Distil a World-Model Policy for Robot Air Hockey
0arXiv cs.RO