Fetching the paper…
Reading the bibliography…
In image retrieval, standard evaluation metrics rely on score ranking, \eg average precision (AP), recall at k (R@k), normalized discounted cumulative gain (NDCG).
G. A. Miller, “Wordnet: A lexical database for english,” Commun. ACM , 1995
1995
Earlier work this paper cites.
J. Kekäläinen and K. Järvelin, “Using graded relevance assessments in ir evaluation,” Journal of the American Society for Information Science and Technology , 2002
2002
Earlier work this paper cites.
K. Järvelin and J. Kekäläinen, “Cumulated gain-based evaluation of ir techniques,” ACM TOIS , 2002
2002
Earlier work this paper cites.
E. Xing, M. Jordan, S. J. Russell, and A. Ng, “Distance metric learning with application to clustering with side-information,” in NeurIPS , 2003
2003
Earlier work this paper cites.
C. Burges, T. Shaked, E. Renshaw, A. Lazier, M. Deeds, N. Hamilton, and G. Hullender, “Learning to rank using gradient descent,” in ICML , 2005
2005
Earlier work this paper cites.
R. Hadsell, S. Chopra, and Y. LeCun, “Dimensionality reduction by learning an invariant mapping,” in CVPR , 2006
2006
Earlier work this paper cites.
C. Burges, R. Ragno, and Q. Le, “Learning to rank with nonsmooth cost functions,” in NeurIPS , 2006
2006
Earlier work this paper cites.
Y. Yue, T. Finley, F. Radlinski, and T. Joachims, “A support vector method for optimizing average precision,” in SIGIR , 2007
2007
Earlier work this paper cites.
M. Taylor, J. Guiver, S. Robertson, and T. Minka, “Softrank: Optimizing non-smooth rank metrics,” in WSDM , 2008
2008
Earlier work this paper cites.
L. van der Maaten and G. Hinton, “Visualizing high-dimensional data using t-sne,” Journal of Machine Learning Research , 2008
2008
Earlier work this paper cites.
T. Qin, T.-Y. Liu, and H. Li, “A general approximation framework for direct optimization of information retrieval measures,” Information Retrieval , 2009
2009
Earlier work this paper cites.
J. Deng, W. Dong, R. Socher, L.-J. Li, K. Li, and L. Fei-Fei, “Imagenet: A large-scale hierarchical image database,” in CVPR , 2009
2009
Earlier work this paper cites.
B. Mcfee and G. Lanckriet, “Metric learning to rank,” in ICML , 2010
2010
Earlier work this paper cites.
B. Hjørland, “The foundation of the concept of relevance,” Journal of the American Society for Information Science and Technology , 2010
2010
Earlier work this paper cites.
W. B. Croft, D. Metzler, and T. Strohman, Search engines: Information retrieval in practice . Addison-Wesley Reading, 2010
2010
Earlier work this paper cites.
S. E. Robertson, E. Kanoulas, and E. Yilmaz, “Extending average precision to graded relevance judgments,” in SIGIR , 2010
2010
Earlier work this paper cites.
G. Dupret and B. Piwowarski, “A user behavior model for average precision and its generalization to graded judgments,” in SIGIR , 2010
2010
Earlier work this paper cites.
Y. Avrithis, G. Tolias, and Y. Kalantidis, “Feature Map Hashing: Sub-linear Indexing of Appearance and Global Geometry,” in Proc. ACM MM , 2010
2010
Earlier work this paper cites.
C. Wah, S. Branson, P. Welinder, P. Perona, and S. Belongie, “The Caltech-UCSD Birds-200-2011 Dataset,” California Institute of Technology, Tech. Rep., 2011
2011
Earlier work this paper cites.
O. Chapelle and Y. Chang, “Yahoo! learning to rank challenge overview,” in Proceedings of the learning to rank challenge , 2011
2011
Earlier work this paper cites.
D. Chen, G. Baatz, K. Koser, S. Tsai, R. Vedantham, T. Pylvanainen, K. Roimela, X. Chen, J. Bach, M. Pollefeys, B. Girod, and R. Grzeszczuk, “City-Scale Landmark Identification on Mobile Devices,” in CVPR , 2011
2011
Earlier work this paper cites.
G. Dupret and B. Piwowarski, “Model based comparison of discounted cumulative gain and average precision,” Journal of Discrete Algorithms , 2013
2013
Earlier work this paper cites.
J. Krause, M. Stark, J. Deng, and L. Fei-Fei, “3d object representations for fine-grained categorization,” in 3dRR Workshop , 2013
2013
Earlier work this paper cites.
T. Qin and T. Liu, “Introducing LETOR 4.0 datasets,” CoRR , 2013
2013
Earlier work this paper cites.
A. Torii, R. Arandjelović, J. Sivic, M. Okutomi, and T. Pajdla, “24/7 place recognition by view synthesis,” in Proc. CVPR , 2015
2015
Earlier work this paper cites.
F. Radenovic, G. Tolias, and O. Chum, “CNN image retrieval learns from bow: Unsupervised fine-tuning with hard examples,” in ECCV , 2016
2016
Earlier work this paper cites.
K. Sohn, “Improved deep metric learning with multi-class n-pair loss objective,” in NeurIPS , 2016
2016
Earlier work this paper cites.
E. Ustinova and V. Lempitsky, “Learning deep embeddings with histogram loss,” in NeurIPS , 2016
2016
Cited alongside, same era.
Z. Liu, P. Luo, S. Qiu, X. Wang, and X. Tang, “Deepfashion: Powering robust clothes recognition and retrieval with rich annotations,” in CVPR , 2016
2016
Cited alongside, same era.
H. O. Song, Y. Xiang, S. Jegelka, and S. Savarese, “Deep metric learning via lifted structured feature embedding,” in CVPR , 2016
2016
Cited alongside, same era.
A. Gordo, J. Almazán, J. Revaud, and D. Larlus, “End-to-end learning of deep visual representations for image retrieval,” Int. J. Comput. Vis. , 2017
2017
Cited alongside, same era.
C.-Y. Wu, R. Manmatha, A. J. Smola, and P. Krahenbuhl, “Sampling matters in deep embedding learning,” in ICCV , 2017
2017
Cited alongside, same era.
D. M. Chan, R. Rao, F. Huang, and J. F. Canny, “Gpu accelerated t-distributed stochastic neighbor embedding,” Journal of Parallel and Distributed Computing , 2019
2019
Later among the works it cites.
H. Xuan, A. Stylianou, X. Liu, and R. Pless, “Hard negative examples are hard, but useful,” in ECCV , 2020
2020
Later among the works it cites.
Y. Zhu, M. Yang, C. Deng, and W. Liu, “Fewer is more: A deep graph metric learning perspective using fewer proxies,” in NeurIPS , 2020
2020
Later among the works it cites.
E. W. Teh, T. DeVries, and G. W. Taylor, “Proxynca++: Revisiting and revitalizing proxy neighborhood component analysis,” in ECCV , 2020
2020
Later among the works it cites.
M. Vlastelica, A. Paulus, V. Musil, G. Martius, and M. Rolínek, “Differentiation of blackbox combinatorial solvers,” in ICLR , 2020
2020
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
M. T. Law, N. Thome, and M. Cord, “Learning a distance metric from relative comparisons between quadruplets of images,” Int. J. Comput. Vis. , 2017
2017
Cited alongside, same era.
Y. Movshovitz-Attias, A. Toshev, T. K. Leung, S. Ioffe, and S. Singh, “No fuss distance metric learning using proxies,” in ICCV , 2017
2017
Cited alongside, same era.
B. Harwood, V. Kumar B G, G. Carneiro, I. Reid, and T. Drummond, “Smart mining for deep metric learning,” in ICCV , 2017
2017
Cited alongside, same era.
A. Zhai and H. Wu, “Classification is a strong baseline for deep metric learning,” BMVC , 2018
2018
Cited alongside, same era.
H. Wang, Y. Wang, Z. Zhou, X. Ji, D. Gong, J. Zhou, Z. Li, and W. Liu, “Cosface: Large margin cosine loss for deep face recognition,” in CVPR , 2018
2018
Cited alongside, same era.
P. Mohapatra, M. Rolínek, C. Jawahar, V. Kolmogorov, and M. P. Kumar, “Efficient optimization for rank-based loss functions,” in CVPR , 2018
2018
Cited alongside, same era.
K. He, F. Cakir, S. A. Bargal, and S. Sclaroff, “Hashing as tie-aware learning to rank,” in CVPR , 2018
2018
Cited alongside, same era.
A. Brown, W. Xie, V. Kalogeiton, and A. Zisserman, “Smooth-ap: Smoothing the path towards large-scale image retrieval,” in ECCV , 2020
2020
Later among the works it cites.
X. Wang, H. Zhang, W. Huang, and M. R. Scott, “Cross-batch memory for embedding learning,” in CVPR , 2020
2020
Later among the works it cites.
M. Rolínek, V. Musil, A. Paulus, M. Vlastelica, C. Michaelis, and G. Martius, “Optimizing rank-based metrics with blackbox differentiation,” in CVPR , 2020
2020
Later among the works it cites.
T. Weyand, A. Araujo, B. Cao, and J. Sim, “Google landmarks dataset v2-a large-scale benchmark for instance-level recognition and retrieval,” in CVPR , 2020
2020
Later among the works it cites.
A. Dhall, A. Makarova, O. Ganea, D. Pavllo, M. Greeff, and A. Krause, “Hierarchical image classification using entailment cone embeddings,” in CVPR Workshops , 2020
2020
Later among the works it cites.
L. Bertinetto, R. Mueller, K. Tertikas, S. Samangooei, and N. A. Lord, “Making better mistakes: Leveraging class hierarchies with deep networks,” in CVPR , 2020
2020
Later among the works it cites.
D. Zhang, Y. Li, and Z. Zhang, “Deep metric learning with spherical embedding,” in NeurIPS , 2020
2020
Later among the works it cites.
M. Boudiaf, J. Rony, I. M. Ziko, E. Granger, M. Pedersoli, P. Piantanida, and I. B. Ayed, “A unifying mutual information view of metric learning: cross-entropy vs. pairwise losses,” in ECCV , 2020
2020
Later among the works it cites.
A. Dosovitskiy, L. Beyer, A. Kolesnikov, D. Weissenborn, X. Zhai, T. Unterthiner, M. Dehghani, M. Minderer, G. Heigold, S. Gelly et al. , “An image is worth 16x16 words: Transformers for image recognition at scale,” arXiv preprint , 2020
2020
Later among the works it cites.
H. Touvron, M. Cord, M. Douze, F. Massa, A. Sablayrolles, and H. Jégou, “Training data-efficient image transformers & distillation through attention,” arXiv preprint , 2020
2020
Later among the works it cites.
R. Fagin, R. Kumar, and D. Sivakumar, “Comparing top k lists,” SIAM Journal on discrete mathematics , 2003
2020
Later among the works it cites.
Y. Sun, Y. Zhu, Y. Zhang, P. Zheng, X. Qiu, C. Zhang, and Y. Wei, “Dynamic metric learning: Towards a scalable metric space to accommodate multiple semantic scales,” in CVPR , 2021
2021
Later among the works it cites.
E. Ramzi, N. Thome, C. Rambour, N. Audebert, and X. Bitot, “Robust and decomposable average precision for image retrieval,” NeurIPS , 2021
2021
Later among the works it cites.
D. Chang, K. Pang, Y. Zheng, Z. Ma, Y.-Z. Song, and J. Guo, “Your” flamingo” is my” bird”: Fine-grained, or not,” in CVPR , 2021
2021
Later among the works it cites.
E. W. Wilt and A. V. Harrison, “Creating a semantic hierarchy of SUN database object labels using WordNet,” in Artificial Intelligence and Machine Learning for Multi-Domain Operations Applications III , vol. 11746, 2021
2021
Later among the works it cites.
A. Radford, J. W. Kim, C. Hallacy, A. Ramesh, G. Goh, S. Agarwal, G. Sastry, A. Askell, P. Mishkin, J. Clark, G. Krueger, and I. Sutskever, “Learning transferable visual models from natural language supervision,” in ICML , 2021
2021
Later among the works it cites.
A. El-Nouby, N. Neverova, I. Laptev, and H. Jégou, “Training vision transformers for image retrieval,” arXiv preprint , 2021
2021
Later among the works it cites.
Y. Patel, G. Tolias, and J. Matas, “Recall@ k surrogate loss with large batches and similarity mixup,” in CVPR , 2022
2022
Later among the works it cites.
W. Zheng, Y. Huang, B. Zhang, J. Zhou, and J. Lu, “Dynamic metric learning with cross-level concept distillation,” in ECCV , 2022
2022
Later among the works it cites.
E. Ramzi, N. Audebert, N. Thome, C. Rambour, and X. Bitot, “Hierarchical average precision training for pertinent image retrieval,” in ECCV , 2022
2022
Later among the works it cites.
Z. Li, W. Min, J. Song, Y. Zhu, L. Kang, X. Wei, X. Wei, and S. Jiang, “Rethinking the optimization of average precision: Only penalizing negative instances before positive ones is enough,” in AAAI , 2022
2022
Later among the works it cites.
C. Liao, T. Tsiligkaridis, and B. Kulis, “Supervised metric learning for retrieval via contextual similarity optimization,” arXiv preprint , 2022
2022
Later among the works it cites.