acceptodds
Under review as a conference paper at ICLR 2027

Leveraging Structure–Attribute Mixed-View Augmentation for Improved Graph Contrastive Learning

Abstract

Graph Contrastive Learning (GCL) offers a promising self-supervised paradigm for learning node representations, but existing methods typically rely on heuristic augmentations that perturb topology or attributes in isolation, often introducing semantic drift that degrades representation quality. We identify semantic preservation as a key but overlooked property of graph augmentation, and propose SAMA (Structure-Attribute Mixed-View Augmentation), a principled augmentation framework that jointly models structural connections and node attributes. SAMA integrates deep non-negative matrix factorization with spectral feature filtering to generate multiple semantically aligned augmented views, and adopts a two-stage training scheme of semantic-aware augmentation followed by multi-view contrastive learning. Extensive experiments on six benchmark datasets demonstrate that SAMA consistently outperforms thirteen state-of-the-art baselines in node classification, achieving improvements of up to 3.0 percentage points while maintaining strong performance under extreme label scarcity. These results highlight semantic-preserving augmentation as a representation learning insight for self-supervised graph learning.

Primary area:
learning on graphs and other geometries & topologies
Keywords:
Graph Contrastive Learning, Graph neural networks, Graph Data Augmentation

Reviews

Among:
Shape:
1234this paper, Bottom 10%
Figure 1. Mean review rating of the reviewed papers at ICLR 2027. This paper averages 1.67 over 3 reviews, above 10% of the others.
Reviewer_hfYDOpenReview ↗
Rating
1
Confidence
4
Informativeness
2
Presentation
2
Soundness
1
Read review
Paper summary

This paper proposes SAMA, a graph contrastive learning framework that jointly considers graph structure and node attributes during data augmentation. The method combines deep non-negative matrix factorization (DNMF) and spectral feature filtering to construct multiple augmented graph views, followed by contrastive representation learning. Experiments on six benchmark datasets demonstrate improvements in node classification over sixteen baseline methods.

Critical strengths

S1. Comprehensive experimental comparisons. The authors evaluate SAMA on six widely used graph datasets and compare it against sixteen baselines, including several representative graph contrastive learning methods. The reported results consistently outperform the compared approaches.

S2. Component-level analysis. The paper provides ablation experiments investigating the contributions of structural information, attribute information, and regularization. The results demonstrate that combining these components improves downstream performance.

Critical weaknesses

W1. Limited methodological novelty compared with existing graph contrastive learning approaches.

The proposed framework primarily combines existing techniques, including DNMF, spectral feature filtering, and InfoNCE-based contrastive learning. The idea of jointly preserving structural and attribute information has already been investigated in previous studies, such as ASP (AAAI 2023), which is also included as a baseline. The paper does not sufficiently explain the fundamental methodological differences between SAMA and these closely related approaches. Consequently, the novelty appears to lie mainly in the integration of existing components rather than a new learning principle.

W2. The theoretical guarantee of semantic preservation is insufficiently justified.

Theorem 1 claims that DNMF guarantees similar latent representations for nodes within the same semantic cluster while separating nodes from different clusters. However, the proof in Appendix C relies on strong block-diagonal assumptions and informal arguments. In particular, the proof assumes that nodes within the same cluster have identical connectivity patterns, which does not generally follow from a block-diagonal adjacency matrix. Moreover, the extension from single-layer NMF to DNMF is asserted without a rigorous derivation. The claimed perturbation stability also lacks explicit conditions and bounds. These issues undermine the validity of the paper's central theoretical contribution.

W3. Potential concerns about label information and experimental fairness.

Section 4.1 specifies that the intermediate representation dimension (r) is set to the number of classes, while the method is evaluated as an unsupervised representation learning approach. Although using the number of classes does not necessarily constitute label leakage, this setting requires clarification regarding whether ground-truth label information is used during model configuration. The authors should explain how (r) is selected when class information is unavailable and whether the same degree of dataset-specific tuning is permitted for competing methods. Sensitivity analysis with label-independent choices of (r) is also necessary.

W4. Incomplete computational complexity analysis and scalability evaluation.

