Learning Deep Optimal Embeddings With Sinkhorn Divergences

Abstract

Deep Metric Learning algorithms aim to learn an efficient embedding space to preserve the similarity relationships among the input data. Whilst these algorithms have achieved significant performance gains across a wide plethora of tasks, they have also failed to consider and increase comprehensive similarity constraints; thus learning a sub-optimal metric in the embedding space. Moreover, up until now; there have been few studies with respect to their performance in the presence of noisy labels. Here, we address the concern of learning a discriminative deep embedding space by designing a novel, yet effective Deep Class-wise Discrepancy Loss (DCDL) function that segregates the underlying similarity distributions (thus introducing class-wise discrepancy) of the embedding points between each and every class. Our empirical results across three standard image classification datasets and two fine-grained image recognition datasets in the presence and absence of noise clearly demonstrate the

Stats

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

Related papers

• Adaptive Hierarchical Similarity Metric Learning With Noisy Labels (2021)10.74
• Ensemble Of Loss Functions To Improve Generalizability Of Deep Metric Learning Methods (2021)7.16
• Loop: Looking For Optimal Hard Negative Embeddings For Deep Metric Learning (2021)8.82
• Improving Deep Metric Learning By Divide And Conquer (2021)8.09
• Constellation Loss: Improving The Efficiency Of Deep Metric Learning Loss Functions For Optimal Embedding (2019)0.00
• Deep Metric Learning Assisted By Intra-variance In A Semi-supervised View Of Learning (2023)5.24
• Deep Metric Learning For Computer Vision: A Brief Overview (2023)6.77
• Directional Statistics-based Deep Metric Learning For Image Classification And Retrieval (2018)13.05