← Reference · Nestor G Pestelos Jr · Print this page
Machine Learning · Deep Learning · Artificial Intelligence
Model Transfer
Reference entry · last updated August 30, 2026
Model transfer (often termed transfer learning) is a machine learning paradigm in which parameters, representations, or statistical features acquired while training on a source task are transferred to improve learning efficiency and predictive accuracy on a distinct target task.[1] By reusing pre-trained representations, model transfer circumvents the need to train deep architectures from scratch for every novel problem domain.[2]
Mathematical framework
Following the formalization by Sinno Jialin Pan and Qiang Yang, transfer learning operates over domains and tasks.[1] A domain \( \mathcal{D} = \{\mathcal{X}, P(X)\} \) consists of a feature space \( \mathcal{X} \) and a marginal probability distribution \( P(X) \), where \( X = \{x_1, \dots, x_n\} \in \mathcal{X} \).
Given a specific domain \( \mathcal{D} \), a task \( \mathcal{T} = \{\mathcal{Y}, f(\cdot)\} \) consists of a label space \( \mathcal{Y} \) and an objective predictive function \( f(\cdot) \), learned from training pairs \( \{x_i, y_i\} \) with \( x_i \in \mathcal{X}, y_i \in \mathcal{Y} \).
Transfer learning aims to improve the learning of the target predictive function \( f_T(\cdot) \) in target domain \( \mathcal{D}_T \) using knowledge gained from source domain \( \mathcal{D}_S \) and source task \( \mathcal{T}_S \), where \( \mathcal{D}_S \neq \mathcal{D}_T \) or \( \mathcal{T}_S \neq \mathcal{T}_T \).[1]
Core transfer categories
Transfer learning methods are generally categorized by the availability of labeled data across source and target domains:[1]
- Inductive transfer learning: The target task differs from the source task (\( \mathcal{T}_T \neq \mathcal{T}_S \)), regardless of whether source and target domains match. Labeled data in the target domain is required to adapt the model.
- Transductive transfer learning (domain adaptation): The source and target tasks are identical (\( \mathcal{T}_T = \mathcal{T}_S \)), but the domains differ (\( \mathcal{D}_S \neq \mathcal{D}_T \)). Labeled data is available only in the source domain.
- Unsupervised transfer learning: No labeled data is available in either source or target domains during transfer. The model transfers latent clustering or representation spaces.
Mechanisms and fine-tuning techniques
In deep neural networks, lower layers learn general features (such as edge detectors in computer vision or token embeddings in language models), while upper layers capture task-specific abstractions.[3] Practitioners employ several common adaptation strategies:
- Feature extraction: The weights of the pre-trained backbone are frozen. Feature representations from intermediate layers are passed to a new, lightweight classification head trained on the target task.
- Full fine-tuning: All weights across the entire network are updated using a small target dataset with a low learning rate.
- Parameter-Efficient Fine-Tuning (PEFT): The original model weights remain frozen, and lightweight adapter modules or low-rank decomposition matrices (such as LoRA) are inserted to minimize computational overhead and memory usage.[4]
Pre-training in foundation models
Transfer learning forms the architectural backbone of modern artificial intelligence.[5] In the pre-train and fine-tune paradigm, large foundation models (such as BERT, GPT, and modern vision transformers) are trained on massive, unlabelled datasets using self-supervised objectives (such as masked language modeling or next-token prediction).[6]
Once pre-trained, the model transfers linguistic and world knowledge to downstream specialized tasks with minimal supervision, including few-shot and zero-shot in-context transfer without updating weight matrices.[7]
Failure modes and negative transfer
Transfer learning does not guarantee performance gains. Key engineering challenges include:
- Negative transfer: When the source and target domains share minimal mutual information or exhibit conflicting causal structures, transferring weights can degrade performance relative to training from scratch.[1]
- Catastrophic forgetting: Updating model weights on a new target dataset can overwrite representations needed for the original source task.[8]
- Domain shift: Changes in input distributions between training and deployment environments can degrade transferred representations over time.
See also
- Deep Neural Networks
- Neural Networks
- Machine Learning
- Large Language Models
- Model Router
- Reinforcement Learning
- Retrieval-Augmented Generation
References
- ↑ Sinno Jialin Pan and Qiang Yang, “A Survey on Transfer Learning,” IEEE Transactions on Knowledge and Data Engineering, vol. 22, no. 10, pp. 1345–1359, 2010. DOI: 10.1109/TKDE.2009.191.
- ↑ Chuanqi Tan, Fuchun Sun, Tao Kong, Wenchang Zhang, Chao Yang, and Chunfang Liu, “A Survey on Deep Transfer Learning,” in Artificial Neural Networks and Machine Learning – ICANN 2018, Springer, 2018, pp. 270–279.
- ↑ Jason Yosinski, Jeff Clune, Yoshua Bengio, and Hod Lipson, “How transferable are features in deep neural networks?,” in Advances in Neural Information Processing Systems (NeurIPS), vol. 27, 2014.
- ↑ Edward J. Hu, Yelong Shen, Phillip Wallis, Zeyuan Allen-Zhu, Yuanzhi Li, Shean Wang, Lu Wang, and Weizhu Chen, “LoRA: Low-Rank Adaptation of Large Language Models,” in International Conference on Learning Representations (ICLR), 2022.
- ↑ Rishi Bommasani et al., “On the Opportunities and Risks of Foundation Models,” arXiv preprint arXiv:2108.07258, 2021.
- ↑ Jacob Devlin, Ming-Wei Chang, Kenton Lee, and Kristina Toutanova, “BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding,” in NAACL-HLT, 2019, pp. 4171–4186.
- ↑ Tom B. Brown et al., “Language Models are Few-Shot Learners,” in Advances in Neural Information Processing Systems (NeurIPS), vol. 33, 2020, pp. 1877–1901.
- ↑ Michael McCloskey and Neal J. Cohen, “Catastrophic Interference in Connectionist Networks: The Sequential Learning Problem,” in Psychology of Learning and Motivation, vol. 24, Academic Press, 1989, pp. 109–165.