Str-GCL: Structural Commonsense Driven Graph Contrastive Learning
Abstract
Graph Contrastive Learning (GCL) is a widely adopted approach in self-supervised graph representation learning, applying contrastive objectives to produce effective representations. However, current GCL methods primarily focus on capturing implicit semantic relationships, often overlooking the structural commonsense embedded within the graph’s structure and attributes, which contains underlying knowledge crucial for effective representation learning. Due to the lack of explicit information and clear guidance in general graph, identifying and integrating such structural commonsense in GCL poses a significant challenge. To address this gap, we propose a novel framework called Structural Commonsense Unveiling in Graph Contrastive Learning (Str-GCL). Str-GCL leverages first-order logic rules to represent structural commonsense and explicitly integrates them into the GCL framework. It introduces topological and attribute-based rules without altering the original graph and employs a representation alignment mechanism to guide the encoder in effectively capturing this commonsense. To the best of our knowledge, this is the first attempt to directly incorporate structural commonsense into GCL. Extensive experiments demonstrate that Str-GCL outperforms existing GCL methods, providing a new perspective on leveraging structural commonsense in graph representation learning.
Benchmark Results
Tested on 2 datasets 18 baseline values reported too low
Tables show presented results in global context (best 3 papers + GCN + MLP).
Classic
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | GraphTARIF | 0.9703
±0.0019 | |
| 2 | GAT | 0.9669
±0.0014 | |
| 3 | GAT+T | 0.9660
±0.0007 | |
| 7 | SAGE | 0.9643
±0.0027 | |
| 105 | Str-GCL | 0.9390
±0.0026 | This paper |
| 113 | ProGCL | 0.9381
±0.0048 best reported | best at pub: Architecture Matters: Uncovering Implicit Mechanisms in Graph Contrastive Learning (NeurIPS 2023) |
| 172 | BGRL | 0.9337
±0.0021 best reported | best at pub: Wiener Graph Deconvolutional Network Improves Graph Self-Supervised Learning (AAAI 2022) |
| 184 | Supervised GCN | 0.9328
±0.0003 best reported | best at pub: Perfect Alignment May be Poisonous to Graph Contrastive Learning (ICML 2023) |
| 186 | CCA-SSG | 0.9325
±0.0021 best reported | best at pub: Wiener Graph Deconvolutional Network Improves Graph Self-Supervised Learning (AAAI 2022) |
| 188 | Local-GCL | 0.9325
±0.0040 best reported | best at pub: Localized Graph Contrastive Learning (2022) |
| 191 | GCA | 0.9320
±0.0060 best reported | best at pub: Unifying Graph Contrastive Learning with Flexible Contextual Scopes (2022) best today: Decoupling Weighing and Selecting for Integrating Multiple Graph Pre-training Tasks (ICLR 2024) |
| 202 | PiGCL | 0.9314
±0.0030 | This paper |
| 203 | GRACE | 0.9313
±0.0017 best reported | best at pub: Learning Graph Augmentations to Learn Graph Representations (2022) best today: Learn Beneficial Noise as Graph Augmentation (ICML 2025) |
| 206 | MVGRL | 0.9310
±0.0040 best reported | best at pub: Decoupling Weighing and Selecting for Integrating Multiple Graph Pre-training Tasks (ICLR 2024) |
| 213 | DGI | 0.9309
±0.0008 best reported | |
| 222 | HomoGCL | 0.9300
±0.0020 best reported | best at pub: Multiplex Graph Contrastive Learning with Soft Negatives (2024) |
| 235 | GBT | 0.9282
±0.0040 | prev best: Spectral Augmentation for Self-Supervised Learning on Graphs (ICLR 2022) Improvement within reported uncertainty; not highlighted. |
| 390 | MLP | 0.9128
±0.0063 | |
| 444 | DeepWalk | 0.9005
±0.0008 best reported | best at pub: Barlow Graph Auto-Encoder for Unsupervised Network Embedding (2021) |
| 446 | DeepWalk + features | 0.9005 | This paper |
| 457 | Node2Vec | 0.8970
±0.0010 best reported | best at pub: Learning Graph Augmentations to Learn Graph Representations (2022) best today: Multiplex Graph Contrastive Learning with Soft Negatives (2024) Difference within reported uncertainty; not counted as underperformance. |
| 531 | Raw features | 0.7999
±0.0090 best reported | best at pub: Graph Contrastive Learning with Adaptive Augmentation (WWW 2020) best today: Model-Driven Graph Contrastive Learning (2025) |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | GraphTARIF | 0.9461
±0.0017 | |
| 2 | GCN | 0.9412
±0.0008 | |
| 3 | GAT | 0.9398
±0.0022 | |
| 8 | SAGE | 0.9351
±0.0006 | |
| 79 | BGRL | 0.9034
±0.0019 best reported | best at pub: Spectral Augmentation for Self-Supervised Learning on Graphs (ICLR 2022) best today: Adaptive Negative Scheduling for Graph Contrastive Learning (2026) |
| 86 | Str-GCL | 0.9019
±0.0016 | This paper |
| 135 | ProGCL | 0.8955
±0.0016 best reported | best at pub: Bootstrap Latents of Nodes and Neighbors for Graph Self-Supervised Learning (2024) best today: Adaptive Negative Scheduling for Graph Contrastive Learning (2026) |
| 138 | Local-GCL | 0.8954
±0.0032 | This paper |
| 139 | GRACE | 0.8953
±0.0035 best reported | best at pub: Spectral Augmentation for Self-Supervised Learning on Graphs (ICLR 2022) best today: Adaptive Negative Scheduling for Graph Contrastive Learning (2026) |
| 149 | PiGCL | 0.8925
±0.0027 | This paper |
| 157 | HomoGCL | 0.8900
±0.0010 best reported | best at pub: Multiplex Graph Contrastive Learning with Soft Negatives (2024) Difference within reported uncertainty; not counted as underperformance. |
| 159 | CCA-SSG | 0.8896
±0.0013 | prev best: Balancing Graph Embedding Smoothness in Self-Supervised Learning via Information-Theoretic Decomposition (WWW 2025) Improvement within reported uncertainty; not highlighted. |
| 160 | GCA | 0.8894
±0.0015 best reported | best at pub: Barlow Graph Auto-Encoder for Unsupervised Network Embedding (2021) best today: Adaptive Negative Scheduling for Graph Contrastive Learning (2026) |
| 165 | GBT | 0.8885
±0.0025 | prev best: Rethinking and Scaling Up Graph Contrastive Learning: An Extremely Efficient Approach with Group Discrimination (NeurIPS 2022) Improvement within reported uncertainty; not highlighted. |
| 179 | MVGRL | 0.8861
±0.0064 best reported | |
| 205 | Supervised GCN | 0.8811
±0.0014 best reported | best at pub: Perfect Alignment May be Poisonous to Graph Contrastive Learning (ICML 2023) |
| 210 | DGI | 0.8798
±0.0081 best reported | best at pub: Bootstrap Latents of Nodes and Neighbors for Graph Self-Supervised Learning (2024) Difference within reported uncertainty; not counted as underperformance. |
| 278 | DeepWalk | 0.8628
±0.0007 best reported | best at pub: Barlow Graph Auto-Encoder for Unsupervised Network Embedding (2021) |
| 281 | DeepWalk + features | 0.8628 | This paper |
| 320 | MLP | 0.8463 | |
| 330 | Node2Vec | 0.8440
±0.0010 best reported | best at pub: Unifying Graph Contrastive Learning with Flexible Contextual Scopes (2022) best today: Multiplex Graph Contrastive Learning with Soft Negatives (2024) Difference within reported uncertainty; not counted as underperformance. |
| 456 | Raw features | 0.7381 | This paper |
