Understanding the Transferability of Representations via Task-Relatedness

Akshay Mehra, Yunbei Zhang, Jihun Hamm
7/3/2023
cs.LG

Official code: hammlab/TaskTransferAnalysis (3 stars, last commit 2025-02-23).

Abstract

The growing popularity of transfer learning, due to the availability of models pre-trained on vast amounts of data, makes it imperative to understand when the knowledge of these pre-trained models can be transferred to obtain high-performing models on downstream target tasks. However, the exact conditions under which transfer learning succeeds in a cross-domain cross-task setting are still poorly understood. To bridge this gap, we propose a novel analysis that analyzes the transferability of the representations of pre-trained models to downstream tasks in terms of their relatedness to a given reference task. Our analysis leads to an upper bound on transferability in terms of task-relatedness, quantified using the difference between the class priors, label sets, and features of the two tasks. Our experiments using state-of-the-art pre-trained models show the effectiveness of task-relatedness in explaining transferability on various vision and language tasks. The efficient computability of task-relatedness even without labels of the target task and its high correlation with the model's accuracy after end-to-end fine-tuning on the target task makes it a useful metric for transferability estimation. Our empirical results of using task-relatedness to select the best pre-trained model from a model zoo for a target task highlight its utility for practical problems.

View on arXivView PDF

Code Implementations(1)

Analysis of Task Transferability in Large Pre-trained Classifiers.

30PythonJul 3, 20231 years ago

Similar Papers

Cite this paper

@article{mehra2023understanding,
  title  = {Understanding the Transferability of Representations via Task-Relatedness},
  author = {Akshay Mehra and Yunbei Zhang and Jihun Hamm},
  year   = {2023},
  eprint = {2307.00823},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2307.00823v2},
  journal = {NEURIPS 2023 2023}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2307.00823.svg)](https://codeofpaper.com/paper/2307.00823)

Discussion