- Rating
- 3
- Confidence
- 4
- Informativeness
- 3
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
This paper proposes Preserving Consistency and Progressively Integrating Diversity for Continual Multi-View Clustering (PC-PID). The method decomposes adjacent-view representations into a shared consistency component and view-specific diversity components. Contrastive knowledge transfer uses HSIC to strengthen dependence between historical and current consistency representations while suppressing redundant dependence between diversity representations. Progressive tensor fusion organizes adjacent diversity representations into a local tensor and applies tensor nuclear norm regularization to capture high-order correlations. Experiments are conducted on eight multi-view datasets against 14 static and continual baselines. The paper claims effectiveness and efficiency for continual multi-view clustering.
Critical strengths
The paper addresses an important and challenging problem: continual multi-view clustering with sequentially arriving views.
The consistency-diversity decomposition provides a reasonable way to separate shared and view-specific information.
Contrastive knowledge transfer using HSIC is a principled alternative to simple distance-based transfer.
Progressive tensor fusion with a local tensor is an efficient way to capture high-order correlations without storing all historical views.
The method is evaluated on eight datasets and compared with many recent baselines.
Ablation studies, parameter sensitivity, and convergence analysis are provided.
Critical weaknesses
The hyperparameter selection protocol uses ground-truth labels. The paper states: ``The configuration with the highest mean ACC is selected.'' Since ACC requires ground-truth cluster labels, this constitutes information leakage and is not valid in an unsupervised clustering setting. The same issue applies to the ten-run mean-ACC selection criterion used for baselines. The authors should adopt an unsupervised model-selection criterion, such as silhouette score, modularity, or stability, and report results accordingly.
The HSIC definition appears unconventional and potentially incorrect. Definition~1 defines
where $\mathbf{K}_A = \mathbf{H}\mathbf{A}^\top\mathbf{A}\mathbf{H}$, $\mathbf{K}_B = \mathbf{H}\mathbf{B}^\top\mathbf{B}\mathbf{H}$, and $\mathbf{H} \in \mathbb{R}^{m \times m}$. Here $m$ is the latent dimension, not the number of samples. Standard HSIC operates on sample-level kernel matrices of size $n \times n$. Using $m \times m$ matrices measures dependence across latent dimensions, not across samples. This mismatch needs to be clarified, and the theoretical properties of the proposed HSIC-based transfer should be re-examined.
The theoretical analysis of contrastive knowledge transfer is incomplete. Proposition~1 only provides an upper bound and equality condition for HSIC, but does not establish that minimizing the proposed CKT loss actually transfers the desired common clustering structure. The connection between HSIC alignment and clustering performance is asserted rather than proved. A formal guarantee or at least a more rigorous justification is needed.
Table~1 is severely malformed and incomplete. Many method names and numerical values are concatenated (e.g., DAG-FC0.9330.873...''), several columns appear missing, and some results are unavailable (-''). It is impossible to verify the claimed superiority. For example, on Scene15, PC-PID achieves ACC , while Orth-NTF achieves , TLRLF4 achieves , and TMC achieves . On Caltech101-all, PC-PID achieves ACC , while Orth-NTF achieves , but TLRLF4 achieves ? The table is too corrupted to assess. Complete and correctly formatted tables with standard deviations and significance tests are required.
The claim of ``state-of-the-art performance'' is not supported by the presented results. On several datasets and metrics, PC-PID is outperformed by static methods that use the full view set. For instance, on Scene15 and Caltech101-all, PC-PID is worse than Orth-NTF and TLRLF4 in ACC. The paper should clearly distinguish between continual and static settings and avoid overclaiming.
The progressive tensor fusion is claimed to be efficient, but the complexity analysis omits the cost of tensor singular value thresholding (t-SVT). For a tensor of size , t-SVT involves FFTs and matrix SVDs, whose complexity is not negligible. A detailed complexity breakdown and runtime comparison are needed.
The ablation study shows that removing CKT only decreases ACC by , while removing PTF decreases ACC by . This suggests that PTF is the dominant component and CKT contributes marginally. The paper should discuss whether CKT is necessary and whether the HSIC-based transfer is worth the added complexity.
The convergence analysis is not rigorous. The LOSS value temporarily increases around iterations 8--10, which is attributed to alternating block updates and adaptive penalty adjustment. However, no theoretical convergence guarantee is provided for the overall non-convex optimization. The stopping criterion and penalty parameter updates are heuristic. A formal convergence analysis or at least a more careful empirical study is needed.
The view-arrival order sensitivity experiment is only conducted on Scene15. The paper concludes that PC-PID is robust to order, but different orders lead to final ACC values ranging from to . This is a large variation. The claim of robustness should be tempered, and more datasets should be tested.
Reproducibility is insufficient. The code is not provided in the submission, and the exact parameter configurations for baselines are not fully reported. The use of ACC for hyperparameter selection makes it impossible to reproduce the method in a truly unsupervised manner.
Questions for authors
How do you justify using ACC for hyperparameter selection in an unsupervised clustering task? This uses ground-truth labels and invalidates the unsupervised setting. Can you provide results using an unsupervised model-selection criterion?
Can you clarify the definition of HSIC? Standard HSIC uses sample-level kernel matrices of size . Your definition uses matrices, where is the latent dimension. What is the theoretical justification, and how does this measure sample dependence?
Can you provide a formal proof or stronger justification that minimizing the CKT loss transfers the common clustering structure? Proposition~1 only gives an upper bound and equality condition.
Can you provide complete, correctly formatted tables with all baseline results, standard deviations, and statistical significance tests? The current Table~1 is unreadable.
On Scene15 and Caltech101-all, PC-PID is outperformed by static methods such as Orth-NTF and TLRLF4. How do you reconcile this with the claim of state-of-the-art performance?
Can you provide a detailed complexity analysis including the cost of t-SVT? How does the runtime compare with baselines?
The ablation shows that removing CKT only reduces ACC by , while removing PTF reduces it by . Is CKT necessary? What is the marginal benefit of HSIC over simpler alternatives?
Can you provide a theoretical convergence guarantee for the overall optimization? The LOSS value increases temporarily, and no formal proof is given.
The view-arrival order experiment shows large variation in final ACC ( to ). How can users choose a good order in practice? Can you test more datasets?
Will the code and exact parameter configurations be released to ensure reproducibility?