Robust and Decomposable Average Precision for Image Retrieval - Archive ouverte HAL Access content directly
Conference Papers Year : 2021

Robust and Decomposable Average Precision for Image Retrieval


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.
Fichier principal
Vignette du fichier
main.pdf (5.67 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03359605 , version 1 (01-10-2021)
hal-03359605 , version 2 (30-10-2021)
hal-03359605 , version 3 (01-12-2021)



Elias Ramzi, Nicolas Thome, Clément Rambour, Nicolas Audebert, Xavier Bitot. Robust and Decomposable Average Precision for Image Retrieval. Thirty-fifth Conference on Neural Information Processing Systems (NeurIPS 2021), Dec 2021, Sydney, Australia. ⟨hal-03359605v3⟩
211 View
132 Download



Gmail Facebook X LinkedIn More