- Rating
- 1
- Confidence
- 4
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
This paper addresses the problem of cross-view semantic alignment in incomplete multi-view clustering and proposes DPD, a framework that combines prototype diffusion with distribution alignment. It enhances semantic consistency across different views through shared prototypes and generates unified representations using a mask-aware fusion module. Experiments on five benchmark datasets under different missing rates demonstrate the competitive performance of the proposed method.
Critical strengths
The paper focuses on the problem of missing views in incomplete multi-view clustering. The proposed method has some novelty in combining prototype diffusion with alignment mechanisms to leverage information across different views and improve clustering performance. Overall, the paper presents a relatively clear and understandable approach.
Critical weaknesses
-
The prototype distribution alignment, instance-level contrastive learning, and latent diffusion regularization techniques used in the paper are all combinations of existing mechanisms. Ablation studies that remove individual loss terms alone are insufficient to clarify whether these mechanisms have indispensable technical connections, leaving it unclear whether the core framework offers substantive innovation that distinguishes it from existing methods.
-
The effectiveness of the prototype distribution alignment mechanism is difficult to assess. MMD primarily constrains the overall distribution discrepancy between different views and the shared prototype distribution, but does not explicitly establish semantic correspondences between samples and prototypes. In addition, the effects of the number of prototypes and their initialization strategy on model performance remain to be verified.
-
The training and fusion strategies have certain limitations. The paper primarily models the problem in a two-view setting, while missing views are mainly handled through the final mask-weighted fusion. This design does not fully exploit the large number of unpaired samples, and the method's ability to scale effectively to more complex scenarios involving a larger number of views has yet to be demonstrated.
-
The paper does not sufficiently distinguish the individual contributions and interaction effects of prototype alignment and diffusion regularization through experiments. The ablation study only evaluates the contribution of each component by removing individual loss terms, which is insufficient to verify whether combining the two components provides additional benefits.
-
The paper lacks parameter sensitivity analysis, convergence analysis, and feature visualization on additional datasets, making it difficult to fully demonstrate the effectiveness of the proposed method across different datasets.
Questions for authors
-
The proposed diffusion module does not explicitly use prototype information for conditional guidance, but instead establishes an indirect connection through shared latent representations. What unique advantages does this design offer compared with conventional latent diffusion regularization?
-
The paper lacks sufficient experiments to demonstrate the actual runtime, GPU memory consumption, and scalability trends of the proposed method on larger datasets. It is recommended that the authors provide a clearer complexity analysis and conduct experiments on larger-scale datasets.
-
The authors do not report the standard deviations across different runs or conduct statistical significance tests. For example, on the LandUse-21 dataset under the 0.7 missing-rate setting, the NMI is 29.37, while COMP achieves 29.11. Without variance information, it is difficult to determine whether the reported performance difference is statistically significant.
4 comments
Dear Reviewer pwBF ,
Thank you for your time and effort in reviewing our paper. Your comments have been valuable in helping us improve its quality.
As the author–reviewer discussion period is scheduled to end in approximately two days, we kindly encourage you to review our rebuttal and let us know whether your concerns have been adequately addressed.
Thank you again for your time and consideration.
Best regards, The Authors
Thank you for providing the additional experiments and analyses. However, the authors' current response does not directly address several key issues raised in my Weaknesses, particularly the methodological novelty and the effectiveness of prototype alignment. Therefore, although I acknowledge the improvements made by the authors, I believe that the paper still has shortcomings.
Thank you for your further assessment. We would like to further elaborate on these two aspects.
1. Methodological Novelty
The methodological contribution of DPD lies in their complementary integration into a multi-level representation learning framework for incomplete multi-view clustering.
Specifically, paired-sample InfoNCE establishes instance-level correspondence between available cross-view pairs, whereas Proto-MMD introduces shared learnable prototypes as global distributional anchors, aligning view-specific latent distributions toward a common prototype distribution. This provides a complementary global constraint beyond pairwise instance alignment. Furthermore, random-timestep latent diffusion regularizes local variations in the same prototype-aligned latent space through noise prediction. Importantly, the prototypes are not explicitly injected into the denoising networks; instead, prototype alignment and diffusion regularization jointly optimize the shared latent representations through the encoders. At the clustering stage, the same prototypes are further employed to enhance available-view representations through prototype cross-attention and mask-aware aggregation.
Therefore, the contribution is not simply the combination of independent modules, but a multi-level learning strategy that integrates instance-level correspondence, prototype-guided global distribution alignment, and latent distribution regularization, followed by prototype-aware fusion for incomplete-view representation construction.
2. Effectiveness of Prototype Alignment
We further clarify the specific role of Proto-MMD. Unlike instance-level InfoNCE, which relies on paired observations to establish sample-wise correspondence, Proto-MMD aligns the latent distributions of different views toward a shared learnable prototype distribution. It thus provides a global structural constraint that complements instance-level supervision.
To isolate its contribution, our ablation study removes only the Proto-MMD objective while retaining the learnable prototypes and prototype-based fusion module. On Hdigit at a missing rate of 0.5, removing Proto-MMD decreases ACC/NMI/ARI from 97.71/93.68/94.97 to 95.78/90.39/90.88, respectively. This corresponds to consistent improvements of 1.93, 3.29, and 4.09 percentage points when prototype alignment is incorporated.
Furthermore, our additional factorized ablation on Hdigit and LandUse-21 demonstrates that Proto-MMD consistently improves clustering performance under different denoising configurations. For example, when random-timestep diffusion is employed, incorporating Proto-MMD increases ACC from 95.78% to 97.71% on Hdigit and from 24.41% to 27.90% on LandUse-21.
These results demonstrate that prototype alignment provides a measurable and complementary contribution to the overall framework. We have further clarified the distinction between instance-level alignment and distribution-level prototype alignment, as well as the interaction between prototype alignment and latent diffusion regularization, in our revised explanation.
We sincerely appreciate the reviewer's comments, which have helped us better articulate the methodological motivation and the individual contributions of the proposed framework.
Q1. Advantages of implicit prototype-diffusion coupling
Thank you for the question. Implicit coupling lets shared prototypes directly constrain the final clustering representations while keeping the denoiser simple.
Compared with standalone latent diffusion regularization, standard view-wise noise prediction denoises each latent distribution but does not itself require both views to align with a common distribution. View-specific distribution differences can therefore remain after denoising. DPD aligns both views with shared prototypes (Eq. 12) and denoises these representations (Eqs. 15-16), so distribution alignment and denoising jointly shape the clustering space.
Why implicit rather than explicit prototype conditioning? Conditioning on a selected prototype requires estimating sample-prototype associations. Early inaccuracies can enter noise prediction directly. Soft attention over all prototypes reduces dependence on a single assignment but requires condition construction and injection. DPD places the prototype constraint in distribution alignment, while the denoiser receives only noisy latents and timesteps. This retains a common distribution reference without sample-prototype selection or extra conditioning operations during denoising.
Proto-MMD updates shared prototypes and view encoders, changing clean representations and their noisy training distributions. After warm-up, diffusion loss also backpropagates through the same encoders. Prototype information thus influences denoising through the learned latent space, placing cross-view distribution constraints directly on the final clustering representations.
Q2. Complexity, runtime, GPU memory, and scalability
Thank you for raising these concerns. We provide a complexity analysis and measured runtime and GPU memory usage.
Let B, d, and K denote batch size, latent dimension, and prototype count. With fixed network architectures and a fixed number of kernel scales, per-batch InfoNCE costs O(B2d) and Proto-MMD costs O((B+K)2d). Encoding, reconstruction, and noise prediction scale linearly with batch size. Diffusion training samples one timestep per latent representation and performs one noise prediction. With fixed batch size, model configuration, and epochs, training costs O(Nc), where Nc is the number of complete pairs. Clustering costs O(N) with fixed model, cluster count, and K-means iterations, where N is the total sample count. Since complete pairs form a subset of all samples, overall time complexity under these fixed settings is O(N).
We performed five runs on Hdigit (MR=0.5) and LandUse-21 (MR=0.7), measuring total training-plus-evaluation time and peak GPU allocated and reserved memory. Values are means ± sample standard deviations.
These measurements quantify resource requirements under the tested settings and show stable memory usage across runs. Table 1 already includes Hdigit (10,000 samples) and NoisyMNIST (50,000 samples), relatively large benchmarks in this field. Following your suggestion, we will evaluate performance at larger sample sizes in future work.
Analyses already in the submitted manuscript. Parameter sensitivity is presented in Fig. 3 and Sec. 3.3.1; convergence in Fig. 5 and Sec. 3.3.3; and feature visualization in Fig. 4 and Sec. 3.3.2. Thus, all three analyses mentioned in the review are already provided and discussed.
Q3. Variation across runs
Thank you for highlighting run-to-run variation. The original main table reports mean results. Related work also uses single-value main-table entries, e.g., Incomplete Multi-view Clustering via Hierarchical Semantic Alignment and Cooperative Completion (NeurIPS 2025). To address your concern, we performed five additional runs on each of Hdigit (MR=0.5) and LandUse-21 (MR=0.7), reporting means ± sample standard deviations.
These results quantify run-to-run variation under both settings.