The complexity analysis in Appendix C assumes efficient spectral filtering and negative sampling, but the implementation details do not establish whether these approximations are actually used. In particular, the contrastive objective in Eq. (8) considers all other nodes as negatives, potentially requiring quadratic pairwise similarity computations. Furthermore, the reconstructed adjacency matrices may become dense, substantially increasing memory and computation requirements. The paper provides no empirical runtime, memory consumption, or scalability comparisons with existing methods.

W5. Insufficient evidence that the generated augmentations preserve meaningful graph semantics.

Although semantic preservation is the central motivation, the proposed consistency objective in Eq. (6) measures reconstruction differences using Frobenius norms. Such numerical similarity does not necessarily guarantee preservation of meaningful graph semantics. The experiments focus primarily on downstream node classification accuracy, without directly evaluating semantic consistency, structural preservation, or augmentation diversity. Therefore, it remains unclear whether the improvements arise from semantic preservation or simply from additional structural smoothing and regularization.

Questions for authors

Q1. What are the fundamental methodological differences between SAMA and ASP (AAAI 2023), particularly regarding joint structure-attribute modeling and semantic preservation?

Q2. Can the authors provide a rigorous proof of Theorem 1 under explicitly stated assumptions? In particular, how does the proof extend from single-layer NMF to arbitrary-depth DNMF?

Q3. Why is the intermediate dimension (r) set to the number of classes in an unsupervised learning setting? How does performance change when (r) is selected independently of ground-truth class information?

Q4. Does the implementation explicitly construct dense augmented adjacency matrices and compute all-pairs contrastive similarities? Please report actual runtime and peak GPU memory usage.

Q5. Can the authors directly quantify semantic preservation and augmentation diversity, rather than relying exclusively on downstream classification accuracy?

Reviewer_1y8zOpenReview ↗
Rating
2
Confidence
2
Informativeness
2
Presentation
3
Soundness
2
Read review
Paper summary

This paper proposes SAMA, a semantic-aware augmentation framework for graph contrastive learning. SAMA combines deep non-negative matrix factorization and spectral filtering to iteratively generate structure-attribute augmented views, which are subsequently used for multi-view contrastive learning. Experiments on six node classification benchmarks demonstrate improvements over 16 baselines.

Critical strengths
  • The paper is well-written and easy to follow.
  • The empirical results are strong to show the effectiveness of SAMA.
Critical weaknesses
  • The framework primarily combines existing techniques (DNMF, spectral filtering, and InfoNCE). The technical distinction and novelty are therefore insufficiently established.
  • The latent dimension is explicitly set to the number of ground-truth classes in experiments. This introduces downstream label information into hyperparameter selection, which raises concerns about the validity and practicality of the claimed unsupervised setting.
Questions for authors

Please refer to weaknesses above.

Reviewer_qypTOpenReview ↗
Rating
2
Confidence
4
Informativeness
1
Presentation
2
Soundness
1
Read review
Paper summary

This paper introduce a structure-attribute mixed-view augmentation GCL framework. It employs deep non-negative matrix factorization and spectral filtering to extract latent structural and attribute information, generating multiple augmented views while preserving semantic consistency. A two-stage training strategy first optimizes the augmentation module and then trains a shared GNN encoder through multi-view contrastive learning.

Critical strengths

One of the core issues in graph contrastive learning is the definition of augmented samples.

Critical weaknesses
  1. The paper claims that graph contrastive learning consists of three parts, but in fact, the data augmentation strategy and the definition of the contrastive target are actually the same thing. Because the definition of positive and negative samples is entirely dependent on the data augmentation method.
  2. The lack of novelty and the semantic inconsistency brought about by data augmentation have been discussed in numerous studies. What are the differences between this article and them?
  3. All the illustrations in the paper are blurry and have very low pixels. The readability is extremely poor.
  4. Compared with the outdated baseline, the experiments are not convincing enough. Generally speaking, the performance of Cora is around 84. How does the paper divide the dataset? The experiment was insufficient.
Questions for authors

See above Cons.

From OpenReview, CC BY 4.0. Authors as signed there; shown unedited.

Related papers

Loading the map…

Discussion (0)

Sign in to comment.