Features Based Adaptive Augmentation for Graph Contrastive Learning
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 21 of its 26 references that are in the map. First posted on arXiv 5 Jul 2022.
Builds on
21 of 26 references.
References · 21
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
- 2019A Comprehensive Survey on Graph Neural Networkscited by 2,906
- 2019Fast Graph Representation Learning with PyTorch Geometriccited by 2,414
- 2020Graph Contrastive Learning with Augmentationscited by 1,203
- 2018Deep Graph Infomaxcited by 1,101
- 2020Contrastive Multi-View Representation Learning on Graphscited by 651
- 2020Deep Graph Contrastive Representation Learningcited by 535
- 2020Graph Contrastive Learning with Adaptive Augmentationcited by 519
- 2020GCC: Graph Contrastive Coding for Graph Neural Network Pre-Trainingcited by 461
- 2017Representation Learning on Graphs: Methods and Applicationscited by 456
- 2021Large-Scale Representation Learning on Graphs via Bootstrappingcited by 184
- 2021Self-Supervised Learning of Graph Neural Networks: A Unified Reviewcited by 184
9 more
- 2021Generative Causal Explanations for Graph Neural Networkscited by 124
- 2021An Empirical Study of Graph Contrastive Learningcited by 113
- 2020Transfer Learning of Graph Neural Networks with Ego-graph Information Maximizationcited by 93
- 2020Sub-graph Contrast for Scalable Self-Supervised Graph Representation Learningcited by 90
- 2021HDMI: High-order Deep Multiplex Infomaxcited by 82
- 2020Contrastive Self-supervised Learning for Graph Classificationcited by 68
- 2020Bipartite Graph Embedding via Mutual Information Maximizationcited by 29
- 2021Self-supervised Graph Neural Networks without explicit negative samplingcited by 25
- 2020Iterative Graph Self-Distillationcited by 21
Built on by
Citing papers per year: 2024: 1; 2025: 2; 2026: 1.
4 papers.
- 2024From Overfitting to Robustness: Quantity, Quality, and Variety Oriented Negative Sample Selection in Graph Contrastive Learningcited by 4
- 2025A Binary Classification Social Network Dataset for Graph Machine Learningcited by 1
- 2025Attributed Graph Clustering with Multi-Scale Weight-Based Pairwise Coarsening and Contrastive Learningcited by 0
- 2026Adaptive Negative Scheduling for Graph Contrastive Learningcited by 0
- 2026Adaptive Negative Scheduling for Graph Contrastive Learning4 May 2026
- 2025Attributed Graph Clustering with Multi-Scale Weight-Based Pairwise Coarsening and Contrastive Learning28 Jul 2025
- 2025A Binary Classification Social Network Dataset for Graph Machine Learning4 Mar 2025
- 2024From Overfitting to Robustness: Quantity, Quality, and Variety Oriented Negative Sample Selection in Graph Contrastive Learning21 Jun 2024