Fine-Grained Representation Learning via Multi-Level Contrastive Learning without Class Priors
Not on the map. Why?
Abstract (arXiv)
Recent advances in unsupervised representation learning often rely on knowing the number of classes to improve feature extraction and clustering. However, this assumption raises an important question: is the number of classes always necessary, and do class labels fully capture the fine-grained features within the data? In this paper, we propose Contrastive Disentangling (CD), a framework designed to learn representations without relying on class priors. CD leverages a multi-level contrastive learning strategy, integrating instance-level and feature-level contrastive losses with a normalized entropy loss to capture semantically rich and fine-grained representations. Specifically, (1) the instance-level contrastive loss separates feature representations across samples; (2) the feature-level contrastive loss promotes independence among feature heads; and (3) the normalized entropy loss ensures feature diversity and prevents feature collapse. Extensive experiments on CIFAR-10, CIFAR-100, STL-10, and ImageNet-10 demonstrate that CD outperforms existing methods in scenarios where class information is unavailable or ambiguous. The code is available at https://github.com/Hoper-J/Contrastive-Disentangling.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 7 of its 31 references that are in the map. First posted on arXiv 7 Sep 2024.
Builds on
7 of 31 references.
References · 7
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 12,049
- 2015Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shiftcited by 7,005
- 2016SGDR: Stochastic Gradient Descent with Warm Restartscited by 5,045
- 2013Auto-Encoding Variational Bayescited by 4,053
- 2015Unsupervised Representation Learning with Deep Convolutional Generative Adversarial Networkscited by 2,054
- 2015Unsupervised Deep Embedding for Clustering Analysiscited by 767
Built on by
Citing papers per year: 2026: 1.
1 paper.