- Rating
- 2
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes CAESAR to address two challenges: adapting foundation models to clustering tasks and automatically determining the number of clusters K. Specifically, CAESAR constructs a mutual k-nearest neighbor graph and trains a reorganization network without requiring prior knowledge of the number of clusters. The method is evaluated on three image datasets and one text dataset.
Critical strengths
- The method does not require prior knowledge of the number of clusters K.
- The method adapts the foundation model to the clustering task and then performs clustering.
Critical weaknesses
- Many existing methods have already explored adapting foundation models to clustering tasks and estimating the unknown number of clusters K. Therefore, the problem addressed in this paper is not sufficiently novel.
- On some datasets, such as CIFAR-10, directly applying K-means to features extracted from foundation models can already achieve good clustering performance. Although this paper does not require prior knowledge of the number of clusters K, its clustering performance is substantially worse than that of foundation model features + K-means with known K.
- The compared clustering methods are not sufficiently recent. The authors should compare their method with the latest clustering methods published at top-tier conferences in 2026. The number of experimental datasets is too limited, and the ablation studies are not sufficiently comprehensive.
Questions for authors
Please see the weaknesses.