- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes DISC, a contrastive clustering framework motivated by the observation that many existing methods construct self-supervised signals using a predefined clustering structure, even though discovering that structure is itself the objective of clustering. DISC instead alternates between structure discovery and representation optimization. An EMA teacher extracts representations from which FINCH discovers a multi-granularity hierarchy, while a student encoder is optimized using a unified instance/prototype contrastive objective and a cross-granularity alignment objective. The resulting representation is subsequently used for another round of structure discovery.
Experiments on several clustering benchmarks report competitive or strong clustering performance. Ablation studies investigate the effects of multi-granularity supervision, hierarchical relationships, repeated structure discovery, the momentum teacher, and the two proposed loss components.
Critical strengths
-
A compelling formulation of multi-granularity structural supervision. Rather than committing representation learning to a single predefined clustering granularity, DISC repeatedly discovers a hierarchy from the evolving representation and uses multiple granularities as supervision. This is a natural approach to the unknown-granularity setting and gives the method a clear conceptual motivation.
-
Strong empirical results accompanied by useful ablations. DISC reports strong performance across several benchmark datasets, and the ablations provide evidence that the main components are consequential: hierarchical multi-granularity supervision outperforms single or independent multi-granularity supervision, while repeated structure discovery, the momentum teacher, and the alignment objective generally improve over their corresponding variants.
Critical weaknesses
The evaluation of the discovered hierarchy is insufficiently clear. DISC produces multiple clustering granularities, but the main tables report a single ACC/NMI/Purity/F-score per dataset. Importantly, the discovered hierarchy does not necessarily contain a level corresponding to the ground-truth class count; for example, the reported CIFAR-10 hierarchy has 1974, 393, 74, 16, 4, and 2 clusters. It is therefore unclear to me how the particular clustering used to compute the headline metrics is selected. This is consequential to the central claim that DISC does not need a predefined clustering structure: if ground-truth labels, ground-truth K, or retrospective selection of the best hierarchy level enters this evaluation, the interpretation of the results changes substantially.
Questions for authors
- How is the single clustering partition used to report ACC/NMI/Purity/F-score selected from DISC's final multi-granularity FINCH hierarchy? For example, the reported CIFAR-10 hierarchy contains K = 1974, 393, 74, 16, 4, and 2, rather than K = 10. Does the selection procedure use ground-truth K, labels, or any other dataset-specific information? Please describe the complete selection/evaluation procedure. This clarification could materially affect my assessment of the parameter-free/unknown-structure claim.
- The main text defines the alignment loss using KL divergence between the projected child distribution and the parent distribution, while the expression in Appendix B.2 appears to place the parent distribution in the numerator of the KL expression. Since KL divergence is asymmetric, could the authors clarify which direction is actually implemented and reconcile the equations?
2 comments
Follow up on our responses
Dear Reviewer 1EJH,
Thank you for your previous valuable comments. In our responses, we have addressed your concerns by clarifying the evaluation pipeline and multi-granularity hierarchical structure discovery mechanism of DISC (W1 & Q1), as well as checking the consistency of the implementation with Equation (8) and correcting the relevant expressions and derivations (Q2).
We would sincerely appreciate it if you could review our responses when convenient and let us know whether these explanations have addressed your concerns. We would be happy to discuss any remaining questions or provide further clarification.
Thank you very much for your time and consideration.
To evaluate clustering performance, we apply K-Means to the feature representations learned by DISC, using the ground-truth number of classes K to specify the number of clusters. The resulting single clustering partition is used to compute the reported clustering metrics. This evaluation protocol follows common practice in deep clustering.
The parameter-free property of DISC is primarily reflected in its use of FINCH to automatically discover clustering structures based on nearest-neighbor relations. It progressively constructs a multi-granularity hierarchy through iterative merging, without requiring any predefined clustering-related parameters. This mechanism enables DISC to jointly perform structure discovery and feature representation optimization under unknown clustering structures.
We have clarified the evaluation protocol (Lines 354–359) and provided a brief description of FINCH in the revised manuscript (Lines 236–238).
The KL divergence implemented in our code takes the projected child-level assignment distribution as the first argument and the corresponding parent-level assignment distribution as the second, consistent with the definition in Equation (8) of the main text. This alignment loss promotes consistency in the multi-granularity hierarchy by constraining the assignment distributions across adjacent hierarchy levels. In response to the reviewer's comment, we have revised the loss expression and its gradient derivation in Appendix B.2 to ensure consistency with Equation (8).