Supervised Knowledge May Hurt Novel Class Discovery Performance
Not on the map. Why?
Abstract (arXiv)
Novel class discovery (NCD) aims to infer novel categories in an unlabeled dataset by leveraging prior knowledge of a labeled set comprising disjoint but related classes. Given that most existing literature focuses primarily on utilizing supervised knowledge from a labeled set at the methodology level, this paper considers the question: Is supervised knowledge always helpful at different levels of semantic relevance? To proceed, we first establish a novel metric, so-called transfer flow, to measure the semantic similarity between labeled/unlabeled datasets. To show the validity of the proposed metric, we build up a large-scale benchmark with various degrees of semantic similarities between labeled/unlabeled datasets on ImageNet by leveraging its hierarchical class structure. The results based on the proposed benchmark show that the proposed transfer flow is in line with the hierarchical class structure; and that NCD performance is consistent with the semantic similarities (measured by the proposed metric). Next, by using the proposed transfer flow, we conduct various empirical experiments with different levels of semantic similarity, yielding that supervised knowledge may hurt NCD performance. Specifically, using supervised information from a low-similarity labeled set may lead to a suboptimal result as compared to using pure self-supervised knowledge. These results reveal the inadequacy of the existing NCD literature which usually assumes that supervised knowledge is beneficial. Finally, we develop a pseudo-version of the transfer flow as a practical reference to decide if supervised knowledge should be used in NCD. Its effectiveness is supported by our empirical studies, which show that the pseudo transfer flow (with or without supervised knowledge) is consistent with the corresponding accuracy based on various datasets. Code is released at https://github.com/J-L-O/SK-Hurt-NCD
Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). Builds on 15 of its 23 references that are in the map. First posted on arXiv 6 Jun 2023.
Builds on
15 of 23 references.
References · 15
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2020Unsupervised Learning of Visual Features by Contrasting Cluster Assignmentscited by 2,857
- 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,316
- 2015Unsupervised Deep Embedding for Clustering Analysiscited by 767
- 2019Learning to Discover Novel Visual Categories via Deep Transfer Clusteringcited by 225
- 2021A Unified Objective for Novel Class Discoverycited by 162
- 2020BREEDS: Benchmarks for Subpopulation Shiftcited by 155
- 2020Automatically Discovering and Learning New Visual Categories with Ranking Statisticscited by 143
- 2017Learning to cluster in order to transfer across domains and taskscited by 128
- 2021Neighborhood Contrastive Learning for Novel Class Discoverycited by 121
- 2021AutoNovel: Automatically Discovering and Learning Novel Visual Categoriescited by 116
- 2021Novel Visual Category Discovery with Dual Ranking Statistics and Mutual Knowledge Distillationcited by 104
Built on by
Citing papers per year: 2023: 2; 2024: 0; 2025: 1; 2026: 1.
4 papers.
- 2023Learn to Categorize or Categorize to Learn? Self-Coding for Generalized Category Discoverycited by 39
- 2025Category Discovery: An Open-World Perspectivecited by 5
- 2023ImbaGCD: Imbalanced Generalized Category Discoverycited by 3
- 2026The Devil Is in Gradient Entanglement: Energy-Aware Gradient Coordinator for Robust Generalized Category Discoverycited by 0
- 2026The Devil Is in Gradient Entanglement: Energy-Aware Gradient Coordinator for Robust Generalized Category Discovery25 Mar 2026
- 2025Category Discovery: An Open-World Perspective26 Sep 2025
- 2023ImbaGCD: Imbalanced Generalized Category Discovery4 Dec 2023
- 2023Learn to Categorize or Categorize to Learn? Self-Coding for Generalized Category Discovery30 Oct 2023