Features Based Adaptive Augmentation for Graph Contrastive Learning

Adnan Ali, Jinlong Li
7/5/2022
cs.LGcs.AI

No confident code implementation found for this paper.

Abstract

Self-Supervised learning aims to eliminate the need for expensive annotation in graph representation learning, where graph contrastive learning (GCL) is trained with the self-supervision signals containing data-data pairs. These data-data pairs are generated with augmentation employing stochastic functions on the original graph. We argue that some features can be more critical than others depending on the downstream task, and applying stochastic function uniformly, will vandalize the influential features, leading to diminished accuracy. To fix this issue, we introduce a Feature Based Adaptive Augmentation (FebAA) approach, which identifies and preserves potentially influential features and corrupts the remaining ones. We implement FebAA as plug and play layer and use it with state-of-the-art Deep Graph Contrastive Learning (GRACE) and Bootstrapped Graph Latents (BGRL). We successfully improved the accuracy of GRACE and BGRL on eight graph representation learning's benchmark datasets.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{ali2022features,
  title  = {Features Based Adaptive Augmentation for Graph Contrastive Learning},
  author = {Adnan Ali and Jinlong Li},
  year   = {2022},
  eprint = {2207.01792},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2207.01792v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2207.01792.svg)](https://codeofpaper.com/paper/2207.01792)

Discussion