SOTAVerified

Deep Metric Learning to Rank

2019-06-01CVPR 2019Code Available0· sign in to hype

Fatih Cakir, Kun He, Xide Xia, Brian Kulis, Stan Sclaroff

Code Available — Be the first to reproduce this paper.

Reproduce

Code

Abstract

We propose a novel deep metric learning method by revisiting the learning to rank approach. Our method, named FastAP, optimizes the rank-based Average Precision measure, using an approximation derived from distance quantization. FastAP has a low complexity compared to existing methods, and is tailored for stochastic gradient descent. To fully exploit the benefits of the ranking formulation, we also propose a new minibatch sampling scheme, as well as a simple heuristic to enable large-batch training. On three few-shot image retrieval datasets, FastAP consistently outperforms competing methods, which often involve complex optimization heuristics or costly model ensembles.

Tasks

Reproductions