Papers › Learn to Categorize or Categorize to Learn? Self-Coding for Generalized Category Discovery

Learn to Categorize or Categorize to Learn? Self-Coding for Generalized Category Discovery

30 Oct 2023NeurIPS 2023 11arXiv:2310.19776archive 2025-07-28

Sarah Rastegar, Hazel Doughty, Cees G. M. Snoek

In the quest for unveiling novel categories at test time, we confront the inherent limitations of traditional supervised recognition models that are restricted by a predefined category set. While strides have been made in the realms of self-supervised and open-world learning towards test-time category discovery, a crucial yet often overlooked question persists: what exactly delineates a category? In this paper, we conceptualize a category through the lens of optimization, viewing it as an optimal solution to a well-defined problem. Harnessing this unique conceptualization, we propose a novel, efficient and self-supervised method capable of discovering previously unknown categories at test time. A salient feature of our approach is the assignment of minimum length category codes to individual data instances, which encapsulates the implicit category hierarchy prevalent in real-world datasets. This mechanism affords us enhanced control over category granularity, thereby equipping our model to handle fine-grained categories adeptly. Experimental evaluations, bolstered by state-of-the-art benchmark comparisons, testify to the efficacy of our solution in managing unknown categories at test time. Furthermore, we fortify our proposition with a theoretical foundation, providing proof of its optimality. Our code is available at https://github.com/SarahRastegar/InfoSieve.

PaperPDFConference PDFCodeCode Syntology ran

In Syntology 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="2310.19776")

Code

Syntology Ran 6 of 12 code samples harvested from 1 repository linked to this paper; 6 have no recorded run. Of those that ran: 1 ran · fixture could not drive it; 5 ran with no contract checked.

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

sarahrastegar/infosieve officialmentioned in papermentioned on GitHubpytorchMIT report
sarahrastegar/selex mentioned on GitHubpytorchMIT 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

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

1ran · fixture could not drive it
5ran
6unverified

Licence: 0 of the 12 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 sarahrastegar/infosieve. “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.

SupConLoss sarahrastegar/infosieve/methods/contrastive_training/contrastive_training.py official repository ran fingerprinted MIT (permissive) · 9f9e36b6ddd2244e · report
drop_path SarahRastegar/InfoSieve/models/vision_transformer.py official repository ran · fixture could not drive it fingerprinted MIT (permissive) · 55120f2026b56aa2 · report
evaluate_clustering SarahRastegar/InfoSieve/project_utils/cluster_utils.py official repository ran fingerprinted MIT (permissive) · 15d2b95b53f6db9a · report
purity_score SarahRastegar/InfoSieve/project_utils/cluster_utils.py official repository ran fingerprinted MIT (permissive) · 1645ca2fb55ce1f8 · report
strip_state_dict SarahRastegar/InfoSieve/project_utils/general_utils.py official repository ran MIT (permissive) · bc2c748ee9fffddf · report
transform_moco_state_dict SarahRastegar/InfoSieve/project_utils/general_utils.py official repository ran MIT (permissive) · 443a6ab0aca3d0e3 · report
cluster_acc SarahRastegar/InfoSieve/project_utils/cluster_utils.py official repository unverified MIT (permissive) · 569a0b5d2369b072 · report
get_dino_head_weights SarahRastegar/InfoSieve/project_utils/general_utils.py official repository unverified MIT (permissive) · aacf96bb3684f3d0 · report
info_nce_logits SarahRastegar/InfoSieve/methods/contrastive_training/contrastive_training.py official repository unverified MIT (permissive) · 85ee1355feee1220 · report
pairwise_distance SarahRastegar/InfoSieve/methods/clustering/faster_mix_k_means_pytorch.py official repository unverified MIT (permissive) · 980dd2e8fa24f9da · report
vit_small SarahRastegar/InfoSieve/models/vision_transformer.py official repository unverified MIT (permissive) · 995a10f898196998 · report
vit_tiny SarahRastegar/InfoSieve/models/vision_transformer.py official repository unverified MIT (permissive) · 996780ba4be89ba3 · report

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

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