TL;DR
This paper introduces a novel data-driven approach for self-supervised graph representation learning that automatically learns effective graph augmentations from the graph signals, improving performance across various datasets.
Contribution
It proposes two learnable augmentation methods for features and topology, jointly optimized with the graph representations, applicable to both homogeneous and heterogeneous graphs.
Findings
Outperforms existing SSGRL methods on multiple datasets
Achieves results comparable to semi-supervised approaches
Demonstrates general applicability to different graph types
Abstract
Self-supervised graph representation learning (SSGRL) is a representation learning paradigm used to reduce or avoid manual labeling. An essential part of SSGRL is graph data augmentation. Existing methods usually rely on heuristics commonly identified through trial and error and are effective only within some application domains. Also, it is not clear why one heuristic is better than another. Moreover, recent studies have argued against some techniques (e.g., dropout: that can change the properties of molecular graphs or destroy relevant signals for graph-based document classification tasks). In this study, we propose a novel data-driven SSGRL approach that automatically learns a suitable graph augmentation from the signal encoded in the graph (i.e., the nodes' predictive feature and topological information). We propose two complementary approaches that produce learnable feature and…
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.
