Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
97 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
44 tokens/sec
o3 Pro
5 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Towards Estimating Transferability using Hard Subsets (2301.06928v1)

Published 17 Jan 2023 in cs.LG and cs.AI

Abstract: As transfer learning techniques are increasingly used to transfer knowledge from the source model to the target task, it becomes important to quantify which source models are suitable for a given target task without performing computationally expensive fine tuning. In this work, we propose HASTE (HArd Subset TransfErability), a new strategy to estimate the transferability of a source model to a particular target task using only a harder subset of target data. By leveraging the internal and output representations of model, we introduce two techniques, one class agnostic and another class specific, to identify harder subsets and show that HASTE can be used with any existing transferability metric to improve their reliability. We further analyze the relation between HASTE and the optimal average log likelihood as well as negative conditional entropy and empirically validate our theoretical bounds. Our experimental results across multiple source model architectures, target datasets, and transfer learning tasks show that HASTE modified metrics are consistently better or on par with the state of the art transferability metrics.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (9)
  1. Tarun Ram Menta (7 papers)
  2. Surgan Jandial (14 papers)
  3. Akash Patil (1 paper)
  4. Vimal KB (1 paper)
  5. Saketh Bachu (8 papers)
  6. Balaji Krishnamurthy (68 papers)
  7. Chirag Agarwal (39 papers)
  8. Mausoom Sarkar (23 papers)
  9. Vineeth N. Balasubramanian (11 papers)

Summary

We haven't generated a summary for this paper yet.