- Rating
- 1
- Confidence
- 4
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
For multi-view graphs, the authors propose to learn node representations via 1) contrastive learning between latent features learned from an original graph view and its masked version; 2) k-means clustering loss on the latent feature aggregated from all views. The paper presents promising evaluation results with an extensive set of baseline methods.
Critical strengths
None
Critical weaknesses
- The third paragraph of the introduction section claims that PID, or the three types of information, is used to "further illustrate and interpret the interaction between different views". However, in the formulation of the L_1 and L_2 loss functions, the contrast is only between the learned features H_i of view i and two sets of learned features H_i' and H_i'' of two masked versions of view i. All the contrastive comparisons are between representations of the same view, without any cross-view interaction.
- The proof of Theorem 1 in appendix doesn't seem to establish .
- Section 4.1 mentions data flow "X-> X'->H_\theta" and "H_\theta'->X->H_\theta'" without justification.
- Section 4.2 simply mentions "GNNs as basic encoders" without explaining the model actually used.
- Essentially, the proposed method uses InfoNCE (an earlier reference for this approach should be cited instead of the 2026 paper) to contrast View i's learned features against those learned from its masked version, and a clustering loss using weighted aggregation of single-view features. The contrastive learning part has highly similar precedents, such as "A Two-View Hierarchical Contrastive Learning-Driven Method for Community Detection" (2026, Eq 19-22), and "Graph Contrastive Learning with Adaptive Augmentation" (2020). The clustering loss has also been seen in previous work such as "Homophily-Related: Adaptive Hybrid Graph Filter for Multi-View Graph Clustering" (2024).
- The evaluation includes a task where clustering is done on graphs. It's unclear how this is related to the multi-view graph setting of this paper.
Questions for authors
- How does the use of PID in this paper address "possible alternatives of the relationship between different views"?
- How is "data flow" defined, and how are these two flows in Section 4.1 derived?