Inductive biases of multi-task learning and finetuning: multiple regimes of feature reuse
Not on the map. Why?
Abstract (arXiv)
Neural networks are often trained on multiple tasks, either simultaneously (multi-task learning, MTL) or sequentially (pretraining and subsequent finetuning, PT+FT). In particular, it is common practice to pretrain neural networks on a large auxiliary task before finetuning on a downstream task with fewer samples. Despite the prevalence of this approach, the inductive biases that arise from learning multiple tasks are poorly characterized. In this work, we address this gap. We describe novel implicit regularization penalties associated with MTL and PT+FT in diagonal linear networks and single-hidden-layer ReLU networks. These penalties indicate that MTL and PT+FT induce the network to reuse features in different ways. 1) Both MTL and PT+FT exhibit biases towards feature reuse between tasks, and towards sparsity in the set of learned features. We show a "conservation law" that implies a direct tradeoff between these two biases. 2) PT+FT exhibits a novel "nested feature selection" regime, not described by either the "lazy" or "rich" regimes identified in prior work, which biases it to rely on a sparse subset of the features learned during pretraining. This regime is much narrower for MTL. 3) PT+FT (but not MTL) in ReLU networks benefits from features that are correlated between the auxiliary and main task. We confirm these findings empirically with teacher-student models, and introduce a technique -- weight rescaling following pretraining -- that can elicit the nested feature selection regime. Finally, we validate our theory in deep neural networks trained on image classification. We find that weight rescaling improves performance when it causes models to display signatures of nested feature selection. Our results suggest that nested feature selection may be an important inductive bias for finetuning neural networks.
Key facts. Cited by 9 papers in the map (data through 7 Oct 2026). Builds on 44 of its 57 references that are in the map. First posted on arXiv 3 Oct 2023.
Builds on
44 of 57 references.
References · 44
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 29,915
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
- 2021On the Opportunities and Risks of Foundation Modelscited by 3,961
- 2019Similarity of Neural Network Representations Revisitedcited by 1,695
- 2018On the Spectral Bias of Neural Networkscited by 1,321
- 2017A Survey on Multi-Task Learningcited by 838
- 2022Fine-Tuning can Distort Pretrained Features and Underperform Out-of-Distributioncited by 722
- 2017The Implicit Bias of Gradient Descent on Separable Datacited by 649
- 2018Do Better ImageNet Models Transfer Better?cited by 560
- 2016Reinforcement Learning with Unsupervised Auxiliary Taskscited by 400
- 2023A Comprehensive Survey on Pretrained Foundation Models: A History from BERT to ChatGPTcited by 364
32 more
- 2019Gradient Descent Maximizes the Margin of Homogeneous Neural Networkscited by 308
- 2020Kernel and Rich Regimes in Overparametrized Modelscited by 302
- 2020Implicit Bias of Gradient Descent for Wide Two-layer Neural Networks Trained with the Logistic Losscited by 267
- 2018Implicit Bias of Gradient Descent on Linear Convolutional Networkscited by 251
- 2015The Benefit of Multitask Representation Learningcited by 194
- 2022A Survey of Vision-Language Pre-Trained Modelscited by 177
- 2021The Low-Rank Simplicity Bias in Deep Networkscited by 150
- 2020Implicit Regularization in Deep Learning May Not Be Explainable by Normscited by 118
- 2019A Function Space View of Bounded Norm Infinite Width ReLU Nets: The Multivariate Casecited by 113
- 2020Understanding and Improving Information Transfer in Multi-Task Learningcited by 113
- 2021Implicit Bias of SGD for Diagonal Linear Networks: a Provable Benefit of Stochasticitycited by 107
- 2019How do infinite width bounded norm networks look in function space?cited by 105
- 2020Shape Matters: Understanding the Implicit Bias of the Noise Covariancecited by 88
- 2021Continual Learning in the Teacher-Student Setup: Impact of Task Similaritycited by 86
- 2022How catastrophic can catastrophic forgetting be in linear regression?cited by 80
- 2022Gradient flow dynamics of shallow ReLU networks for square loss and orthogonal inputscited by 74
- 2020Implicit Bias in Deep Linear Classification: Initialization Scale vs Training Accuracycited by 70
- 2021On the Implicit Bias of Initialization Shape: Beyond Infinitesimal Mirror Descentcited by 69
- 2023Theory on Forgetting and Generalization of Continual Learningcited by 69
- 2020Gradient descent follows the regularization path for general lossescited by 57
- 2022Neural networks trained with SGD learn distributions of increasing complexitycited by 50
- 2021Near-Minimax Optimal Estimation With Shallow ReLU Neural Networkscited by 40
- 2023Overwriting Pretrained Bias with Finetuning Datacited by 32
- 2023Continual Learning in Linear Classification on Separable Datacited by 31
- 2021Should We Be Pre-training? An Argument for End-task Aware Training as an Alternativecited by 26
- 2021How do Quadratic Regularizers Prevent Catastrophic Forgetting: The Role of Interpolationcited by 19
- 2020A Brief Review of Deep Multi-task Learning and Auxiliary Task Learningcited by 18
- 2021A Theoretical Analysis of Fine-tuning with Linear Teacherscited by 17
- 2022When to Use Multi-Task Learning vs Intermediate Fine-Tuning for Pre-Trained Encoder Transfer Learningcited by 17
- 2023Variation Spaces for Multi-Output Neural Networks: Insights on Multi-Task Learning and Network Compressioncited by 17
- 2022Maslow's Hammer for Catastrophic Forgetting: Node Re-Use vs Node Activationcited by 16
- 2023Provable Multi-Task Representation Learning by Two-Layer ReLU Neural Networkscited by 15
Built on by
Citing papers per year: 2024: 1; 2025: 2; 2026: 6.
9 papers.
- 2025Position: Solve Layerwise Linear Models First to Understand Neural Dynamical Phenomena (Neural Collapse, Emergence, Lazy/Rich Regime, and Grokking)cited by 8
- 2026A Theory of How Pretraining Shapes Inductive Bias in Fine-Tuningcited by 5
- 2024A Bayesian Model Selection Criterion for Selecting Pretraining Checkpointscited by 4
- 2026Beyond Compromise: Pareto-Lenient Consensus for Efficient Multi-Preference LLM Alignmentcited by 2
- 2025Improving Large-Scale Recommender Systems with Auxiliary Learningcited by 1
- 2026A mathematical theory of balancing relational generalization and memorizationcited by 0
- 2026Early Prediction of Future Behavioral Strategy from Process Tracescited by 0
- 2026Two-Timescale Fine-tuning Provably Learns New Features for Two-Layer ReLU Networkscited by 0
- 2026Statistical Benefits of Fine-Tuning from Pretrained Initialization in Diagonal Linear Networkscited by 0
- 2026Statistical Benefits of Fine-Tuning from Pretrained Initialization in Diagonal Linear Networks28 Sep 2026
- 2026Two-Timescale Fine-tuning Provably Learns New Features for Two-Layer ReLU Networks28 Sep 2026
- 2026Early Prediction of Future Behavioral Strategy from Process Traces28 May 2026
- 2026A mathematical theory of balancing relational generalization and memorization21 May 2026
- 2026Beyond Compromise: Pareto-Lenient Consensus for Efficient Multi-Preference LLM Alignment7 Apr 2026
- 2026A Theory of How Pretraining Shapes Inductive Bias in Fine-Tuning23 Feb 2026
- 2025Improving Large-Scale Recommender Systems with Auxiliary Learning2 Oct 2025
- 2025Position: Solve Layerwise Linear Models First to Understand Neural Dynamical Phenomena (Neural Collapse, Emergence, Lazy/Rich Regime, and Grokking)28 Feb 2025
- 2024A Bayesian Model Selection Criterion for Selecting Pretraining Checkpoints8 Oct 2024