- Rating
- 3(+1)
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper studies the constrained clustering problem under continuous pairwise relationship supervision. The authors propose Graded DualPair (GDP), which learns graded relationships through Local representation learning, forms cluster partitions through Global representations and fixed simplex prototypes, and coordinates the two via relationship ranking and Local–Global consistency. Furthermore, the authors extend the GDP-Hier framework to multiple pre-specified levels, learning multi-resolution partitions by combining same-cluster relationships across levels. Experiments show that the method performs relatively stably under various supervision semantics and score rescalings, and achieves good clustering accuracy and cross-level consistency.
Critical strengths
- The paper points out that identical intermediate relationship scores may represent uncertain evidence, mixed membership, or coarse-level consistency, thereby reasonably distinguishing the two objectives of relationship preservation and cluster partitioning.
- The Local–Global division of labor combined with ranking supervision preserves continuous relationship information while forming explicit clusters, reducing the limitation of directly interpreting raw scores as same-cluster probabilities.
- The paper evaluates multiple supervision semantics, score rescalings, and hierarchy scales, and validates the main components through ablation and mechanism analyses. The accuracy and cross-level consistency results of GDP-Hier on complex hierarchies are particularly convincing.
Critical weaknesses
- Why are the Local and Global networks set up sequentially? Would the resulting features have sequential dependencies? If a parallel design were used, what impact would it have on the results?
- Furthermore, Local fits the raw scores via Equation (3), while Equation (7) requires the Global same-cluster relationships to be close to the Local values. Therefore, even though Global's direct supervision adopts ranking, the raw scores still indirectly constrain the cluster assignment.
- The layers of GDP-Hier are trained jointly by combining relationships, but there is no explicit guarantee that a fine-grained cluster can belong to only one coarse-grained cluster, so the output may still violate the nesting relationship. In addition, the recovery conclusion of Theorem 5.4 relies on conditions such as assignment concentration, constraint connectivity, and sufficiently small error, and does not guarantee that the training process reaches these conditions. It is suggested to further analyze the sources of hierarchical conflicts and explore explicit nesting constraints.
- In the experimental results, how is the supervision information between sample pairs obtained?
Questions for authors
Please see weaknesses.
6 comments
Response 2/4: Weakness 2
W2. Raw graded scores still indirectly influence Global assignments
"Furthermore, Local fits the raw scores via Equation (3), while Equation (7) requires the Global same-cluster relationships to be close to the Local values. Therefore, even though Global's direct supervision adopts ranking, the raw scores still indirectly constrain the cluster assignment."
[Response]
Indeed, raw scores indirectly influence Global assignments. This is an intentional and beneficial part of our design, supported by both ablation and semantic-alignment evidence. We first clarify the motivation behind this design, and then provide direct evidence of its benefits:
-
1. Complementary rather than conflicting roles of ranking and raw scores.
Ranking constrains only the relative ordering of Global relations, without imposing fixed numerical gaps between relation scores (Sec. 4.2, Eq. (5), lines 181–189). Meanwhile, Local learns relation values directly from raw grades (Eqs. (2)–(3)), which LGRC transfers to Global (Eq. (7)). Theorem 5.2 formally establishes their complementarity in relation space: under increasing Ranking pressure, the combined objective converges to the order-consistent relations closest to the Local values, preserving them exactly when already order-consistent (Sec. 5, lines 270–279; Appendix A.3).
-
2. Empirical evidence for the benefits of retaining both ranking and raw scores.
-
Ablation evidence.
-
Ranking is more effective under the tested grade recalibrations. Table 3 compares GDP with Global BCE. Ranking gives the clearer advantage under Difficulty and recalibrated Mix, whereas direct Global BCE remains competitive when Mix grades retain their native overlap interpretation.
-
Local-to-Global relation transfer provides additional benefits. Removing LGRC reduces ACC/NMI/ARI in all 49 originally reported dataset–condition cases (Appendix D.6, lines 2373–2375) and all 21 new ParallelGDP settings (W1, see above), supporting the benefits of transferring Local's raw-grade-informed relations to Global under both sequential and parallel architectures.
-
-
Preservation of graded semantics.
- Figure 13: Under both Difficulty and Mix, the supplied grades exhibit positive Spearman correlations with the learned Local and Global relation scores across all seven datasets, showing that Global relations retain the ordering information in graded supervision (Appendix D.6, lines 2480–2483; Fig. 13).
- Table 24: We further evaluate whether Global assignments preserve the source-specific semantics of graded supervision. Under Difficulty, source decisiveness is positively correlated with Global relation decisiveness (Spearman ρ = 0.448–0.726). Under Mix, mixture ambiguity is positively correlated with Global assignment entropy (ρ = 0.194–0.527). Both correlations are positive across all seven datasets, showing that Global assignments remain sensitive to both the strength of relational evidence and the ambiguity of mixed membership (Appendix D.6, Table 24 and lines 2514–2522).
-
Thus, the indirect influence of raw scores is a deliberate and beneficial part of our design: retaining both ranking and raw-score-informed Local relations improves clustering performance while preserving the semantics of graded supervision.
Response 3/4: Weakness 3-4
W3. Cross-level nesting and theoretical recovery guarantee
Concern A: Explicit nesting and cross-level hierarchy conflicts.
"... do not explicitly guarantee that each fine-grained cluster belongs to only one coarse-grained cluster, potentially resulting in nesting violations. Further analysis ... and exploration of explicit nesting constraints are suggested."
Concern B: Theoretical recovery guarantee and practical conditions.
The recovery guarantee in Theorem 5.4 relies on conditions such as assignment concentration, constraint connectivity, and sufficiently small error, without guaranteeing that these conditions are satisfied during actual training.
[Response]
We address both concerns through analyses already included in the paper: explicit nesting post-processing, cross-level conflict analysis, sufficient recovery conditions, and controlled empirical validation.
-
1. Concern A: Nesting and hierarchy conflicts.
-
Design rationale. GDP-Hier aims to balance levelwise clustering accuracy and cross-level coherence through joint multi-resolution learning, rather than enforcing strict nesting by construction (Secs. 4.4 and 7).
-
Requested evaluation of explicit nesting. The original Appendix D.5 (Table 20) evaluates agglomerative post-processing of input features and baseline embeddings, yielding zero HVR by construction. GDP-Hier achieves higher Mean ACC than the strongest nested reference on three of five datasets, including T200 (47.3% vs. 41.0%); the reverse holds for Aircraft and T608. Thus, perfect structural nesting alone does not guarantee better semantic hierarchy recovery.
-
Requested hierarchy conflict analysis. The original Table 18 localizes T608's hierarchy violations: parent-to-leaf reaches 12.8 ± 1.1%, compared with 3.9 ± 1.1% and 2.7 ± 0.7% at the two coarser transitions (Appendix D.5). GDP-Hier achieves the lowest HVR on four of five real hierarchical benchmarks among native constrained methods (Sec. 6.2, Table 2).
Thus, the original results demonstrate GDP-Hier's strong balance of levelwise accuracy and cross-level coherence among native constrained methods, while identifying the remaining hierarchy conflicts.
-
-
2. Concern B: Recovery theory and practical relevance.
-
Theoretical guarantee. Theorem 5.4 establishes sufficient conditions for exact hierarchy recovery (Sec. 5). The guarantee applies when these conditions hold; it does not assert that training necessarily attains them.
-
Empirical validation. Our Synthetic-Hier experiments examine the practical relevance of these recovery conditions through two complementary analyses. The E95 diagnostic shows that more favorable theory-related error levels are associated with better hierarchy recovery, while a matched breakpoint-gap intervention demonstrates that weakening a key recovery factor degrades recovery performance (Sec. 6.2, Fig. 4).
Thus, theory establishes sufficient recovery conditions, while empirical validation demonstrates their practical relevance.
-
Thus, the paper directly addresses both concerns: explicit-nesting evaluation and conflict analysis, alongside sufficient recovery conditions and empirical validation of their practical relevance.
W4. Provenance of pairwise supervision
"… how is the supervision information between sample pairs obtained?"
[Response]
Sec. 6.1 and Appendix C.3 document five supervision sources: binary constraints and four graded forms capturing instance difficulty, mixed membership, human judgments, and hierarchical semantics.
-
Binary: Same-class/different-class supervision derived from ground-truth labels (Appendix C.3, lines 1223–1226).
-
Difficulty: Classifier-derived predictive distributions capture instance easiness and induce graded pairwise relationships (lines 1228–1241).
-
Mix: Soft membership vectors from mixed samples provide graded pairwise relationships through their inner products (lines 1254–1265).
-
Human-derived: CIFAR10H grades derive from aggregated human class distributions (Appendix C.3, lines 1267–1272). We additionally evaluate FMNIST-H as a second human-annotated dataset (see our response to Reviewer r5XW, Q2).
-
Hierarchy-induced: Pairwise grades reflect the deepest semantic resolution of each sample pair (lines 1274–1283).
The appendices provide all technical details, including pairwise-grade construction (Appendix C.3), constraint sampling, experimental protocols, grade calibration settings, and numerical transformations (Appendices C.4 and D.4). The supplementary materials provide the complete source code, experimental resources, and reproduction instructions.
Response 1/4: Weakness 1
We appreciate your time and effort in evaluating our work and your positive assessment of the motivation for distinguishing graded-relation preservation from explicit cluster formation, the Local–Global division of labor with ranking supervision, and our evaluation across supervision semantics, score rescalings, and hierarchy scales.
Below, we address all four of the concerns point by point.
W1. Sequential versus parallel Local–Global architecture
[Response]
We thank the reviewer for this constructive question, which provides an opportunity to demonstrate the architectural flexibility of GDP. Our central contribution lies in separating graded-relation preservation from explicit partition formation and effectively coordinating the two, a methodological principle that does not depend on a particular sequential network topology.
Sequential Local–Global architecture. In the original GDP, the Local–Global division of labor takes concrete form in a sequential architecture, with Global directly reusing the relation-preserving representations learned by Local for explicit partition formation (Eq. (4)).
Feature dependency in the sequential architecture. In the original GDP, Global features are computed from Local features, as specified by zjglob=fϕglob(zjloc) (Eq. (4)). The resulting feature dependency follows from this computation path, which we further examine through a parallel architecture below.
Requested analysis of parallel Local–Global architecture. Following your suggestion, we conducted an additional ParallelGDP experiment to directly assess the impact of parallel design.
Model and protocol. ParallelGDP uses a shared 500–500 backbone with separate Local (2000D) and Global (D) heads; Global reads shared features rather than Local features. LGRC and all other GDP losses, weights, and schedules are retained (LGRC every epoch; detached Local targets). We evaluate 7 datasets × 3 supervision types × 5 runs, using 5k constraints without autoencoder pretraining.
Results. Test ACC/NMI/ARI (%, five-run means). GDP references are from original Table 12.
Comparison. With LGRC retained, ParallelGDP achieves performance broadly comparable to sequential GDP across the evaluated settings, demonstrating the architectural flexibility of our Local–Global coordination framework.
Complementary LGRC ablation. We evaluate ParallelGDP without LGRC to examine relation transfer under parallel feature processing. Retaining LGRC improves mean ACC/NMI/ARI in all 21 settings. On CIFAR100-20/Binary, the no-LGRC model achieves 66.3% Local K-means ACC but only 25.9% Global-assignment ACC. These findings complement our response to Weakness 2 (see below), extending the evidence for LGRC's benefits to parallel feature processing.
Together, these results directly address sequential design, feature dependency, and parallelization. We will incorporate the new results into the revised manuscript.