mlsanityData to 7 Oct 2026

A Closer Look at Novel Class Discovery from the Labeled Set

arXiv 2209.09120 ↗First posted 19 Sep 2022cs.CV cs.AIcited by 12

Not on the map. Why?

Abstract (arXiv)

Novel class discovery (NCD) aims to infer novel categories in an unlabeled dataset leveraging prior knowledge of a labeled set comprising disjoint but related classes. Existing research focuses primarily on utilizing the labeled set at the methodological level, with less emphasis on the analysis of the labeled set itself. Thus, in this paper, we rethink novel class discovery from the labeled set and focus on two core questions: (i) Given a specific unlabeled set, what kind of labeled set can best support novel class discovery? (ii) A fundamental premise of NCD is that the labeled set must be related to the unlabeled set, but how can we measure this relation? For (i), we propose and substantiate the hypothesis that NCD could benefit more from a labeled set with a large degree of semantic similarity to the unlabeled set. Specifically, we establish an extensive and large-scale benchmark with varying degrees of semantic similarity between labeled/unlabeled datasets on ImageNet by leveraging its hierarchical class structure. As a sharp contrast, the existing NCD benchmarks are developed based on labeled sets with different number of categories and images, and completely ignore the semantic relation. For (ii), we introduce a mathematical definition for quantifying the semantic similarity between labeled and unlabeled sets. In addition, we use this metric to confirm the validity of our proposed benchmark and demonstrate that it highly correlates with NCD performance. Furthermore, without quantitative analysis, previous works commonly believe that label information is always beneficial. However, counterintuitively, our experimental results show that using labels may lead to sub-optimal outcomes in low-similarity settings.

Key facts. Cited by 12 papers in the map (data through 7 Oct 2026). Builds on 17 of its 23 references that are in the map. First posted on arXiv 19 Sep 2022.

Builds on

17 of 23 references.

References · 17

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2020Unsupervised Learning of Visual Features by Contrasting Cluster Assignmentscited by 2,845
  3. 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,277
  4. 2016Matching Networks for One Shot Learningcited by 2,246
  5. 2015Unsupervised Deep Embedding for Clustering Analysiscited by 763
  6. 2019Learning to Discover Novel Visual Categories via Deep Transfer Clusteringcited by 223
  7. 2021A Unified Objective for Novel Class Discoverycited by 161
  8. 2020BREEDS: Benchmarks for Subpopulation Shiftcited by 155
  9. 2020Automatically Discovering and Learning New Visual Categories with Ranking Statisticscited by 141
  10. 2017Learning to cluster in order to transfer across domains and taskscited by 128
  11. 2021Neighborhood Contrastive Learning for Novel Class Discoverycited by 119
  12. 2021AutoNovel: Automatically Discovering and Learning Novel Visual Categoriescited by 116
5 more
  1. 2021Novel Visual Category Discovery with Dual Ranking Statistics and Mutual Knowledge Distillationcited by 104
  2. 2019Multi-class Classification without Multi-class Labelscited by 100
  3. 2020OpenMix: Reviving Known Knowledge for Discovering Novel Visual Categories in An Open Worldcited by 93
  4. 2022Domain Adaptation under Open Set Label Shiftcited by 32
  5. 2021Meta Discovery: Learning to Discover Novel Classes given Very Limited Datacited by 30

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2022: 1; 2023: 7; 2024: 0; 2025: 3; 2026: 1.

12 papers.