High-dimensional Analysis of Knowledge Distillation: Weak-to-Strong Generalization and Scaling Laws
Abstract: A growing number of machine learning scenarios rely on knowledge distillation where one uses the output of a surrogate model as labels to supervise the training of a target model. In this work, we provide a sharp characterization of this process for ridgeless, high-dimensional regression, under two settings: (i) model shift, where the surrogate model is arbitrary, and (ii) distribution shift, where the surrogate model is the solution of empirical risk minimization with out-of-distribution data. In both cases, we characterize the precise risk of the target model through non-asymptotic bounds in terms of sample size and data distribution under mild conditions. As a consequence, we identify the form of the optimal surrogate model, which reveals the benefits and limitations of discarding weak features in a data-dependent fashion. In the context of weak-to-strong (W2S) generalization, this has the interpretation that (i) W2S training, with the surrogate as the weak model, can provably outperform training with strong labels under the same data budget, but (ii) it is unable to improve the data scaling law. We validate our results on numerical experiments both on ridgeless regression and on neural network architectures.
- Phi-3 technical report: A highly capable language model locally on your phone, 2024. URL https://arxiv.org/abs/2404.14219.
- Explaining neural scaling laws. Proceedings of the National Academy of Sciences, 121(27):e2311878121, 2024.
- Benign overfitting in linear regression. Proceedings of the National Academy of Sciences, 117(48):30063–30070, 2020.
- Reconciling modern machine-learning practice and the classical bias–variance trade-off. Proceedings of the National Academy of Sciences, 116(32):15849–15854, 2019.
- A dynamical model of neural scaling laws, 2024a. URL https://arxiv.org/abs/2402.01092.
- How feature learning can improve neural scaling laws, 2024b. URL https://arxiv.org/abs/2409.17858.
- Weak-to-strong generalization: Eliciting strong capabilities with weak supervision, 2023. URL https://arxiv.org/abs/2312.09390.
- Provable benefits of overparameterization in model compression: From double descent to pruning neural networks. In Proceedings of the AAAI Conference on Artificial Intelligence, volume 35, pp. 6974–6983, 2021.
- Quantifying the gain in weak-to-strong generalization, 2024. URL https://arxiv.org/abs/2405.15116.
- Dimension free ridge regression, 2024. URL https://arxiv.org/abs/2210.08571.
- Generalization error rates in kernel regression: the crossover from the noiseless to noisy regime. Journal of Statistical Mechanics: Theory and Experiment, 2022(11):114004, 2022.
- Data filtering networks, 2023. URL https://arxiv.org/abs/2309.17425.
- Self-training converts weak learners to strong learners in mixture models. In International Conference on Artificial Intelligence and Statistics, pp. 8003–8021. PMLR, 2022.
- Textbooks are all you need, 2023. URL https://arxiv.org/abs/2306.11644.
- The distribution of ridgeless least squares interpolators, 2023. URL https://arxiv.org/abs/2307.02044.
- Surprises in high-dimensional ridgeless least squares interpolation, 2020. URL https://arxiv.org/abs/1903.08560.
- Deep residual learning for image recognition, 2015. URL https://arxiv.org/abs/1512.03385.
- Deep learning scaling is predictable, empirically, 2017. URL https://arxiv.org/abs/1712.00409.
- Distilling the knowledge in a neural network, 2015. URL https://arxiv.org/abs/1503.02531.
- Scaling laws for learning with real and surrogate data, 2024. URL https://arxiv.org/abs/2402.04376.
- Scaling laws for neural language models, 2020. URL https://arxiv.org/abs/2001.08361.
- Towards a statistical theory of data selection under weak supervision, 2023. URL https://arxiv.org/abs/2309.14563.
- Learning multiple layers of features from tiny images. Technical Report 0, University of Toronto, Toronto, Ontario, 2009. URL https://www.cs.toronto.edu/~kriz/learning-features-2009-TR.pdf.
- Theoretical analysis of weak-to-strong generalization, 2024. URL https://arxiv.org/abs/2405.16043.
- Scaling laws in linear regression: Compute, parameters, and data, 2024a. URL https://arxiv.org/abs/2406.08466.
- Rho-1: Not all tokens are what you need, 2024b. URL https://arxiv.org/abs/2404.07965.
- Minimum-norm interpolation under covariate shift, 2024. URL https://arxiv.org/abs/2404.00522.
- A solvable model of neural scaling laws, 2022. URL https://arxiv.org/abs/2210.16859.
- Self-distillation amplifies regularization in hilbert space. Advances in Neural Information Processing Systems, 33:3351–3361, 2020.
- The generalization error of max-margin linear classifiers: Benign overfitting and high dimensional asymptotics in the overparametrized regime, 2023. URL https://arxiv.org/abs/1911.01544.
- On student-teacher deviations in distillation: does it pay to disobey? Advances in Neural Information Processing Systems, 36:5961–6000, 2023.
- A theoretical characterization of semi-supervised learning with self-training for gaussian mixture models. In International Conference on Artificial Intelligence and Statistics, pp. 3601–3609. PMLR, 2021.
- 4+3 phases of compute-optimal neural scaling laws, 2024. URL https://arxiv.org/abs/2405.15074.
- Optimal ridge regularization for out-of-distribution prediction, 2024. URL https://arxiv.org/abs/2404.01233.
- Asymptotics of ridge (less) regression under general source condition. In International Conference on Artificial Intelligence and Statistics, pp. 3889–3897. PMLR, 2021.
- The smallest singular value of a random rectangular matrix, 2009. URL https://arxiv.org/abs/0802.3956.
- The eigenlearning framework: A conservation law perspective on kernel ridge regression and wide neural networks. Transactions on Machine Learning Research, 2023.
- More is better in modern machine learning: when infinite overparameterization is optimal and overfitting is obligatory, 2024. URL https://arxiv.org/abs/2311.14646.
- Generalization error of min-norm interpolators in transfer learning, 2024. URL https://arxiv.org/abs/2406.13944.
- Beyond neural scaling laws: beating power law scaling via data pruning. Advances in Neural Information Processing Systems, 35:19523–19536, 2022.
- Asymptotic learning curves of kernel methods: empirical data versus teacher–student paradigm. Journal of Statistical Mechanics: Theory and Experiment, 2020(12):124001, 2020.
- Regularized linear regression: A precise analysis of the estimation error. In Conference on Learning Theory, pp. 1683–1709. PMLR, 2015.
- A. Tsigler and P. L. Bartlett. Benign overfitting in ridge regression, 2022. URL https://arxiv.org/abs/2009.14286.
- Self-instruct: Aligning language models with self-generated instructions. In Proceedings of the 61st Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), pp. 13484–13508, 2023.
- More than a toy: Random matrix models predict how real-world neural representations generalize, 2022a. URL https://arxiv.org/abs/2203.06176.
- Theoretical analysis of self-training with deep networks on unlabeled data, 2022b. URL https://arxiv.org/abs/2010.03622.
- Denny Wu and Ji Xu. On the optimal weighted ℓ_2ℓ_2\ell\_2roman_ℓ _ 2 regularization in overparameterized linear regression. Advances in Neural Information Processing Systems, 33:10112–10123, 2020.
- Precise high-dimensional asymptotics for quantifying heterogeneous transfers, 2023. URL https://arxiv.org/abs/2010.11750.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.