Deep Metric Learning to Rank
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.
Code (1)
Tasks
Image RetrievalLearning-To-RankMetric LearningQuantizationRetrievalSimilar Papers 제목 키워드 기반
An Analysis of the Impact of SEO on University Website Ranking
Today, ranking systems in universities have been considered by the academic community, and there is a tight competition between world universities to achieve higher ranks. In the meantime, the ranking of university websi…
MetaRank: Task-Aware Metric Selection for Model Transferability Estimation
Selecting an appropriate pre-trained source model is a critical, yet computationally expensive, task in transfer learning. Model Transferability Estimation (MTE) methods address this by providing efficient proxy metrics …
Transfer LearningLow-rank geometric mean metric learning
We propose a low-rank approach to learning a Mahalanobis metric from data. Inspired by the recent geometric mean metric learning (GMML) algorithm, we propose a low-rank variant of the algorithm. This allows to jointly le…
Metric LearningSymmetric low-rank representation for subspace clustering
We propose a symmetric low-rank representation (SLRR) method for subspace clustering, which assumes that a data set is approximately drawn from the union of multiple subspaces. The proposed technique can reveal the membe…
ClusteringA Unified Framework for Rank-based Evaluation Metrics for Link Prediction in Knowledge Graphs
The link prediction task on knowledge graphs without explicit negative triples in the training data motivates the usage of rank-based metrics. Here, we review existing rank-based metrics and propose desiderata for improv…
BenchmarkingGraph EmbeddingKnowledge Graph EmbeddingKnowledge Graphs+1