Pith. sign in

REVIEW 6 cited by

XCon: Learning with Experts for Fine-grained Category Discovery

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2208.01898 v1 pith:3SPAS6GS submitted 2022-08-03 cs.CV

classification cs.CV
keywords classescategoryseendiscoveryfine-grainedlearningclusteringdataset
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We address the problem of generalized category discovery (GCD) in this paper, i.e. clustering the unlabeled images leveraging the information from a set of seen classes, where the unlabeled images could contain both seen classes and unseen classes. The seen classes can be seen as an implicit criterion of classes, which makes this setting different from unsupervised clustering where the cluster criteria may be ambiguous. We mainly concern the problem of discovering categories within a fine-grained dataset since it is one of the most direct applications of category discovery, i.e. helping experts discover novel concepts within an unlabeled dataset using the implicit criterion set forth by the seen classes. State-of-the-art methods for generalized category discovery leverage contrastive learning to learn the representations, but the large inter-class similarity and intra-class variance pose a challenge for the methods because the negative examples may contain irrelevant cues for recognizing a category so the algorithms may converge to a local-minima. We present a novel method called Expert-Contrastive Learning (XCon) to help the model to mine useful information from the images by first partitioning the dataset into sub-datasets using k-means clustering and then performing contrastive learning on each of the sub-datasets to learn fine-grained discriminative features. Experiments on fine-grained datasets show a clear improved performance over the previous best methods, indicating the effectiveness of our method.

Discussion (0). Sign in to comment.

Forward citations

Cited by 6 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Identifying Latent Concepts and Structures for Generalized Category Discovery

    cs.CV 2026-07 unverdicted novelty 7.0 of 10

    CPF-GCD enforces low-rank compositional structure on vision backbone features via spatial primitive fields so that novel categories emerge as new activation patterns over a shared vocabulary of reusable visual primitives.

  2. Explainable Novel Category Discovery in Semantic Concept Space

    cs.CV 2026-07 conditional novelty 6.0 of 10

    xNCD routes novel category discovery through a CLIP-aligned concept bottleneck, matching strong NCD baselines while producing intrinsic cluster- and instance-level concept explanations.

  3. Unlocking Optical Prior: Spectrum-Guided Knowledge Transfer for SAR Generalized Category Discovery

    cs.CV 2026-04 unverdicted novelty 6.0 of 10

    A frequency-domain modeling approach transfers optical priors to SAR imagery via paired pre-training, enabling state-of-the-art generalized category discovery on SAR data.

  4. The Devil Is in Gradient Entanglement: Energy-Aware Gradient Coordinator for Robust Generalized Category Discovery

    cs.LG 2026-03 unverdicted novelty 6.0 of 10

    EAGC mitigates gradient entanglement in GCD by anchoring supervised gradients and adaptively projecting unlabeled ones, boosting existing methods to new state-of-the-art performance.

  5. Sparsity Hurts: Simple Linear Adapter Can Boost Generalized Category Discovery

    cs.CV 2026-05 unverdicted novelty 5.0 of 10

    LAGCD inserts residual linear adapters into each ViT block plus a distribution alignment loss to improve generalized category discovery by increasing model flexibility while reducing bias between seen and novel classes.

  6. Unsupervised Incremental Learning Using Confidence-Based Pseudo-Labels

    cs.CV 2025-08 conditional novelty 4.0 of 10

    ICPL generates pseudo-labels by clustering embeddings with KMeans, keeps only confident ones, and uses them to train class-incremental models without human labels, losing about 10 points versus supervised CIL but beat...

Pith tools