Deep Metric Learning With Hierarchical Triplet Loss

Abstract

We present a novel hierarchical triplet loss (HTL) capable of automatically collecting informative training samples (triplets) via a defined hierarchical tree that encodes global context information. This allows us to cope with the main limitation of random sampling in training a conventional triplet loss, which is a central issue for deep metric learning. Our main contributions are two-fold. (i) we construct a hierarchical class-level tree where neighboring classes are merged recursively. The hierarchical structure naturally captures the intrinsic data distribution over the whole database. (ii) we formulate the problem of triplet collection by introducing a new violate margin, which is computed dynamically based on the designed hierarchical tree. This allows it to automatically select meaningful hard samples with the guide of global context. It encourages the model to learn more discriminative features from visual similar classes, leading to faster convergence and better performance.

Stats

• citations266
• S2 citations—
• github stars0
• HF likes0
• heat score18.20
• arxiv keyge2018deep

Related papers

• Hybrid Losses For Hierarchical Embedding Learning (2025)0.00
• Deep Metric Learning Beyond Binary Supervision (2019)14.39
• Tcdesc: Learning Topology Consistent Descriptors (2020)0.00
• Enhancing Remote Sensing Image Retrieval With Triplet Deep Metric Learning Network (2019)14.58
• Triplet-center Loss For Multi-view 3D Object Retrieval (2018)18.70
• Shadow Loss: Memory-linear Deep Metric Learning For Efficient Training (2023)0.00
• Fast Training Of Triplet-based Deep Binary Embedding Networks (2016)14.62
• Hynet: Learning Local Descriptor With Hybrid Similarity Measure And Triplet Loss (2020)0.00