Provable Target Sample Complexity Improvements as Pre-Trained Models Scale
Not on the map. Why?
Abstract (arXiv)
Pre-trained models have become indispensable for efficiently building models across a broad spectrum of downstream tasks. The advantages of pre-trained models have been highlighted by empirical studies on scaling laws, which demonstrate that larger pre-trained models can significantly reduce the sample complexity of downstream learning. However, existing theoretical investigations of pre-trained models lack the capability to explain this phenomenon. In this paper, we provide a theoretical investigation by introducing a novel framework, caulking, inspired by parameter-efficient fine-tuning (PEFT) methods such as adapter-based fine-tuning, low-rank adaptation, and partial fine-tuning. Our analysis establishes that improved pre-trained models provably decrease the sample complexity of downstream tasks, thereby offering theoretical justification for the empirically observed scaling laws relating pre-trained model size to downstream performance, a relationship not covered by existing results.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 33 of its 47 references that are in the map. First posted on arXiv 4 Feb 2026.
Builds on
33 of 47 references.
References · 33
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,084
- 2023Visual Instruction Tuningcited by 7,792
- 2020Scaling Laws for Neural Language Modelscited by 6,411
- 2023BLIP-2: Bootstrapping Language-Image Pre-training with Frozen Image Encoders and Large Language Modelscited by 6,069
- 2019Parameter-Efficient Transfer Learning for NLPcited by 4,195
- 2023InstructBLIP: Towards General-purpose Vision-Language Models with Instruction Tuningcited by 2,855
- 2018Group Normalizationcited by 1,514
- 2017Deep Hashing Network for Unsupervised Domain Adaptationcited by 1,181
- 2025SigLIP 2: Multilingual Vision-Language Encoders with Improved Semantic Understanding, Localization, and Dense Featurescited by 1,127
- 2024Are We on the Right Way for Evaluating Large Vision-Language Models?cited by 893
- 2020Scaling Laws for Autoregressive Generative Modelingcited by 510
21 more
- 2017Nonparametric regression using deep neural networks with ReLU activation functioncited by 431
- 2020Parameter-Efficient Transfer Learning with Diff Pruningcited by 351
- 2023Transformers as Statisticians: Provable In-Context Learning with In-Context Algorithm Selectioncited by 291
- 2020Few-Shot Learning via Learning the Representation, Provablycited by 213
- 2024NVILA: Efficient Frontier Visual Language Modelscited by 206
- 2022Neural Networks can Learn Representations with Gradient Descentcited by 161
- 2020A survey on domain adaptation theory: learning bounds and theoretical guaranteescited by 109
- 2023Foundational Models in Medical Imaging: A Comprehensive Survey and Future Visioncited by 74
- 2019Nonparametric Regression on Low-Dimensional Manifolds using Deep ReLU Networks : Function Approximation and Statistical Recoverycited by 73
- 2018Marginal Singularity, and the Benefits of Labels in Covariate-Shiftcited by 65
- 2023Smoothing the Landscape Boosts the Signal for SGD: Optimal Sample Complexity for Learning Single Index Modelscited by 60
- 2022Optimally tackling covariate shift in RKHS-based nonparametric regressioncited by 53
- 2019Deep learning is adaptive to intrinsic dimensionality of model smoothness in anisotropic Besov spacecited by 46
- 2024Transformers are Minimax Optimal Nonparametric In-Context Learnerscited by 36
- 2022A Systematic Survey of Chemical Pre-trained Modelscited by 34
- 2022A new similarity measure for covariate shift with applications to nonparametric regressioncited by 33
- 2019On the minimax optimality and superiority of deep neural network learning over sparse parameter spacescited by 24
- 2021A Scaling Law for Synthetic-to-Real Transfer: How Much Is Your Pre-training Effective?cited by 14
- 2023Towards a Unified Analysis of Kernel-based Methods Under Covariate Shiftcited by 12
- 2023Classification Tree Pruning Under Covariate Shiftcited by 3
- 2024Harnessing the Power of Vicinity-Informed Analysis for Classification under Covariate Shiftcited by 1
Built on by
Not cited yet.