k-NN as a Simple and Effective Estimator of Transferability

Moein Sorkhei, Christos Matsoukas, Johan Fredin Haslum, Emir Konuk, Kevin Smith
3/24/2025
cs.LGcs.CV

No confident code implementation found for this paper.

Abstract

How well can one expect transfer learning to work in a new setting where the domain is shifted, the task is different, and the architecture changes? Many transfer learning metrics have been proposed to answer this question. But how accurate are their predictions in a realistic new setting? We conducted an extensive evaluation involving over 42,000 experiments comparing 23 transferability metrics across 16 different datasets to assess their ability to predict transfer performance. Our findings reveal that none of the existing metrics perform well across the board. However, we find that a simple k-nearest neighbor evaluation -- as is commonly used to evaluate feature quality for self-supervision -- not only surpasses existing metrics, but also offers better computational efficiency and ease of implementation.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Cite this paper

@article{sorkhei2025knn,
  title  = {k-NN as a Simple and Effective Estimator of Transferability},
  author = {Moein Sorkhei and Christos Matsoukas and Johan Fredin Haslum and Emir Konuk and Kevin Smith},
  year   = {2025},
  eprint = {2503.18528},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2503.18528v2}
}

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/2503.18528.svg)](https://codeofpaper.com/paper/2503.18528)

Discussion