Deep Metric Learning Assisted by Intra-variance in A Semi-supervised View of Learning
Not on the map. Why?
Abstract (arXiv)
Deep metric learning aims to construct an embedding space where samples of the same class are close to each other, while samples of different classes are far away from each other. Most existing deep metric learning methods attempt to maximize the difference of inter-class features. And semantic related information is obtained by increasing the distance between samples of different classes in the embedding space. However, compressing all positive samples together while creating large margins between different classes unconsciously destroys the local structure between similar samples. Ignoring the intra-class variance contained in the local structure between similar samples, the embedding space obtained from training receives lower generalizability over unseen classes, which would lead to the network overfitting the training set and crashing on the test set. To address these considerations, this paper designs a self-supervised generative assisted ranking framework that provides a semi-supervised view of intra-class variance learning scheme for typical supervised deep metric learning. Specifically, this paper performs sample synthesis with different intensities and diversity for samples satisfying certain conditions to simulate the complex transformation of intra-class samples. And an intra-class ranking loss function is designed using the idea of self-supervised learning to constrain the network to maintain the intra-class distribution during the training process to capture the subtle intra-class variance. With this approach, a more realistic embedding space can be obtained in which global and local structures of samples are well preserved, thus enhancing the effectiveness of downstream tasks. Extensive experiments on four benchmarks have shown that this approach surpasses state-of-the-art methods
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 23 of its 51 references that are in the map. First posted on arXiv 21 Apr 2023.
Builds on
23 of 51 references.
References · 23
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2019Momentum Contrast for Unsupervised Visual Representation Learningcited by 7,482
- 2015Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shiftcited by 6,979
- 2014Going Deeper with Convolutionscited by 4,231
- 2015FaceNet: A Unified Embedding for Face Recognition and Clusteringcited by 2,833
- 2020FixMatch: Simplifying Semi-Supervised Learning with Consistency and Confidencecited by 2,080
- 2015Deep Metric Learning via Lifted Structured Feature Embeddingcited by 449
- 2020Circle Loss: A Unified Perspective of Pair Similarity Optimizationcited by 402
- 2019Multi-Similarity Loss with General Pair Weighting for Deep Metric Learningcited by 368
- 2017Sampling Matters in Deep Embedding Learningcited by 285
- 2017No Fuss Distance Metric Learning using Proxiescited by 225
- 2020Proxy Anchor Loss for Deep Metric Learningcited by 195
11 more
- 2019SoftTriple Loss: Deep Metric Learning Without Triplet Samplingcited by 163
- 2017Dataset Augmentation in Feature Spacecited by 124
- 2018Deep Metric Learning with Hierarchical Triplet Losscited by 112
- 2019Implicit Semantic Data Augmentation for Deep Networkscited by 106
- 2019Ranked List Loss for Deep Metric Learningcited by 77
- 2018Attention-based Ensemble for Deep Metric Learningcited by 56
- 2018Deep Metric Learning with BIER: Boosting Independent Embeddings Robustlycited by 40
- 2020Fewer is More: A Deep Graph Metric Learning Perspective Using Fewer Proxiescited by 36
- 2021Good-Enough Example Extrapolationcited by 5
- 2020Improving Deep Metric Learning with Virtual Classes and Examples Miningcited by 2
- 2021Joint Debiased Representation Learning and Imbalanced Data Clusteringcited by 2
Built on by
Not cited yet.