- Rating
- 3
- Confidence
- 4
- Informativeness
- 3
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper proposes ReCAP for incomplete and noisy multi-view clustering. Mutual-nearest-neighbor contrastive learning stabilizes view-specific embeddings and prototypes. Sample-mediated transitions then carry probability between prototype sets and back, with a cyclic-return loss and a marginal visitation regularizer. The paper establishes a finite-loss bound on cyclic returnability and characterizes reciprocal permutations in the zero-loss limit. Experiments cover six datasets, nine baselines, separate and compound degradation, and several ablations.
Critical strengths
S1: The paper first aggregates representations through mutual nearest-neighbor contrastive learning and then gradually introduces prototype calibration. This design provides more stable representations before enforcing cross-view correspondences, reducing the risk of reinforcing unreliable prototype matches during early training. S2: The paper derives a finite-loss bound on cyclic returnability and shows that zero-loss limiting transitions form mutually inverse permutations. This analysis explains how the return objective encourages reciprocal one-to-one correspondence and gives the proposed calibration mechanism a precise structural interpretation. S3: The paper compares sample-mediated calibration with direct prototype cycles and replaces the alignment objective while retaining the other components. These controlled experiments help isolate the contribution of the proposed transition path and calibration objective, providing more direct support than overall clustering comparisons alone.
Critical weaknesses
W1. The methodological increment over prototypical random walks needs sharper articulation. ReCAP introduces distinct view-specific prototype sets and reciprocal effective transitions, which may be valuable, but their specific benefit should be separated from the inherited objective. W2. Some important evaluation and implementation details remain underspecified. CPAS combines raw similarity entropy with transitions reconstructed using ReCAP's definition; these quantities may differ from a baseline's actual matching rule. W3.The paper also does not clearly explain how the learned view-specific assignments produce one final partition when observed views differ across samples.
Questions for authors
Q1. What is the precise increment over Prototypical Random Walk Networks (Ayyad et al., 2021), beyond adapting the walk to distinct view-specific prototype sets?
Q2. How are view-specific prototypes or assignments converted into a single consensus label for each sample, particularly under fully incomplete two-view data?
4 comments
Response to Reviewer aJiG(2/2)
Concern 2. Clarification of Evaluation Metrics and Implementation Details (W2)
Thank you for the suggestion. CPAS uses a unified post-hoc protocol to assess the structure and semantic properties of prototypes learned by different methods under the same evaluation operator. Reconstructing transitions is part of this diagnostic protocol; each method retains its own training and matching mechanisms. Similarity-based entropy measures the concentration of prototype affinities, while transition-based metrics assess reciprocity and semantic consistency.
To complement CPAS, we additionally report semantic matching accuracy (SMA), which measures the semantic correctness of cross-view prototype correspondences, and class coverage rate (CCR), which measures the classes represented by the prototype set. Their definitions have been added to Appendix I. The correspondence rules used for each method and the supplementary results are reported below.
| Dataset | Method | SMA (%) | CCR (%) |
|---|---|---|---|
| CUB | CPMN | 10.00 ± 10.95 | 92.00 ± 4.00 |
| CUB | ProImp | 86.00 ± 23.32 | 97.00 ± 4.00 |
| CUB | CPSPAN | 10.00 ± 3.16 | 80.00 ± 3.16 |
| CUB | Ours | 97.00 ± 4.00 | 99.00 ± 2.00 |
| Caltech5V | CPSPAN | 14.10 ± 3.84 | 86.29 ± 5.24 |
| Caltech5V | Ours | 85.00 ± 4.00 | 98.00 ± 1.00 |
Note. For CPMN and ProImp, SMA is computed using each method’s native prototype matching rule, and CCR uses its corresponding sample-to-prototype assignments. For CPSPAN, SMA and CCR are computed using the shared post-hoc evaluation protocol.
Among the methods shown, ReCAP achieves the highest mean SMA and CCR on both datasets. On CUB, ReCAP achieves 97% SMA and 99% CCR, compared with 86% and 97% for ProImp. On Caltech5V, ReCAP achieves 85% SMA and 98% CCR, compared with 14.10% and 86.29% for CPSPAN.
Concern 3. Unified Cluster Assignment under Missing Views (W3 & Q2)
We thank the reviewer for the constructive suggestion. We clarify that view-specific prototypes and their soft assignments are used for representation learning during training. The final partition is obtained by global clustering of the learned representations, without merging view-specific prototype indices or soft assignments.
After training, we compute the mask-normalized mean of the observed view representations for each sample:
Here, indicates whether view is observed for sample . We apply a single -means model to all fused embeddings, using the benchmark class count for .
In the fully unpaired two-view setting, each sample has only one observed view, so its fused representation equals the corresponding view embedding. All embeddings from both views are clustered jointly to obtain a unified partition, without requiring paired observations or post-hoc alignment of view-specific prototype indices.
The author's response has resolved my issue, but I will keep my rating as it is.
We are pleased that our responses have addressed your concerns. Once again, we appreciate your positive evaluation!
Response to Reviewer aJiG(1/2)
We thank the reviewer for the positive assessment and constructive feedback. We appreciate your recognition of our progressive learning strategy, theoretical foundations of prototype calibration, and experimental contributions. Below, we address the methodological novelty of cross-view prototype calibration, the evaluation details of CPAS, and the procedure for obtaining unified clustering assignments. Changes in the revised manuscript are highlighted in blue.
We clarify ReCAP’s contribution relative to PRWN as follows. ReCAP inherits the principles of prototype return and visitation regularization. Its main contribution is cross-view prototype correspondence calibration through the composition of two sample-mediated effective transitions.
PRWN uses prototype–sample–prototype return walks to promote compact, well-separated representations. ReCAP instead constructs two effective maps between view-specific prototype sets, A:Pv→Pu and B:Pu→Pv and optimizes the return probabilities of AB and BA. Each complete cycle therefore traverses both prototype sets. The return objective couples the two cross-view maps and constrains their composed correspondence structure, without requiring predefined prototype-index correspondences across views. This is the main structural contribution beyond introducing separate prototype sets. Two accompanying designs adapt this mechanism to cross-view calibration. First, we optimize returns from both views to treat the starting directions symmetrically during finite-loss training. Second, we regularize the returned-prototype marginal, whereas PRWN regularizes sample visitation. The regularization target thus shifts from sample coverage to prototype-level return distributions. Appendices B and C provide a finite-loss bound on cyclic returnability and characterize reciprocal permutation structure in the zero-loss limit. Appendix D further connects structural and semantic consistency: when the return probabilities of semantically incorrect correspondences satisfy the stated upper bound, the lower bound on semantically consistent probability mass is non-decreasing as the cyclic loss decreases.
We assess these designs through controlled ablations within the same ReCAP framework: ①PRW_CrossView vs CrossView_SampleVisit: compare the walk structures while retaining sample-visitation regularization. ②CrossView_SampleVisit vs Full_PCC: compare visitation targets while retaining the same cross-view cycle.
The experiment is conducted in an incomplete scenario with a missingness rate of 0.5. All other training components and experimental settings are held fixed.( For the full experiment, see Table 13 of Appendix L. )
With sample-level visitation, CrossView_SampleVisit improves mean ACC over PRW_CrossView by 3.79 points on Caltech5V and 0.90 points on CUB, while SCR and CPAS decrease. With the cycle fixed, prototype-level visitation improves both SCR and CPAS on both datasets.