SOTAVerified

Recall@k Surrogate Loss with Large Batches and Similarity Mixup

2021-08-25CVPR 2022Code Available1· sign in to hype

Yash Patel, Giorgos Tolias, Jiri Matas

Code Available — Be the first to reproduce this paper.

Reproduce

Code

Abstract

This work focuses on learning deep visual representation models for retrieval by exploring the interplay between a new loss function, the batch size, and a new regularization approach. Direct optimization, by gradient descent, of an evaluation metric, is not possible when it is non-differentiable, which is the case for recall in retrieval. A differentiable surrogate loss for the recall is proposed in this work. Using an implementation that sidesteps the hardware constraints of the GPU memory, the method trains with a very large batch size, which is essential for metrics computed on the entire retrieval database. It is assisted by an efficient mixup regularization approach that operates on pairwise scalar similarities and virtually increases the batch size further. The suggested method achieves state-of-the-art performance in several image retrieval benchmarks when used for deep metric learning. For instance-level recognition, the method outperforms similar approaches that train using an approximation of average precision.

Tasks

Benchmark Results

DatasetModelMetricClaimedVerifiedStatus
iNaturalistRecall@k Surrogate loss (ViT-B/16)R@183Unverified
iNaturalistRecall@k Surrogate loss (ResNet-50)R@171.8Unverified

Reproductions