arXiv (All)
open access
Quadratic Weak-to-Strong Generalization in Random Feature Networks via Random Matrix Theory
Weak-to-strong generalization is the phenomenon where a strong student model trained with labels produced by a weak teacher model is able to generalize better than the teacher. In this paper, we study this phenomenon in two-layer random feature networks where the model strength is determined by its
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Path Regularization: A Near-Complete and Optimal Nonasymptotic Generalization Theory for Multilayer Neural Networks and Double Descent Phenomenon#1062760
- Adaptive Regularization via Extreme Value Distributions for Gaussian Graphical Models#972729
- Anticoncentration and State Design of Random Tensor Networks#218276
- Transfer Learning via Regularized Random-effects Linear Discriminant Analysis.#1236372
- Spurious correlations in high dimensional regression: The roles of regularization, simplicity bias and over-parameterization#1158449
Record · ID 1233083
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive