The Mechanism of Weak-to-Strong Generalization: Feature Elicitation from Latent Knowledge
Not on the map. Why?
Abstract (arXiv)
Weak-to-strong (W2S) generalization, in which a strong model is fine-tuned on outputs of a weaker, task-specialized model, has been proposed as an approach to aligning superhuman AI systems. Existing theoretical analyses either fix the student's representations or operate in restricted settings. Whether multi-step SGD can succeed in feature learning while preserving diverse pre-trained capabilities remains open. We study W2S in the setting of reward-model learning with two-layer neural networks. The strong model has pre-trained representations organized into low-dimensional subspaces Vk, and is fine-tuned under the supervision of a weak model specialized on task kappa. We prove that the strong model efficiently learns task kappa, eliciting its pre-trained knowledge while retaining general capabilities. This establishes W2S generalization in the feature-learning regime, in the sense that the strong model acquires the target feature direction through W2S training, rather than having it given a priori. Moreover, W2S preserves pre-trained off-target features, whereas standard supervised fine-tuning causes catastrophic forgetting when off-target feature directions are correlated with the target's. Numerical experiments on synthetic data confirm our theoretical results.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 50 of its 60 references that are in the map. First posted on arXiv 13 May 2026.
Builds on
50 of 60 references.
References · 50
- 2023Steering Language Models With Activation Engineeringcited by 824
- 2023The Linear Representation Hypothesis and the Geometry of Large Language Modelscited by 679
- 2023An Empirical Study of Catastrophic Forgetting in Large Language Models During Continual Fine-tuningcited by 622
- 2021Knowledge Neurons in Pretrained Transformerscited by 590
- 2023Weak-to-Strong Generalization: Eliciting Strong Capabilities With Weak Supervisioncited by 445
- 2023Emergent Linear Representations in World Models of Self-Supervised Sequence Modelscited by 313
- 2023Language Models Represent Space and Timecited by 306
- 2023Linearity of Relation Decoding in Transformer Language Modelscited by 190
- 2022Neural Networks can Learn Representations with Gradient Descentcited by 161
- 2022High-dimensional Asymptotics of Feature Learning: How One Gradient Step Improves the Representationcited by 146
- 2023SGD learning on neural networks: leap complexity and saddle-to-saddle dynamicscited by 142
- 2023Understanding Catastrophic Forgetting in Language Models via Implicit Inferencecited by 138
38 more
- 2020Online stochastic gradient descent on non-convex losses from high-dimensional inferencecited by 119
- 2023Task-Specific Skill Localization in Fine-tuned Language Modelscited by 104
- 2023Language Models Implement Simple Word2Vec-style Vector Arithmeticcited by 97
- 2024Aligner: Efficient Alignment by Learning to Correctcited by 96
- 2022Learning Single-Index Models with Shallow Neural Networkscited by 92
- 2022Neural Networks Efficiently Learn Low-Dimensional Representations with SGDcited by 61
- 2023Smoothing the Landscape Boosts the Signal for SGD: Optimal Sample Complexity for Learning Single Index Modelscited by 60
- 2023Learning time-scales in two-layers neural networkscited by 57
- 2024The Benefits of Reusing Batches for Gradient Descent in Two-Layer Networks: Breaking the Curse of Information and Leap Exponentscited by 50
- 2023A Theory of Non-Linear Feature Learning with One Gradient Step in Two-Layer Neural Networkscited by 46
- 2024Theoretical Analysis of Weak-to-Strong Generalizationcited by 46
- 2024Neural network learns low-dimensional polynomials with SGD near the information-theoretic limitcited by 45
- 2024Quantifying the Gain in Weak-to-Strong Generalizationcited by 40
- 2022Two-stage LLM Fine-tuning with Less Specialization and More Generalizationcited by 39
- 2024Computational-Statistical Gaps in Gaussian Single-Index Modelscited by 39
- 2024Repetita Iuvant: Data Repetition Allows SGD to Learn High-Dimensional Multi-Index Functionscited by 35
- 2020Learning Polynomials of Few Relevant Dimensionscited by 34
- 2023Gradient-Based Feature Learning under Structured Datacited by 32
- 2024Pretrained transformer efficiently learns low-dimensional target functions in-contextcited by 29
- 2025Toward universal steering and monitoring of AI modelscited by 29
- 2025Emergence and scaling laws in SGD learning of shallow neural networkscited by 29
- 2025Learning quadratic neural networks in high dimensions: SGD dynamics and scaling lawscited by 23
- 2024High-dimensional Analysis of Knowledge Distillation: Weak-to-Strong Generalization and Scaling Lawscited by 21
- 2024Weak-to-Strong Generalization Through the Data-Centric Lenscited by 21
- 2023Beyond NTK with Vanilla Gradient Descent: A Mean-Field Analysis of Neural Networks with Polynomial Width, Samples, and Timecited by 20
- 2024Your Weak LLM is Secretly a Strong Teacher for Alignmentcited by 20
- 2024Disentangling and Mitigating the Impact of Task Similarity for Continual Learningcited by 19
- 2024Provable Weak-to-Strong Generalization via Benign Overfittingcited by 16
- 2024Learning sum of diverse features: computational hardness and efficient gradient-based training for ridge combinationscited by 13
- 2024On the Complexity of Learning Sparse Functions with Statistical and Gradient Queriescited by 13
- 2025Weak-to-Strong Generalization Even in Random Feature Networks, Provablycited by 13
- 2022Statistical-Computational Trade-offs in Tensor PCA and Related Problems via Communication Complexitycited by 12
- 2025Discrepancies are Virtue: Weak-to-Strong Generalization through Lens of Intrinsic Dimensioncited by 10
- 2025Representations Shape Weak-to-Strong Generalization: Theoretical Insights and Empirical Predictionscited by 9
- 2024Learning Gaussian Multi-Index Models with Gradient Flow: Time Complexity and Directional Convergencecited by 8
- 2025On the Mechanisms of Weak-to-Strong Generalization: A Theoretical Perspectivecited by 7
- 2025Propagation of Chaos in One-hidden-layer Neural Networks beyond Logarithmic Timecited by 3
- 2025From Linear to Nonlinear: Provable Weak-to-Strong Generalization through Feature Learningcited by 3
Built on by
Citing papers per year: 2026: 1.
1 paper.
- 2026Scaling Properties of Same-Family On-Policy Distillationcited by 0
- 2026Scaling Properties of Same-Family On-Policy Distillation26 Sep 2026