Statistical Benefits of Fine-Tuning from Pretrained Initialization in Diagonal Linear Networks
Not on the map. Why?
Abstract (arXiv)
Adapting pretrained models to downstream tasks with limited data has become a central paradigm in modern deep learning. Yet, despite its widespread practical success, how fine-tuning leverages information from pretraining remains poorly understood theoretically. We study fine-tuning from pretrained weights through the lens of sparse linear regression and two-layer diagonal linear networks. In our setting, pretraining provides information through the support (and signs) of the initialization predictor, which may contain coordinates relevant to the downstream task. We show how pretrained information reshapes the implicit bias and training dynamics, and can thereby reduce the sample complexity of recovering the target parameters and support. In particular, for a clean initialization with correctly inherited signs, we show that the required sample size is comparable to that of a weighted Lasso estimator that explicitly exploits the pretrained support through a suitably chosen regularizer. Our results thus show how information encoded in pretrained weights can be implicitly exploited by gradient-based fine-tuning, reducing the amount of data needed to recover a downstream task.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 23 of its 37 references that are in the map. First posted on arXiv 28 Sep 2026.
Builds on
23 of 37 references.
References · 23
- 2021Finetuned Language Models Are Zero-Shot Learnerscited by 3,780
- 2022Fine-Tuning can Distort Pretrained Features and Underperform Out-of-Distributioncited by 739
- 2018On Lazy Training in Differentiable Programmingcited by 675
- 2018Do Better ImageNet Models Transfer Better?cited by 565
- 2020Kernel and Rich Regimes in Overparametrized Modelscited by 306
- 2022A Kernel-Based View of Language Model Fine-Tuningcited by 121
- 2019Implicit Regularization for Optimal Sparse Recoverycited by 80
- 2022Gradient flow dynamics of shallow ReLU networks for square loss and orthogonal inputscited by 76
- 2021On the Implicit Bias of Initialization Shape: Beyond Infinitesimal Mirror Descentcited by 70
- 2023Saddle-to-Saddle Dynamics in Diagonal Linear Networkscited by 57
- 2019Exponentiated Gradient Meets Gradient Descentcited by 32
- 2022Incremental Learning in Diagonal Linear Networkscited by 28
11 more
- 2022The Power and Limitation of Pretraining-Finetuning for Linear Regression under Covariate Shiftcited by 26
- 2019High-Dimensional Linear Regression via Implicit Regularizationcited by 25
- 2024Understanding Linear Probing then Fine-tuning Language Models from NTK Perspectivecited by 22
- 2020The Statistical Complexity of Early-Stopped Mirror Descentcited by 19
- 2021A Theoretical Analysis of Fine-tuning with Linear Teacherscited by 17
- 2014Sparse Recovery via Differential Inclusionscited by 11
- 2023Inductive biases of multi-task learning and finetuning: multiple regimes of feature reusecited by 9
- 2025Provable Benefits of Unsupervised Pre-training and Transfer Learning via Single-Index Modelscited by 6
- 2026A Theory of How Pretraining Shapes Inductive Bias in Fine-Tuningcited by 5
- 2025Transfer Learning in Infinite Width Feature Learning Networkscited by 3
- 2026Incremental Learning in Mirror Flowscited by 2
Built on by
Not cited yet.