- Rating
- 3(+1)
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
DSMVC addresses clustering with sequentially arriving views without revisiting historical raw data. It uses a curvature-based SVD partition to obtain dominant and residual representations. AGSM suppresses residual reconstruction dimensions according to their contribution to reconstruction non-additivity, while DGAM weights cross-view alignment using prediction-error differences between matched and permuted pairs. Historical embeddings are retained for subsequent alignment and final clustering. Experiments on seven datasets report improvements over the evaluated sequential baselines.
Critical strengths
-
The paper addresses a relevant problem: clustering sequentially arriving views without revisiting historical raw data.
-
Table 1 reports consistent gains over the evaluated sequential baselines across seven datasets and three metrics, using five runs.
-
Gaussian-noise experiments and component ablations support the framework’s robustness and the usefulness of its added objectives.
Critical weaknesses
-
AGSM’s selection rule needs stronger validation. Eqs. (11)–(12) measure reconstruction non-additivity, which need not identify nuisance features. Existing experiments support robustness and suppression, but do not isolate targeted selection from general regularization. A matched random-mask or uniform-penalty control would help.
-
DGAM’s weight ablation is confounded by alignment strength. Setting all weights to 1 in Appendix C.3 changes both correspondence weighting and overall loss strength. A mean-matched constant weight or retuned alignment coefficient is needed to isolate the benefit of reliability-based weighting.
-
Some reproducibility details remain unclear. Algorithm 1 and Appendix C.7 do not clearly specify final buffer-feature computation after mini-batch SVD, gradient detachment for adaptive weights, or input feature extraction and normalization. These choices can affect reproduction of the reported results.
Questions for authors
-
Does AGSM retain its advantage over suppression-budget-matched random masks or uniform penalties?
-
Does DGAM improve over a mean-matched constant weight or a uniform-weight baseline with a retuned alignment coefficient?
-
How are final buffer features computed, are adaptive weights detached, and what feature extraction and normalization are used?
3 comments
Thank you for your response and the additional experiments. I have read the response, and it addresses my main concerns. I will update my rating to 3.
Thank you very much for your reply and for taking the time to read our response! We are glad it addressed your concerns, and we really appreciate your helpful comments on our work.
[W1/Q1: Validation of the Attribution-Guided Selection Rule] We thank the reviewer for the insightful suggestion to isolate targeted selection from general regularization. To investigate this, we compare AGSM with two baselines: Uniform Penalty (unweighted penalty across all dimensions) and Random Mask (stochastically dropping dimensions matched to AGSM's masking ratio). As shown in Table 1, AGSM consistently outperforms both variants across all datasets. For instance, it exceeds both variants by over 23% in ACC on COIL20. This confirms that indiscriminate masking inevitably corrupts essential consensus features, whereas AGSM identifies and suppresses volatile components, effectively purifying the feature subspace. Detailed content is provided in Appendix D.8 (P18–P19).
Table 1: Clustering Accuracy under Different Masking Settings
[W2/Q2: Ablation on Alignment Weights] We appreciate the reviewer's advice to decouple reliability-based weighting from overall alignment strength. To achieve this, we compare DSMVC with two variants, including a constant baseline with the average dynamic weight (γw=γˉw) and a uniform baseline (γw=1) with its optimal coefficient. As shown in Table 2, DSMVC achieves superior performance over both comparative baselines across all benchmarks. Even after exhaustive tuning, the uniform baseline still trails DSMVC by substantial margins, such as 14.55% in ACC on COIL20 and 2.42% on Out-Scene, indicating that models relying on uniform scaling remain vulnerable to unreliable associations. By contrast, DGAM dynamically downweights unreliable pairs via permutation-induced prediction inconsistency, preserving reliable semantic consensus across streaming scenarios. We have added the relevant analysis in Appendix D.4 (P16-P17).
Table 2: Clustering Accuracy under Different Alignment Weights
[W3/Q3: Reproducibility and Implementation Details] We sincerely thank the reviewer for pointing out these critical implementation details. For clarity, we have added these details in Appendix D.12 (P21): 1) Input features across all datasets are pre-processed via row-wise min-max normalization into [0,1]. 2) After spectral decomposition, the dominant features are cached in the historical buffer to guide the training of DGAM, while residual features are preserved for final clustering. 3) The adaptive alignment weights γw in DGAM are detached from the computational graph, derived from permutation-induced prediction inconsistency to prevent trivial degeneration during backpropagation. To ensure reproducibility, our code will be publicly released upon acceptance.
We are grateful for the Reviewer's time and rigorous feedback. Your comments prompted us to provide more empirical experiments and implementation details that substantially solidify our innovations and claims. We sincerely hope our thorough responses can resolve your concerns. Please don't hesitate to contact us with any questions, and we would be happy to provide further clarification.