- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper proposes MVCL-KS, a multi-view clustering framework that interprets contrastive learning as signed cross-view relationships and combines them with view-specific kernel geometry. Its central idea is to refine the clustering representation through a self-consistent spectral system. Experiments on conventional benchmarks show strong ACC and substantially faster training, though NMI and ARI results are less consistent and the validation offers limited insight into how the proposed mechanism works during learning.
Overall: an interesting, efficient framework with strong ACC results, but inconsistent NMI/ARI and limited empirical evidence for its core refinement mechanism. Borderline, leaning reject, but open to revision after rebuttal.
Critical strengths
-
The signed-operator formulation explicitly models cross-view attraction and repulsion while incorporating view-specific kernel geometry. This provides a useful perspective on multi-view contrastive learning and its connection to spectral methods.
-
MVCL-KS demonstrates an advantage in terms of ACC across multi-view benchmarks while substantially reducing runtime compared with existing methods.
Critical weaknesses
-
Across datasets, MVCL-KS demonstrates advantages in terms of ACC, but its performance on ARI and NMI remains inconsistent. For instance, a 10.11% performance gap in ARI is observed on NUS-WIDE. These results raise questions about the generalizability in clustering quality. Further analysis of the reasons behind these discrepancies would help clarify the strengths and limitations of MVCL-KS.
-
The experimental validation is limited mainly to standard sensitivity analyses and component ablations. It does not show how the cross-view probabilities , signed weights , or leading spectral subspace evolve during refinement. Tracking positive-pair and hard-negative probabilities, one- and two-step subspace distances, and ACC/NMI/ARI across iterations would clarify whether the proposed dynamics approach self-consistency and improve clustering beyond the initial kernel embedding.
-
Multi-view data have become increasingly prevalent in real-world applications, such as autonomous driving perception and multimodal medical analysis. The experiments here focus on established clustering benchmarks such as 3Sources, BBCSport, and Caltech. These benchmarks support comparison with prior work, but leave the method’s applicability to more complex multimodal settings unclear. A discussion of view alignment and kernel construction costs in such settings would strengthen its practical motivation. I recognize that a full application study may be challenging, so I offer this as a suggestion rather than a requirement for this paper.
-
The framework diagram could be substantially improved. It is visually cluttered and largely repeats equations from the text, offering little intuition about the role of each component or how information flows through the method.
Questions for authors
Please refer to Major Weakness.
We thank the reviewer for identifying the metric inconsistency and requesting direct evidence of the refinement mechanism. We have corrected the affected comparisons and added iteration diagnostics to the main text.
W1 — Clustering consistency.
We identified a column-assignment error in the original submission, where the ARI and F1 values for RMCNC and ROLL were interchanged. We have corrected the affected entries in Tables 1, 2, and 4 and verified them against the original evaluation records. All MVCL-KS results remain unchanged. We apologize for this reporting error.
With this correction, the previously reported 10.11-point ARI deficit on NUS-WIDE no longer holds. The corrected ARIs are 8.77% for RMCNC and 6.26% for ROLL, compared with 17.54% for MVCL-KS. Our method therefore ranks second in ARI, only 1.11 percentage points below OMVCDR (18.65%), while retaining the highest ACC (39.88%). These corrected results provide a more accurate assessment of MVCL-KS across clustering metrics.
W2 — Refinement dynamics and gains beyond initialization.
New Figure 3 (Section 5.3) directly tracks positive-pair and hard-negative probabilities, one- and two-step subspace distances, and ACC across refinement iterations. BBCSport meets the one-step tolerance at t=2, while 3Sources and Caltech meet the two-cycle criterion at t=7 and t=4. The remaining datasets reach the iteration limit. These diagnostic trajectories continue for all 15 raw updates, with markers indicating the first stopping decision. Table 8 separately evaluates the standard stopping and stabilization procedure, which improves ACC over initialization on all six datasets by 0.19–1.74 percentage points.
W3 — Multimodal applicability.
Section 4.2 now states the sample-level correspondence requirement and explains how view-specific kernels accommodate different feature dimensions. It also gives the dense kernel construction cost, O(N2∑vdv), the current kernel eigendecomposition cost, O(VN3), and the anchor-based alternative. For sensor or medical inputs, correspondence is supplied by acquisition or preprocessing.
W4 — Motivation and framework figures.
New Figure 1 explains how target–prediction mismatch produces signed attraction–repulsion corrections. Revised Figure 2 shows how these corrections combine with view-specific kernels in a joint spectral operator and how the resulting embedding updates the probabilities. The figures now emphasize component roles and information flow.