Catching Image Retrieval Generalization

06/23/2023
by   Maksim Zhdanov, et al.
0

The concepts of overfitting and generalization are vital for evaluating machine learning models. In this work, we show that the popular Recall@K metric depends on the number of classes in the dataset, which limits its ability to estimate generalization. To fix this issue, we propose a new metric, which measures retrieval performance, and, unlike Recall@K, estimates generalization. We apply the proposed metric to popular image retrieval methods and provide new insights about deep metric learning generalization.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/22/2019

Energy Confused Adversarial Metric Learning for Zero-Shot Image Retrieval and Clustering

Deep metric learning has been widely applied in many computer vision tas...
research
07/27/2019

Hybrid-Attention based Decoupled Metric Learning for Zero-Shot Image Retrieval

In zero-shot image retrieval (ZSIR) task, embedding learning becomes mor...
research
11/14/2022

Few-shot Metric Learning: Online Adaptation of Embedding for Retrieval

Metric learning aims to build a distance metric typically by learning an...
research
03/08/2018

Generalization in Metric Learning: Should the Embedding Layer be the Embedding Layer?

Many recent works advancing deep learning tend to focus on large scale s...
research
06/08/2020

Calibrated neighborhood aware confidence measure for deep metric learning

Deep metric learning has gained promising improvement in recent years fo...
research
09/16/2020

Domain-invariant Similarity Activation Map Metric Learning for Retrieval-based Long-term Visual Localization

Visual localization is a crucial component in the application of mobile ...
research
02/02/2023

Bayesian Metric Learning for Uncertainty Quantification in Image Retrieval

We propose the first Bayesian encoder for metric learning. Rather than r...

Please sign up or login with your details

Forgot password? Click here to reset