- Rating
- 2
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper proposes LCLS-SMKC for scalable multiple kernel clustering. It combines multi-scale landmark sampling, a dimensionality-dependent choice of kernel construction, feature diffusion and reweighting, and feedback-controlled consensus learning. The authors claim improved approximation, stability, convergence, and generalization guarantees. Experiments cover six datasets, comparisons with kernel and multi-view clustering methods, component ablations, and robustness to noise and outliers.
Critical strengths
(1) Improving the compatibility between low-rank kernel representations and consensus learning is a meaningful problem for scalable clustering.
(2) The method integrates several concrete, testable design choices, including sampling across kernel scales and feedback-controlled regularization.
(3) The evaluation covers six datasets, including 70,000 samples in MNIST, and includes component ablations, runtime comparisons, and noise/outlier experiments.
Critical weaknesses
(1) Theorem 1 is false under its stated assumptions. For K = I_n and s < n landmarks, every size-s subset gives the same squared Frobenius Nystrom error n-s. Thus, multi-scale sampling cannot strictly improve on uniform sampling by a positive amount. This directly contradicts the claimed universal improvement and undermines a central theoretical justification.
(2) The optimization does not clearly implement the claimed adaptation. Algorithm 1 constructs KH_v before the loop without subsequently updating it, and Eq. (20) measures embedding disagreement rather than kernel-approximation error. Moreover, the S_v update in Eq. (24) omits the diversity term in Eq. (23). The claimed kernel-space updates and convergence guarantees therefore need a consistent derivation.
(3) Some reported metrics contradict their definitions in Appendix A.3. Under these definitions, PUR cannot be lower than ACC when both metrics are computed from the same clustering assignments and averaged over the same runs. However, Table 7 reports ACC = 63.42 and PUR = 63.05 for LCLS-SMKC on MSRC-v6. This basic inconsistency raises serious concerns about the reliability of the reported experimental results.
Questions for authors
(1) How should Theorem 1 be revised to accommodate kernels such as K = I_n, where all landmark subsets of the same size have identical approximation error?
(2) Can Eqs. (24) and (27) be derived from Eq. (23), including its diversity and graph terms? Which kernel-space quantities actually change inside the optimization loop?
(3) Were ACC and PUR computed from identical cluster assignments and averaged over the same runs? How should the conflicting values in Table 7 be reconciled?
Thanks for the rebuttal. After reading the authors' reply, my concerns have been solved and I raise my score.