Probabilistic Structural Latent Representation for Unsupervised Embedding
Unsupervised embedding learning aims at extracting low-dimensional visually meaningful representations from large-scale unlabeled images, which can then be directly used for similarity-based search. This task faces two major challenges: 1) mining positive supervision from highly similar fine-grained classes and 2) generating to unseen testing categories. To tackle these issues, this paper proposes a probabilistic structural latent representation (PSLR), which incorporates an adaptable softmax embedding to approximate the positive concentrated and negative instance separated properties in the graph latent space. It improves the discriminability by enlarging the positive/negative difference without introducing any additional computational cost while maintaining high learning efficiency. To address the limited supervision using data augmentation, a smooth variational reconstruction loss is introduced by modeling the intra-instance variance, which improves the robustness. Extensive experiments demonstrate the superiority of PSLR over state-of-the-art unsupervised methods on both seen and unseen categories with cosine similarity. Code is available at https://github.com/mangye16/PSLR
Code (0)
등록된 구현이 없습니다.
Tasks
Data AugmentationImage ClassificationMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Probabilistic Structural Latent Representation for Unsupervised Embedding
Unsupervised embedding learning aims at extracting low-dimensional visually meaningful representations from large-scale unlabeled images, which can then be directly used for similarity-based search. This task faces tw…
Data AugmentationStructural Entropy Guided Probabilistic Coding
Probabilistic embeddings have several advantages over deterministic embeddings as they map each data point to a distribution, which better describes the uncertainty and complexity of data. Many works focus on adjusting t…
Natural Language UnderstandingregressionRepresentation LearningDeep Unsupervised Clustering with Clustered Generator Model
This paper addresses the problem of unsupervised clustering which remains one of the most fundamental challenges in machine learning and artificial intelligence. We propose the clustered generator model for clustering wh…
ClusteringmodelUnsupervised Deep Manifold Attributed Graph Embedding
Unsupervised attributed graph representation learning is challenging since both structural and feature information are required to be represented in the latent space. Existing methods concentrate on learning latent repre…
ClusteringGraph EmbeddingGraph Representation LearningLink Prediction+2Variational AutoEncoder For Regression: Application to Brain Aging Analysis
While unsupervised variational autoencoders (VAE) have become a powerful tool in neuroimage analysis, their application to supervised learning is under-explored. We aim to close this gap by proposing a unified probabilis…
DisentanglementregressionVariational Inference