Kai Han, Xin Wen, Bingchen Zhao
We lifted 11 functions out of this paper's own repositories and ran 4 of them in a sandbox. "Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results.
| Repository | Role | Ran |
|---|---|---|
| DTennant/GPC | canonical | 4 of 11 |
| Function | Status | Where it lives |
|---|---|---|
| conv3x3 | Ran | DTennant/GPC/models/wrn.py code served (permissive licence) · get_code("00e569acd6b45ef0") |
| drop_path | Ran | DTennant/GPC/models/vision_transformer.py code served (permissive licence) · get_code("55120f2026b56aa2") |
| evaluate_clustering | Ran | DTennant/GPC/project_utils/cluster_utils.py code served (permissive licence) · get_code("15d2b95b53f6db9a") |
| purity_score | Ran | DTennant/GPC/project_utils/cluster_utils.py code served (permissive licence) · get_code("1645ca2fb55ce1f8") |
| cluster_acc | Not yet run | DTennant/GPC/project_utils/cluster_utils.py code served (permissive licence) · get_code("569a0b5d2369b072") |
| info_nce_logits | Not yet run | DTennant/GPC/project_utils/loss_utils.py code served (permissive licence) · get_code("261eee9d69c08e44") |
| pairwise_NNs_inner | Not yet run | DTennant/GPC/project_utils/loss_utils.py code served (permissive licence) · get_code("dbc15099505eb5a0") |
| pairwise_distance | Not yet run | DTennant/GPC/methods/clustering/faster_mix_k_means_pytorch.py code served (permissive licence) · get_code("9e1769984f0ee4c2") |
| proto_for_supcon_logits | Not yet run | DTennant/GPC/project_utils/loss_utils.py code served (permissive licence) · get_code("8fa5d913e26ce4e6") |
| vit_small | Not yet run | DTennant/GPC/models/vision_transformer.py code served (permissive licence) · get_code("995a10f898196998") |
| vit_tiny | Not yet run | DTennant/GPC/models/vision_transformer.py code served (permissive licence) · get_code("996780ba4be89ba3") |
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
In this paper, we address the problem of generalized category discovery (GCD), i.e., 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. Our code is available at https://github.com/DTennant/GPC.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2305.06144")
get_code_for_paper("2305.06144")
have("2305.06144")
Connect an agent — have() is free.