Unsupervised Embedding Learning via Invariant and Spreading Instance Feature

Citations Over TimeTop 1% of 2019 papers

Abstract

This paper studies the unsupervised embedding learning problem, which requires an effective similarity measurement between samples in low-dimensional embedding space. Motivated by the positive concentrated and negative separated properties observed from category-wise supervised learning, we propose to utilize the instance-wise supervision to approximate these properties, which aims at learning data augmentation invariant and instance spread-out features. To achieve this goal, we propose a novel instance based softmax embedding method, which directly optimizes the `real' instance features on top of the softmax function. It achieves significantly faster learning speed and higher accuracy than all existing methods. The proposed method performs well for both seen and unseen testing categories with cosine similarity. It also achieves competitive performance even without pre-trained network over samples from fine-grained categories.

Related Papers

• → Augmentation Invariant and Instance Spreading Feature for Softmax Embedding(2020)143 cited
• → Hebbian learning and the LMS algorithm(2016)9 cited
• → Development of a neural network algorithm for unsupervised competitive learning(2002)5 cited
• → Hyperparameter-Free Out-of-Distribution Detection Using Softmax of Scaled Cosine Similarity(2019)13 cited
• → P2SGrad: Refined Gradients for Optimizing Deep Face Models(2019)1 cited