TL;DR
This paper introduces RGRL, a novel self-supervised graph learning method that leverages relational invariance within graphs to improve node representations, outperforming existing methods across multiple benchmarks.
Contribution
RGRL is the first to explicitly incorporate relational invariance in self-supervised graph learning, addressing limitations of prior contrastive and non-contrastive approaches.
Findings
RGRL outperforms state-of-the-art methods on 14 benchmark datasets.
Relational invariance improves robustness of node representations.
Global and local relationship perspectives enhance learning effectiveness.
Abstract
Over the past few years, graph representation learning (GRL) has been a powerful strategy for analyzing graph-structured data. Recently, GRL methods have shown promising results by adopting self-supervised learning methods developed for learning representations of images. Despite their success, existing GRL methods tend to overlook an inherent distinction between images and graphs, i.e., images are assumed to be independently and identically distributed, whereas graphs exhibit relational information among data instances, i.e., nodes. To fully benefit from the relational information inherent in the graph-structured data, we propose a novel GRL method, called RGRL, that learns from the relational information generated from the graph itself. RGRL learns node representations such that the relationship among nodes is invariant to augmentations, i.e., augmentation-invariant relationship,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
