atlas

Research map / Label-efficient and robust learning / Recognition and long-tail

Evaluating Transferability in Retrieval Tasks: An Approach Using MMD and Kernel Methods

CVPR 2024 · Label-efficient and robust learning › Recognition and long-tail · approach: Recommendation representation learning · 1 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's full text. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Proposes RetMMD, a training-free transferability metric for retrieval that uses kernel-based MMD between relevant and irrelevant document embeddings of pretrained models, averaged over queries, plus a retrieval-specific dataset distance.

Problem

Selecting the best pretrained model or source dataset for retrieval tasks normally requires costly fine-tuning; existing transfer learning evaluation metrics target classification and do not directly apply to query-dependent retrieval.

Approach

Treat fine-tuning as learning a kernel mapping, and measure MMD between per-query relevant and irrelevant document embeddings on pretrained embeddings (with kernel selection via two-sample tests or SVM), averaged with inverse-frequency query weights, to predict post-fine-tuning retrieval performance; also measure dataset distance via per-query mean embeddings.

Key results

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use RetMMD-M rather than the compared transferability metricsRetrieval transferability evaluation · CUB200weighted Kendall rank correlation: 0.77 ± 0.10 -> 0.90 ± 0.08Helped
Use RetMMD-M rather than the compared transferability metricsRetrieval transferability evaluation · CARS196weighted Kendall rank correlation: 0.75 ± 0.13 -> 0.89 ± 0.08Helped
Use RetMMD-M rather than the compared transferability metricsRetrieval transferability evaluation · SOPweighted Kendall rank correlation: 0.71 ± 0.10 -> 0.80 ± 0.13Helped
Use RetMMD-M rather than the compared transferability metricsRetrieval transferability evaluation · NFCorpusweighted Kendall rank correlation: 0.70 ± 0.13 -> 0.94 ± 0.00Helped
Use RetMMD-M rather than GBCRetrieval transferability evaluation · FEVERweighted Kendall rank correlation: 0.67 ± 0.09 -> 0.52 ± 0.05Hurt
Use RetMMD-M rather than the compared transferability metricsRetrieval transferability evaluation · FiQA-2018weighted Kendall rank correlation: 0.33 ± 0.00 -> 0.80 ± 0.02Helped
Use RetMMD-M rather than the compared transferability metricsRetrieval transferability evaluation · COCOweighted Kendall rank correlation: −0.09 ± 0.14 -> 1 ± 0.00Helped
Use a polynomial kernel with lower-degree moment matchingRetMMD · CARS196weighted Kendall rank correlationHelped
Use a polynomial kernel with higher-degree moment matchingRetMMD · COCOweighted Kendall rank correlationHelped
Calculate dataset distance using mean embeddings of relevant documents per queryDataset transferability evaluation · Image datasets transferred from ImageNetPearson correlationHelped

Surprising findings

Limitations

Experimental setup

Datasets: CUB200 CARS196 Stanford Online Products NFCorpus FiQA-2018 FEVER MS-COCO ImageNet-1K Stanford Dogs SVHN CIFAR-10 CIFAR-100

Benchmarks: CUB200 CARS196 SOP NFCorpus FEVER FiQA-2018 COCO

Metrics: weighted Kendall rank correlation Pearson correlation Recall@1 MAP@1 F1 score

Baselines: LogME GBC

Builds on: LogME GBC MMD LEEP

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy