mlsanityData to 14 Oct 2026

Generalized Category Discovery with Large Language Models in the Loop

arXiv 2312.10897 ↗First posted 18 Dec 2023cs.CL cs.AI cs.LGcited by 15

Not on the map. Why?

Abstract (arXiv)

Generalized Category Discovery (GCD) is a crucial task that aims to recognize both known and novel categories from a set of unlabeled data by utilizing a few labeled data with only known categories. Due to the lack of supervision and category information, current methods usually perform poorly on novel categories and struggle to reveal semantic meanings of the discovered clusters, which limits their applications in the real world. To mitigate the above issues, we propose Loop, an end-to-end active-learning framework that introduces Large Language Models (LLMs) into the training loop, which can boost model performance and generate category names without relying on any human efforts. Specifically, we first propose Local Inconsistent Sampling (LIS) to select samples that have a higher probability of falling to wrong clusters, based on neighborhood prediction consistency and entropy of cluster assignment probabilities. Then we propose a Scalable Query strategy to allow LLMs to choose true neighbors of the selected samples from multiple candidate samples. Based on the feedback from LLMs, we perform Refined Neighborhood Contrastive Learning (RNCL) to pull samples and their neighbors closer to learn clustering-friendly representations. Finally, we select representative samples from clusters corresponding to novel categories to allow LLMs to generate category names for them. Extensive experiments on three benchmark datasets show that Loop outperforms SOTA models by a large margin and generates accurate category names for the discovered clusters. Code and data are available at https://github.com/Lackel/LOOP.

Key facts. Cited by 15 papers in the map (data through 14 Oct 2026). Builds on 22 of its 42 references that are in the map. First posted on arXiv 18 Dec 2023.

Builds on

22 of 42 references.

References · 22

  1. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
  2. 2019HuggingFace's Transformers: State-of-the-art Natural Language Processingcited by 2,218
  3. 2018Deep Clustering for Unsupervised Learning of Visual Featurescited by 1,028
  4. 2015Unsupervised Deep Embedding for Clustering Analysiscited by 767
  5. 2020Efficient Intent Detection with Dual Sentence Encoderscited by 433
  6. 2019An Evaluation Dataset for Intent Classification and Out-of-Scope Predictioncited by 386
  7. 2023ChatIE: Zero-Shot Information Extraction via Chatting with ChatGPTcited by 250
  8. 2016Towards K-means-friendly Spaces: Simultaneous Deep Learning and Clusteringcited by 237
  9. 2019Learning to Discover Novel Visual Categories via Deep Transfer Clusteringcited by 225
  10. 2020Mutual Mean-Teaching: Pseudo Label Refinery for Unsupervised Domain Adaptation on Person Re-identificationcited by 215
  11. 2021Open-World Semi-Supervised Learningcited by 165
  12. 2021Active Learning by Acquiring Contrastive Examplescited by 156
10 more
  1. 2021Neighborhood Contrastive Learning for Novel Class Discoverycited by 121
  2. 2021OVANet: One-vs-All Network for Universal Domain Adaptationcited by 92
  3. 2023ClusterLLM: Large Language Models as a Guide for Text Clusteringcited by 70
  4. 2020Discovering New Intents with Deep Aligned Clusteringcited by 68
  5. 2019Discovering New Intents via Constrained Deep Adaptive Clustering with Cluster Refinementcited by 56
  6. 2022Generalized Category Discovery with Decoupled Prototypical Networkcited by 35
  7. 2023Improving Contrastive Learning of Sentence Embeddings from AI Feedbackcited by 29
  8. 2022Fine-grained Category Discovery under Coarse-grained supervision with Hierarchical Weighted Self-contrastive Learningcited by 13
  9. 2023A Diffusion Weighted Graph Framework for New Intent Discoverycited by 7
  10. 2023DNA: Denoised Neighborhood Aggregation for Fine-grained Category Discoverycited by 4

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2024: 6; 2025: 7; 2026: 2.

15 papers.

Sort:

By area: