Understanding Optimal Feature Transfer via a Fine-Grained Bias-Variance Analysis
Not on the map. Why?
Abstract (arXiv)
In the transfer learning paradigm models learn useful representations (or features) during a data-rich pretraining stage, and then use the pretrained representation to improve model performance on data-scarce downstream tasks. In this work, we explore transfer learning with the goal of optimizing downstream performance. We introduce a simple linear model that takes as input an arbitrary pretrained feature transform. We derive exact asymptotics of the downstream risk and its textitfine-grained bias-variance decomposition. We then identify the pretrained representation that optimizes the asymptotic downstream bias and variance averaged over an ensemble of downstream tasks. Our theoretical and empirical analysis uncovers the surprising phenomenon that the optimal featurization is naturally sparse, even in the absence of explicit sparsity-inducing priors or penalties. Additionally, we identify a phase transition where the optimal pretrained representation shifts from hard selection to soft selection of relevant features.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 50 of its 81 references that are in the map. First posted on arXiv 18 Apr 2024.
Builds on
50 of 81 references.
References · 50
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
- 2023GPT-4 Technical Reportcited by 18,132
- 2020Scaling Laws for Neural Language Modelscited by 6,411
- 2017Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networkscited by 4,861
- 2022Training Compute-Optimal Large Language Modelscited by 2,927
- 2021Convex optimizationcited by 2,479
- 2019Strategies for Pre-training Graph Neural Networkscited by 964
- 2020Scaling Laws for Autoregressive Generative Modelingcited by 510
- 2019Surprises in High-Dimensional Ridgeless Least Squares Interpolationcited by 508
- 2018A Mean Field View of the Landscape of Two-Layers Neural Networkscited by 463
- 2018Meta-Learning for Semi-Supervised Few-Shot Classificationcited by 456
- 2019The generalization error of random features regression: Precise asymptotics and double descent curvecited by 410
38 more
- 2020Rethinking Pre-training and Self-trainingcited by 352
- 2018Meta-Transfer Learning for Few-Shot Learningcited by 306
- 2021Scaling Laws for Transfercited by 265
- 2020Few-Shot Learning via Learning the Representation, Provablycited by 213
- 2019Two models of double descent for weak featurescited by 194
- 2020On the Theory of Transfer Learning: The Importance of Task Diversitycited by 186
- 2020Feature Learning in Infinite-Width Neural Networkscited by 182
- 2019To Tune or Not to Tune? Adapting Pretrained Representations to Diverse Taskscited by 167
- 2020Provable Meta-Learning of Linear Representationscited by 161
- 2019Linearized two-layers neural networks in high dimensioncited by 155
- 2022The Unsurprising Effectiveness of Pre-Trained Vision Models for Controlcited by 155
- 2015High-Dimensional Asymptotics of Prediction: Ridge Regression and Classificationcited by 146
- 2022High-dimensional Asymptotics of Feature Learning: How One Gradient Step Improves the Representationcited by 146
- 2020Rethinking Bias-Variance Trade-off for Generalization of Neural Networkscited by 107
- 2020Optimal Regularization Can Mitigate Double Descentcited by 107
- 2020The Neural Tangent Kernel in High Dimensions: Triple Descent and a Multi-Scale Theory of Generalizationcited by 101
- 2020On the Optimal Weighted ℓ2 Regularization in Overparameterized Linear Regressioncited by 97
- 2023Not All Features Matter: Enhancing Few-shot CLIP with Adaptive Prior Refinementcited by 84
- 2018A modern maximum-likelihood theory for high-dimensional logistic regressioncited by 79
- 2019Graph Representation Learning: A Surveycited by 75
- 2020Understanding Double Descent Requires a Fine-Grained Bias-Variance Decompositioncited by 75
- 2021Universal Representation Learning from Multiple Domains for Few-shot Classificationcited by 56
- 2023Revisiting Scalarization in Multi-Task Learning: A Theoretical Perspectivecited by 51
- 2022Dimension free ridge regressioncited by 50
- 2019Learning What and Where to Transfercited by 43
- 2020Robust Meta-learning for Mixed Linear Regression with Small Batchescited by 41
- 2021How Fine-Tuning Allows for Effective Meta-Learningcited by 41
- 2022Towards Sample-efficient Overparameterized Meta-learningcited by 21
- 2023Provable Guarantees for Nonlinear Feature Learning in Three-Layer Neural Networkscited by 18
- 2022Rethinking Few-Shot Object Detection on a Multi-Domain Benchmarkcited by 17
- 2019Algorithmic Analysis and Statistical Estimation of SLOPE via Approximate Message Passingcited by 14
- 2023Improved Active Multi-Task Representation Learning via Lassocited by 9
- 2014An Analysis of Unsupervised Pre-training in Light of Recent Advancescited by 8
- 2020A Meta-Learning Approach for Graph Representation Learning in Multi-Task Settingscited by 8
- 2024Meta-Learning with Generalized Ridge Regression: High-dimensional Asymptotics, Optimality and Hyper-covariance Estimationcited by 5
- 2024Meta Learning in Bandits within Shared Affine Subspacescited by 4
- 2023Representation Transfer Learning via Multiple Pre-trained models for Linear Regressioncited by 2
- 2024Bridging Domains with Approximately Shared Featurescited by 2
Built on by
Citing papers per year: 2024: 1; 2025: 1.
2 papers.