mlsanityData to 7 Oct 2026

Rethinking Dimensional Rationale in Graph Contrastive Learning from Causal Perspective

arXiv 2312.10401 ↗First posted 16 Dec 2023cs.LG cs.AIcited by 13

Not on the map. Why?

Abstract (arXiv)

Graph contrastive learning is a general learning paradigm excelling at capturing invariant information from diverse perturbations in graphs. Recent works focus on exploring the structural rationale from graphs, thereby increasing the discriminability of the invariant information. However, such methods may incur in the mis-learning of graph models towards the interpretability of graphs, and thus the learned noisy and task-agnostic information interferes with the prediction of graphs. To this end, with the purpose of exploring the intrinsic rationale of graphs, we accordingly propose to capture the dimensional rationale from graphs, which has not received sufficient attention in the literature. The conducted exploratory experiments attest to the feasibility of the aforementioned roadmap. To elucidate the innate mechanism behind the performance improvement arising from the dimensional rationale, we rethink the dimensional rationale in graph contrastive learning from a causal perspective and further formalize the causality among the variables in the pre-training stage to build the corresponding structural causal model. On the basis of the understanding of the structural causal model, we propose the dimensional rationale-aware graph contrastive learning approach, which introduces a learnable dimensional rationale acquiring network and a redundancy reduction constraint. The learnable dimensional rationale acquiring network is updated by leveraging a bi-level meta-learning technique, and the redundancy reduction constraint disentangles the redundant features through a decorrelation process during learning. Empirically, compared with state-of-the-art methods, our method can yield significant performance boosts on various benchmarks with respect to discriminability and transferability. The code implementation of our method is available at https://github.com/ByronJi/DRGCL.

Key facts. Cited by 13 papers in the map (data through 7 Oct 2026). Builds on 15 of its 28 references that are in the map. First posted on arXiv 16 Dec 2023.

Builds on

15 of 28 references.

References · 15

  1. 2017Graph Attention Networkscited by 8,854
  2. 2016node2vec: Scalable Feature Learning for Networkscited by 1,913
  3. 2020Graph Contrastive Learning with Augmentationscited by 1,203
  4. 2017MoleculeNet: A Benchmark for Molecular Machine Learningcited by 1,037
  5. 2019Strategies for Pre-training Graph Neural Networkscited by 964
  6. 2020TUDataset: A collection of benchmark datasets for learning with graphscited by 718
  7. 2019Self-Attention Graph Poolingcited by 421
  8. 2021Graph Contrastive Learning Automatedcited by 287
  9. 2017graph2vec: Learning Distributed Representations of Graphscited by 228
  10. 2022SimGRACE: A Simple Framework for Graph Contrastive Learning without Data Augmentationcited by 171
  11. 2017Predicting multicellular function through multi-layer tissue networkscited by 138
  12. 2021From Canonical Correlation Analysis to Self-supervised Graph Neural Networkscited by 138
3 more
  1. 2022Chaos is a Ladder: A New Theoretical Understanding of Contrastive Learning via Augmentation Overlapcited by 105
  2. 2022Disentangle and Remerge: Interventional Knowledge Distillation for Few-Shot Object Detection from A Conditional Causal Perspectivecited by 13
  3. 2022Robust Causal Graph Representation Learning against Confounding Effectscited by 12

Built on by

Cited by year

Citing papers per year: 2024: 7; 2025: 6.

13 papers.

Sort: