Papers › Learning Semi-supervised Gaussian Mixture Models for Generalized Category Discovery

Learning Semi-supervised Gaussian Mixture Models for Generalized Category Discovery

10 May 2023ICCV 2023 1arXiv:2305.06144archive 2025-07-28

Bingchen Zhao, Xin Wen, Kai Han

In this paper, we address the problem of generalized category discovery (GCD), \ie, given a set of images where part of them are labelled and the rest are not, the task is to automatically cluster the images in the unlabelled data, leveraging the information from the labelled data, while the unlabelled data contain images from the labelled classes and also new ones. GCD is similar to semi-supervised learning (SSL) but is more realistic and challenging, as SSL assumes all the unlabelled images are from the same classes as the labelled ones. We also do not assume the class number in the unlabelled data is known a-priori, making the GCD problem even harder. To tackle the problem of GCD without knowing the class number, we propose an EM-like framework that alternates between representation learning and class number estimation. We propose a semi-supervised variant of the Gaussian Mixture Model (GMM) with a stochastic splitting and merging mechanism to dynamically determine the prototypes by examining the cluster compactness and separability. With these prototypes, we leverage prototypical contrastive learning for representation learning on the partially labelled data subject to the constraints imposed by the labelled data. Our framework alternates between these two steps until convergence. The cluster assignment for an unlabelled instance can then be retrieved by identifying its nearest prototype. We comprehensively evaluate our framework on both generic image classification datasets and challenging fine-grained object recognition datasets, achieving state-of-the-art performance.

PaperPDFConference PDFCodeCode Syntology ran

In Syntology View this paper on Syntology: its repositories, every harvested function with whether it ran, its licence and the call to fetch it.

Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2305.06144")

Code

Syntology Ran 4 of 11 code samples harvested from 1 repository linked to this paper; 7 have no recorded run. Of those that ran: 1 ran · our draft was wrong; 1 ran · fixture could not drive it; 2 ran with no contract checked.

By repository: official repository: 11 samples from 1 repository, 4 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

DTennant/GPC officialpytorchMIT report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

11 samples harvested; 4 ran; 0 honoured the contract we drafted; 7 have no recorded run. Read from Syntology's graph 2026-09-25; that is when this build read the record, not when the samples ran.

1ran · our draft was wrong
1ran · fixture could not drive it
2ran
7unverified

Licence: 0 of the 11 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from DTennant/GPC. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

conv3x3 DTennant/GPC/models/wrn.py official repository ran · our draft was wrong MIT (permissive) · 00e569acd6b45ef0 · report
drop_path DTennant/GPC/models/vision_transformer.py official repository ran · fixture could not drive it fingerprinted MIT (permissive) · 55120f2026b56aa2 · report
evaluate_clustering DTennant/GPC/project_utils/cluster_utils.py official repository ran fingerprinted MIT (permissive) · 15d2b95b53f6db9a · report
purity_score DTennant/GPC/project_utils/cluster_utils.py official repository ran fingerprinted MIT (permissive) · 1645ca2fb55ce1f8 · report
cluster_acc DTennant/GPC/project_utils/cluster_utils.py official repository unverified MIT (permissive) · 569a0b5d2369b072 · report
info_nce_logits DTennant/GPC/project_utils/loss_utils.py official repository unverified MIT (permissive) · 261eee9d69c08e44 · report
pairwise_NNs_inner DTennant/GPC/project_utils/loss_utils.py official repository unverified MIT (permissive) · dbc15099505eb5a0 · report
pairwise_distance DTennant/GPC/methods/clustering/faster_mix_k_means_pytorch.py official repository unverified MIT (permissive) · 9e1769984f0ee4c2 · report
proto_for_supcon_logits DTennant/GPC/project_utils/loss_utils.py official repository unverified MIT (permissive) · 8fa5d913e26ce4e6 · report
vit_small DTennant/GPC/models/vision_transformer.py official repository unverified MIT (permissive) · 995a10f898196998 · report
vit_tiny DTennant/GPC/models/vision_transformer.py official repository unverified MIT (permissive) · 996780ba4be89ba3 · report

Tasks

Contrastive LearningImage ClassificationObject RecognitionRepresentation Learningimage-classification

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

Contrastive Learning

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections