English

Hierarchical Proxy-based Loss for Deep Metric Learning

Computer Vision and Pattern Recognition 2021-10-19 v3

Abstract

Proxy-based metric learning losses are superior to pair-based losses due to their fast convergence and low training complexity. However, existing proxy-based losses focus on learning class-discriminative features while overlooking the commonalities shared across classes which are potentially useful in describing and matching samples. Moreover, they ignore the implicit hierarchy of categories in real-world datasets, where similar subordinate classes can be grouped together. In this paper, we present a framework that leverages this implicit hierarchy by imposing a hierarchical structure on the proxies and can be used with any existing proxy-based loss. This allows our model to capture both class-discriminative features and class-shared characteristics without breaking the implicit data hierarchy. We evaluate our method on five established image retrieval datasets such as In-Shop and SOP. Results demonstrate that our hierarchical proxy-based loss framework improves the performance of existing proxy-based losses, especially on large datasets which exhibit strong hierarchical structure.

Keywords

Cite

@article{arxiv.2103.13538,
  title  = {Hierarchical Proxy-based Loss for Deep Metric Learning},
  author = {Zhibo Yang and Muhammet Bastan and Xinliang Zhu and Doug Gray and Dimitris Samaras},
  journal= {arXiv preprint arXiv:2103.13538},
  year   = {2021}
}

Comments

Accepted to WACV2022

R2 v1 2026-06-24T00:32:13.195Z