An Active-Bottleneck Mechanism for Weak-to-Strong Generalization
Not on the map. Why?
Abstract (arXiv)
Weak-to-strong generalization (W2SG) occurs when a student trained on a teacher's predictions outperforms that teacher. We study when this happens under fully converged, ridgeless two-stage learning, with no early stopping, no explicit regularization, and no assumption that the student is more expressive than the teacher. In two-stage linear regression, a teacher is fit from n labeled examples and a student is trained solely on the teacher's predictions on m fresh, unlabeled inputs. Although both stages share the same hypothesis class and the same training rule, we show that the student outperforms the teacher exactly when m lies in an explicit intermediate range: too few pseudo-labels leave the student without enough signal, too many let it inherit the teacher's noise. Under power-law covariance, we derive this range in closed form as a function of the spectral decay and noise level, including regimes where the improving region splits into two disjoint intervals of m. We then study a random-feature model in which the student has strictly more features than the teacher, and identify two regimes, again given by explicit thresholds: one where improvement occurs only for m in a bounded interval, and one where it occurs only once the student width NS exceeds an explicit threshold. Both regimes are governed by a single "active-bottleneck" principle: whichever of m or NS is scarcer controls how much teacher error is filtered out, while increasing the other resource only reduces estimation noise. Together, these results show that finite data and finite width can themselves regularize a two-stage learner, with no explicit mechanism doing so.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 12 of its 32 references that are in the map. First posted on arXiv 27 Sep 2026.
Builds on
12 of 32 references.
References · 12
- 2023Weak-to-Strong Generalization: Eliciting Strong Capabilities With Weak Supervisioncited by 467
- 2024A Dynamical Model of Neural Scaling Lawscited by 111
- 2025Distillation Scaling Lawscited by 67
- 2025Weak-to-Strong Generalization Even in Random Feature Networks, Provablycited by 15
- 2025Discrepancies are Virtue: Weak-to-Strong Generalization through Lens of Intrinsic Dimensioncited by 12
- 2025Representations Shape Weak-to-Strong Generalization: Theoretical Insights and Empirical Predictionscited by 10
- 2025Relating Misfit to Gain in Weak-to-Strong Generalization Beyond the Squared Losscited by 8
- 2025Two-Point Deterministic Equivalence for Stochastic Gradient Dynamics in Linear Modelscited by 7
- 2025Weak-to-Strong Generalization via Bregman Bias-Variance Decompositioncited by 4
- 2026Improved Scaling Laws via Weak-to-Strong Generalization in Random Feature Ridge Regressioncited by 3
- 2026Weak-to-Strong Generalization is Nearly Inevitable (in Linear Models)cited by 2
- 2026On the Blessing of Pre-training in Weak-to-Strong Generalizationcited by 1
Built on by
Not cited yet.