English

SAIL: Self-Augmented Graph Contrastive Learning

Machine Learning 2021-12-16 v2 Machine Learning

Abstract

This paper studies learning node representations with graph neural networks (GNNs) for unsupervised scenario. Specifically, we derive a theoretical analysis and provide an empirical demonstration about the non-steady performance of GNNs over different graph datasets, when the supervision signals are not appropriately defined. The performance of GNNs depends on both the node feature smoothness and the locality of graph structure. To smooth the discrepancy of node proximity measured by graph topology and node feature, we proposed SAIL - a novel \underline{S}elf-\underline{A}ugmented graph contrast\underline{i}ve \underline{L}earning framework, with two complementary self-distilling regularization modules, \emph{i.e.}, intra- and inter-graph knowledge distillation. We demonstrate the competitive performance of SAIL on a variety of graph applications. Even with a single GNN layer, SAIL has consistently competitive or even better performance on various benchmark datasets, comparing with state-of-the-art baselines.

Keywords

Cite

@article{arxiv.2009.00934,
  title  = {SAIL: Self-Augmented Graph Contrastive Learning},
  author = {Lu Yu and Shichao Pei and Lizhong Ding and Jun Zhou and Longfei Li and Chuxu Zhang and Xiangliang Zhang},
  journal= {arXiv preprint arXiv:2009.00934},
  year   = {2021}
}

Comments

Accepted by AAAI2022, 10 pages, 3 figures

R2 v1 2026-06-23T18:15:46.174Z