Adaptive Hierarchical Similarity Metric Learning With Noisy Labels

Abstract

Deep Metric Learning (DML) plays a critical role in various machine learning tasks. However, most existing deep metric learning methods with binary similarity are sensitive to noisy labels, which are widely present in real-world data. Since these noisy labels often cause severe performance degradation, it is crucial to enhance the robustness and generalization ability of DML. In this paper, we propose an Adaptive Hierarchical Similarity Metric Learning method. It considers two noise-insensitive information, \textit\{i.e.\}, class-wise divergence and sample-wise consistency. Specifically, class-wise divergence can effectively excavate richer similarity information beyond binary in modeling by taking advantage of Hyperbolic metric learning, while sample-wise consistency can further improve the generalization ability of the model using contrastive augmentation. More importantly, we design an adaptive strategy to integrate this information in a unified view. It is noteworthy that the new m

Stats

• citations26
• S2 citations—
• github stars0
• HF likes0
• heat score10.74
• arxiv keyyan2021adaptive

Related papers

• Guided Deep Metric Learning (2022)6.77
• A Framework To Enhance Generalization Of Deep Metric Learning Methods Using General Discriminative Feature Learning And Class Adversarial Neural Networks (2021)7.50
• S2SD: Simultaneous Similarity-based Self-distillation For Deep Metric Learning (2020)3.31
• Procsim: Proxy-based Confidence For Robust Similarity Learning (2023)0.00
• Learning Deep Optimal Embeddings With Sinkhorn Divergences (2022)0.00
• Multi-head Deep Metric Learning Using Global And Local Representations (2021)6.77
• Ensemble Of Loss Functions To Improve Generalizability Of Deep Metric Learning Methods (2021)7.16
• Metric Learning By Similarity Network For Deep Semi-supervised Learning (2020)3.58