- Rating
- 3
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
The paper addresses unreliable information exchange and self-containing consensus supervision in multi-view clustering by proposing a framework with utility-aware interaction and target-excluding supervision. Guided by interaction utility and non-triviality, the framework enables utility-aware adaptive information exchange by jointly modeling semantic reliability, structural compatibility, and feature complementarity.
Critical strengths
-
The paper examines whether cross-view interaction is beneficial and whether consensus supervision introduces self-information shortcuts, offering a meaningful perspective on multi-view fusion.
-
Utility assessment, the interaction matrix, feature retention gates, and multi-granularity structural constraints are connected through a clear logical progression.
Critical weaknesses
-
The paper should explicitly discuss the applicability of the framework to two-view settings.
-
Although the related work covers a broad range of methods, the authors should clarify the specific differences between their approach and conventional attention-based and gated fusion methods.
-
Since interaction utility and view importance depend on batch statistics, the authors should clarify how weights are computed during training and inference, and how weight consistency is maintained when extracting representations for the entire dataset.
Questions for authors
- Is reconstruction performed by decoding the original latent representations or the enhanced representations after cross-view interaction? How does this choice affect the preservation of view-specific information?
- What initialization and repeated-run strategies are used for the final k-means clustering? Do the reported results account for randomness in both network training and k-means initialization?
- How are implementation details, such as the softmax dimension, feature normalization, and the number of Sinkhorn iterations, specified?
Thanks for your careful review. We are glad to address your questions one by one.
W1: JCVI is applicable to two-view settings, as its core mechanisms, including utility-aware cross-view interaction, target-exclusive supervision, and multi-granularity structural regularization, can still be implemented with two views. In this case, each target view receives information exclusively from the other view, and the target-exclusive context is directly constructed from that remaining view. Although the adaptive selection among multiple source views becomes unnecessary, the pairwise interaction mechanism and feature-wise gating still regulate cross-view information integration, while the structural constraints continue to promote semantic consistency.
W2: Unlike conventional attention-based fusion, which primarily assigns importance weights to different views, JCVI explicitly evaluates the utility of each cross-view interaction by jointly considering semantic reliability, structural compatibility, and feature complementarity. Compared with conventional gated fusion, which mainly regulates feature contributions during aggregation, JCVI further introduces an interaction non-triviality mechanism through target-exclusive supervision, preventing the direct inclusion of target-view information in its own supervisory context. Moreover, pairwise- and neighborhood-level structural regularization further preserves semantic consistency at different granularities. Therefore, JCVI goes beyond conventional importance-based weighting or feature-level gating by explicitly addressing both the usefulness and non-triviality of cross-view interactions.
W3: In JCVI, the interaction utilities and corresponding weights are computed dynamically within each mini-batch based on the current batch's view-specific representations. Specifically, semantic reliability, structural compatibility, and feature complementarity are evaluated to construct the interaction matrix through Sinkhorn normalization. During inference, the trained network parameters are kept fixed, while the interaction weights are dynamically computed for each mini-batch using the same procedure. To obtain representations for the entire dataset, we process the samples in mini-batches and concatenate their corresponding outputs in the original sample order. Although the interaction weights may vary across batches due to differences in batch statistics, the consistent computation procedure and fixed inference configuration ensure a well-defined representation extraction process.
Q1: In JCVI, reconstruction is performed using the original view-specific latent representations Z(v), rather than the enhanced representations Z^(v) after cross-view interaction. This design is intentional, as it allows each view-specific autoencoder to preserve the fundamental characteristics and information distribution of its original input without relying excessively on information from other views. Meanwhile, the enhanced representations are optimized through the cross-view interaction and contrastive objectives to promote complementary information integration and semantic consistency. Therefore, the reconstruction objective and cross-view learning objectives play complementary roles: the former preserves view-specific information, while the latter facilitates cross-view semantic enhancement. This separation also helps prevent excessive cross-view fusion from compromising the distinctive information of individual views.
Q2: In our experiments, JCVI is independently trained five times to account for the randomness introduced by network initialization and stochastic optimization. After each training run, standard K-means is applied to the learned comprehensive representation H to obtain the final clustering assignments. Therefore, the reported results are averaged over five independent runs, accounting for the variability in network training.
Q3: For the cluster-assignment matrix Q(v)∈RB×K, softmax is applied over the cluster dimension (dim=1), while the sample-similarity matrix S(v)∈RB×B is normalized row-wise (dim=1). View-level weights are normalized across views (dim=0). Sample representations and cluster prototypes are L2-normalized along the feature dimension (p=2, dim=1) for similarity computation and contrastive learning, while reconstruction uses unnormalized encoder features. LayerNorm follows gated fusion, and the final global and contrastive representations are L2-normalized. For Sinkhorn-Knopp, we mask diagonal entries, construct the kernel as exp(U/τs) with τs=0.2, and perform five rounds of alternating row-column normalization using ϵ=10−8. All settings are consistent across datasets.