These Are Not All the Features You Are Looking For: A Fundamental Bottleneck in Supervised Pretraining
Not on the map. Why?
Abstract (arXiv)
Transfer learning is widely used to adapt large pretrained models to new tasks with only a small amount of new data. However, a challenge persists -- the features from the original task often do not fully cover what is needed for unseen data, especially when the relatedness of tasks is not clear. Since deep learning models tend to learn very sparse representations, they retain only the minimal features required for the initial training while discarding potentially ones for downstream transfer. A theoretical framework developed in this work demonstrates that such pretraining captures inconsistent aspects of the data distribution, therefore, inducing transfer bias. To address this limitation, we propose an inexpensive ensembling strategy that aggregates multiple models to generate richer feature representations. On ResNet, this approach yields a 9% improvement in transfer accuracy without incurring extra pretraining cost. We also present empirical evidence from a range of deep learning studies, confirming that the phenomenon is pervasive across modern deep learning architectures. These results suggests that relying solely on large pretrained networks is not always the most effective way to improve model generalization. Instead, fostering richer, more diverse representations -- e.g. - through model ensembles -- can substantially enhance transfer learning performance.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 21 of its 33 references that are in the map. First posted on arXiv 23 Jun 2025.
Builds on
21 of 33 references.
References · 21
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2021On the Opportunities and Risks of Foundation Modelscited by 4,033
- 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,621
- 2016Equality of Opportunity in Supervised Learningcited by 2,007
- 2019Invariant Risk Minimizationcited by 1,854
- 2019Distributionally Robust Neural Networks for Group Shifts: On the Importance of Regularization for Worst-Case Generalizationcited by 1,247
- 2017Deeper, Broader and Artier Domain Generalizationcited by 986
- 2020Prevalence of Neural Collapse during the terminal phase of deep learning trainingcited by 719
- 2016Inherent Trade-Offs in the Fair Determination of Risk Scorescited by 586
- 2022Last Layer Re-Training is Sufficient for Robustness to Spurious Correlationscited by 381
- 2017Implicit Regularization in Matrix Factorizationcited by 322
- 2020Gradient Starvation: A Learning Proclivity in Neural Networkscited by 267
9 more
- 2021On Calibration and Out-of-domain Generalizationcited by 134
- 2022SGD with Large Step Sizes Learns Sparse Featurescited by 68
- 2022The Effects of Regularization and Data Augmentation are Class Dependentcited by 67
- 2020How fine can fine-tuning be? Learning efficient language modelscited by 41
- 2022Rich Feature Construction for the Optimization-Generalization Dilemmacited by 34
- 2025Accelerating Neural Network Training: An Analysis of the AlgoPerf Competitioncited by 32
- 2024Specialized Foundation Models Struggle to Beat Supervised Baselinescited by 24
- 2022Learning useful representations for shifting tasks and distributionscited by 14
- 2023Understanding the Detrimental Class-level Effects of Data Augmentationcited by 13
Built on by
Citing papers per year: 2026: 1.
1 paper.