- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 1
- Soundness
- 2
Read review
Paper summary
This paper proposes a Target-aware Interventional Graph-structure Decoupling and Retrieval (TIGER) for Incomplete Multi-view Clustering. It first learns view-specific latent representations with the goal to separate transferable and view-dependent information. Then, a retrieval strategy is developed to recover missing views by selecting informative anchors from observed target-view samples according to cross-view structural evidence. Then, an intervention-based completion mechanism is introduced to identify and reduce unreliable local correlations. Experiments on 7 benchmark datasets under 4 missing rates demonstrate the effectiveness of the proposed method.
Critical strengths
The proposed method is compared with the most recent baselines and the results verifies the effectiveness.
Critical weaknesses
-
The method seems quite complicated. The reasons why each formula achieves the desired effect are not explained clearly, or the motivation behand each formula is not well illustrated.
-
The symbol usage is not standardized. Some vectors are represented in bold (), while others are not (,), which increases the difficulty of understanding.
Questions for authors
- For each missing proportion, how many independent repeated experiments were conducted?
- From Figure 7 of the supplementary materials, it seems that the clustering performance remains almost the same under different parameter settings. What could be the reason for this? Is it reasonable?
- How to understand targeted guided retrieval component? Is it necessary for the target view to be complete?
7 comments
Q1. Number of Independent Repeated Runs
Q1: We sincerely appreciate the reviewer’s attention to the experimental reproducibility protocol. Every dataset and every missing-rate setting is evaluated through five independent runs using five different random seeds. These are separate training and evaluation processes, rather than repeated evaluations of a single trained model. The reported results are the arithmetic mean and standard deviation calculated over the five independent runs for each method, dataset, missing rate, and evaluation metric.
For a prescribed missing rate , the observation indicator is generated according to . Each sample-view entry is independently retained with probability and removed with probability . If a sample has no observed views after sampling, one view is randomly restored to ensure that at least one modality remains available. Thus, every sample satisfies , where denotes its observed-view set. This condition ensures that each sample can provide at least one source representation for subsequent learning and retrieval.
The missing mask is independently generated for every run and remains fixed throughout that run. The same mask is used consistently during representation learning, graph construction, target-aware retrieval, pseudo-missing completion training, and final clustering evaluation. In particular, the mask is not regenerated between training epochs or between the retrieval and clustering stages. This protocol ensures that the reported results correspond to a well-defined incomplete-view realization for each independent run.
The five-run protocol is applied separately to every missing rate. In the main experiments, the seven datasets are evaluated at missing rates , , , and . Appendix C.2 additionally evaluates missing rates , , and , using the same five-run protocol. Therefore, the experiments cover seven missing-rate settings in total. For every dataset-rate combination, five independently generated masks and five independently trained models are evaluated.
For each setting, the reported ACC, NMI, and ARI values are calculated as the mean over the five runs, and the corresponding standard deviations are also reported. Table 1 follows this convention for the main comparison, while Table 7 applies the same reporting protocol to the additional missing rates. The ablation and runtime experiments likewise use five independent runs. Therefore, the reported variation reflects differences in random initialization, missing-mask generation, and stochastic optimization across independent experiments.
The independent runs use the same experimental configuration and hyperparameters to ensure a controlled comparison. However, each run has its own random seed and independently sampled observation mask. The missing mask remains unchanged within an individual run, so the standard deviation does not arise from repeatedly changing the observation pattern during a single training process. Instead, it measures the variation across independent realizations of the incomplete multi-view learning problem.
The protocol is specified in Section 4.1 and Appendix B.2. Section 4.1 states the five-run evaluation setting, while Appendix B.2 describes the missing-mask sampling procedure and the condition that every sample retains at least one observed view. The supplementary experiments in Appendix C.2 follow the same protocol, ensuring consistency between the main and additional results.
For completion training, pseudo-missing targets are selected only from originally observed entries. The selected target view is temporarily hidden when the retrieval query and candidate set are constructed, while its original latent representation serves as a self-supervised training target. At inference, pseudo-missing masking is disabled, and only genuinely missing sample-view pairs are completed. Ground-truth cluster labels are not used to generate missing masks, train the completion module, construct retrieval queries, or obtain the final cluster assignments.
Accordingly, the number of independent repeated experiments is five for every missing rate on every dataset. All reported means and standard deviations are calculated from these five independent runs, and the same protocol is maintained throughout the main experiments, supplementary comparisons, and ablation studies.
Q2. Parameter Sensitivity and Stable Clustering Performance
Q2: We thank the reviewer for examining the parameter sensitivity results and the opportunity to explain the stable performance. Figure 7 evaluates the influence of two objective weights, and . The broad high-performing regions show that TIGER does not rely on a narrowly selected combination.
The overall objective is , where denotes reconstruction, denotes graph-structure decoupling, and denotes graph-intervention completion. The weights and balance two complementary objectives. The first aligns neighborhood distributions across jointly observed views and separates stable from private information. The second improves target-view recovery under private-edge interventions and regulates uncertain corrections through retrieval confidence.
Figure 7 in Appendix C.5 presents four datasets, HW, MNIST4, MNIST-Fea, and Synthetic3D, under five missing rates: . This produces twenty parameter-response surfaces, each reporting ACC over the tested combinations of and . The main manuscript also reports results at a missing rate of 0.1. One parameter configuration is shared across datasets.
The two weights do not act as independent switches that determine separate cluster labels. Instead, they scale learning signals within the same representation pipeline. When either coefficient changes moderately, the encoder can still preserve the dominant neighborhood organization while adjusting the contribution of the corresponding objective. As a result, the final partition can remain stable even though the optimization trajectory and latent vectors are not exactly the same. A larger change can move the model beyond this stable region and alter sample assignments, which explains the local variations visible in the response surfaces.
The broad high-performing regions have a direct interpretation. The objectives preserve relational information and improve missing-view recovery. Moderate changes in their weights can alter the relative optimization emphasis without necessarily changing final cluster assignments. Consequently, ACC may remain similar across neighboring configurations even when learned representations and internal objective values differ.
This behavior is reasonable because ACC is computed from discrete clustering assignments, not directly from continuous latent representations. K-means converts embeddings into cluster labels. A parameter change may modify local distances or embedding geometry without changing the final assignment of individual samples. In that case, ACC remains unchanged. Small changes in correct assignments may produce limited percentage differences. Therefore, a relatively flat ACC surface does not imply that the parameters have no influence or that the learned representations are identical.
The surfaces do not indicate that every parameter combination performs equally well. Some regions show visible changes, particularly near the boundaries of high-performing areas. These variations confirm that the coefficients affect the balance between relational alignment and completion. The broad high-performing regions instead indicate that TIGER does not require extremely precise coefficient tuning to maintain good clustering quality. This is useful across datasets with different feature distributions and missingness patterns.
The experiments use the shared configuration and . This avoids dataset-specific choices and provides consistent benchmark comparisons. The sensitivity surfaces show that this configuration lies within a useful high-performing region rather than depending on an isolated optimum. The analysis tests robustness to parameter perturbations.
Appendix C.6 provides complementary convergence evidence. Figure 8 reports training trajectories for Synthetic3D, HW, MNIST4, and ALOI-100 at the same five missing rates. The curves approach stable regions with smaller later fluctuations. Despite lower performance under severe missingness, the trajectories remain stable without persistent oscillations or divergence.
Appendix C.5 also examines neighborhood size and the Smooth L1 transition parameter in Figure 6. The results show relatively stable clustering performance across broad tested ranges at missing rates 0.1 and 0.3. Thus, the analysis also covers neighborhood retrieval and reconstruction parameters.
The revised manuscript presents these results in Figures 6–8 and Appendices C.5–C.6. Together, the experiments show that TIGER maintains strong clustering performance over a useful range of parameter configurations and missing rates. Stable ACC regions are consistent with discrete clustering evaluation and demonstrate practical robustness. Local variations remain visible, indicating that parameters matter but the selected configuration is not excessively sensitive within the tested range.
W1. Explanation of the Methodology and Design Motivation
W1: We thank the reviewer for the careful evaluation and the opportunity to clarify the method's motivation. TIGER sequentially combines representation learning, graph-structure decoupling, target-aware retrieval, confidence estimation, and intervention-based completion.
Equations (1) and (2) establish view-specific representation learning. The encoder maps an observed feature to ziv=Ev(xiv), and the decoder reconstructs it as x^iv=Dv(ziv). This preserves observed information for structural learning. Reconstruction uses observed entries only, and Smooth L1 limits the influence of unusually large residuals.
Equation (3) decomposes each latent representation into stable and private components, siv=Fsv(ziv) and piv=Fpv(ziv). The stable branch captures transferable relational information, whereas the private branch preserves view-dependent characteristics. It supplies complementary representations without forcing different views to share identical coordinates.
Equations (4) and (5) introduce graph-structure decoupling. Equation (4) constructs neighborhood distributions from cosine similarities between stable representations over jointly observed samples, with Ivu=Iv∩Iu. The probability πijvu describes the relative neighborhood importance of sample j for sample i in view v. View u uses the same jointly observed indices, enabling comparison across heterogeneous feature spaces.
Equation (5) combines Jensen-Shannon divergence with stable-private decorrelation. The term JSD(πivu,πiuv) aligns corresponding neighborhood distributions, while ∣cos(siv,piv)∣ discourages redundant information between the two branches. The mixture is mivu=(πivu+πiuv)/2. The divergence is nonnegative and vanishes when the distributions coincide. TIGER therefore aligns neighborhoods, not point-wise features, while retaining view-specific information.
Equations (6) and (7) use stable structure for target-aware retrieval. When view v is missing for sample i, Eq. (6) aggregates stable representations from available source views and normalizes them to form query qiv. The query summarizes cross-view evidence; it is a retrieval descriptor, not an imputed feature. Equation (7) searches the observed target bank Iv and selects the top-k candidates by cosine similarity. Source views determine the query, whereas candidates and their latent codes come from the target view. This keeps retrieval evidence target-specific.
Equations (8) and (9) construct two target anchors. Stable weights αijv aggregate candidate target representations into riv, estimating the missing sample's principal location in the target space. Private weights βijv aggregate candidate private representations into uiv, preserving view-specific variations that stable aggregation may smooth. The anchors provide complementary evidence.
Equation (10) estimates retrieval confidence through normalized entropy, civ=1+∑j∈Aivαijvlog(αijv)/log(k). Concentrated weights produce higher confidence, while diffuse weights indicate ambiguous retrieval evidence. It measures retrieval concentration, not calibrated correctness, and regulates private information.
Equation (11) applies two independent stochastic interventions to private candidate edges while keeping the stable anchor and stable weights fixed. Remaining private weights are renormalized, with at least one candidate retained in each pass. This tests dependence on fragile private relations. Equation (12) predicts the target representation as yiv,t=riv+civGv([riv∥uiv,t]). The stable anchor supplies the target reference, confidence controls the residual, and averaging gives the completed representation.
Equation (13) trains completion with pseudo-missing observations. An originally observed target feature is temporarily hidden, and its original latent representation serves as the self-supervised target. Reconstruction encourages recovery, while consistency constrains predictions across interventions. No cluster labels are required. Finally, Eq. (14) jointly optimizes reconstruction, graph-structure decoupling, and graph-intervention objectives. The compact objective is L=Lrec+λsLs+λgLg, where the two weights balance structural alignment and intervention-based completion within the unified framework.
At inference, intervention predictions are averaged, observed views retain their representations, and completed views receive confidence-dependent weights before normalized fusion and K-means. Thus, reconstruction preserves observations, graph decoupling transfers relations, retrieval identifies target evidence, entropy measures confidence, and interventions improve robustness. The revised method description and Appendix B.5 detail the sequence and implementation.