Robust And Decomposable Average Precision For Image Retrieval

Abstract

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 resu

Stats

• citations0
• S2 citations—
• github stars0
• HF likes0
• heat score0.00
• arxiv keyramzi2021robust

Related papers

• Optimization Of Rank Losses For Image Retrieval (2023)9.43
• Smooth-ap: Smoothing The Path Towards Large-scale Image Retrieval (2020)15.06
• Learning With Average Precision: Training Image Retrieval With A Listwise Loss (2019)18.86
• Hierarchical Average Precision Training For Pertinent Image Retrieval (2022)9.10
• Rethinking The Optimization Of Average Precision: Only Penalizing Negative Instances Before Positive Ones Is Enough (2021)11.00
• REMAP: Multi-layer Entropy-guided Pooling Of Dense CNN Features For Image Retrieval (2019)12.33
• Not All Pairs Are Equal: Hierarchical Learning For Average-precision-oriented Video Retrieval (2024)7.50
• Mean Local Group Average Precision (mlgap): A New Performance Metric For Hashing-based Retrieval (2018)0.00