Robust And Decomposable Average Precision For Image Retrieval | Awesome Learning to Hash Add your paper to Learning2Hash

Robust And Decomposable Average Precision For Image Retrieval

Elias Ramzi, Nicolas Thome, ClΓ©ment Rambour, Nicolas Audebert, Xavier Bitot . Thirty-fifth Conference on Neural Information Processing Systems (NeurIPS 2021) Dec 2021 Sydney Australia 2021 – 8 citations

[Paper]   Search on Google Scholar   Search on Semantic Scholar
Datasets Evaluation Hybrid ANN Methods Image Retrieval Re-Ranking

In image retrieval, standard evaluation metrics rely on score ranking, e.g. average precision (AP). In this paper, we introduce a method for robust and decomposable average precision (ROADMAP) addressing two major challenges for end-to-end training of deep neural networks with AP: non-differentiability and non-decomposability. Firstly, we propose a new differentiable approximation of the rank function, which provides an upper bound of the AP loss and ensures robust training. Secondly, we design a simple yet effective loss function to reduce the decomposability gap between the AP in the whole training set and its averaged batch approximation, for which we provide theoretical guarantees. Extensive experiments conducted on three image retrieval datasets show that ROADMAP outperforms several recent AP approximation methods and highlight the importance of our two contributions. Finally, using ROADMAP for training deep models yields very good performances, outperforming state-of-the-art results on the three datasets.

Similar Work