Features Based Adaptive Augmentation for Graph Contrastive Learning

• URL: http://arxiv.org/abs/2207.01792v1
• Date: Tue, 5 Jul 2022 03:41:20 GMT
• Title: Features Based Adaptive Augmentation for Graph Contrastive Learning
• Authors: Adnan Ali (1), Jinlong Li (2) ((1) University of Science and Technology of China, (2) University of Science and Technology of China)
• Abstract summary: Self-Supervised learning aims to eliminate the need for expensive annotation in graph representation learning. We introduce a Feature Based Adaptive Augmentation (FebAA) approach, which identifies and preserves potentially influential features. We successfully improved the accuracy of GRACE and BGRL on eight graph representation learning's benchmark datasets.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• 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.

Related papers

• RAGraph: A General Retrieval-Augmented Graph Learning Framework [35.25522856244149]
  We introduce a novel framework called General Retrieval-Augmented Graph Learning (RAGraph) RAGraph brings external graph data into the general graph foundation model to improve model generalization on unseen scenarios. During inference, the RAGraph adeptly retrieves similar toy graphs based on key similarities in downstream tasks.
  arXiv  Detail & Related papers  (2024-10-31T12:05:21Z)
• ENGAGE: Explanation Guided Data Augmentation for Graph Representation Learning [34.23920789327245]
  We propose ENGAGE, where explanation guides the contrastive augmentation process to preserve the key parts in graphs. We also design two data augmentation schemes on graphs for perturbing structural and feature information, respectively.
  arXiv  Detail & Related papers  (2023-07-03T14:33:14Z)
• GIF: A General Graph Unlearning Strategy via Influence Function [63.52038638220563]
  Graph Influence Function (GIF) is a model-agnostic unlearning method that can efficiently and accurately estimate parameter changes in response to a $epsilon$-mass perturbation in deleted data. We conduct extensive experiments on four representative GNN models and three benchmark datasets to justify GIF's superiority in terms of unlearning efficacy, model utility, and unlearning efficiency.
  arXiv  Detail & Related papers  (2023-04-06T03:02:54Z)
• Hybrid Augmented Automated Graph Contrastive Learning [3.785553471764994]
  We propose a framework called Hybrid Augmented Automated Graph Contrastive Learning (HAGCL) HAGCL consists of a feature-level learnable view generator and an edge-level learnable view generator. It insures to learn the most semantically meaningful structure in terms of features and topology.
  arXiv  Detail & Related papers  (2023-03-24T03:26:20Z)
• COSTA: Covariance-Preserving Feature Augmentation for Graph Contrastive Learning [64.78221638149276]
  We show that the node embedding obtained via the graph augmentations is highly biased. Instead of investigating graph augmentation in the input space, we propose augmentations on the hidden features. We show that the feature augmentation with COSTA achieves comparable/better results than graph augmentation based models.
  arXiv  Detail & Related papers  (2022-06-09T18:46:38Z)
• GraphCoCo: Graph Complementary Contrastive Learning [65.89743197355722]
  Graph Contrastive Learning (GCL) has shown promising performance in graph representation learning (GRL) without the supervision of manual annotations. This paper proposes an effective graph complementary contrastive learning approach named GraphCoCo to tackle the above issue.
  arXiv  Detail & Related papers  (2022-03-24T02:58:36Z)
• Adversarial Graph Contrastive Learning with Information Regularization [51.14695794459399]
  Contrastive learning is an effective method in graph representation learning. Data augmentation on graphs is far less intuitive and much harder to provide high-quality contrastive samples. We propose a simple but effective method, Adversarial Graph Contrastive Learning (ARIEL) It consistently outperforms the current graph contrastive learning methods in the node classification task over various real-world datasets.
  arXiv  Detail & Related papers  (2022-02-14T05:54:48Z)
• Deep Reinforcement Learning of Graph Matching [63.469961545293756]
  Graph matching (GM) under node and pairwise constraints has been a building block in areas from optimization to computer vision. We present a reinforcement learning solver for GM i.e. RGM that seeks the node correspondence between pairwise graphs. Our method differs from the previous deep graph matching model in the sense that they are focused on the front-end feature extraction and affinity function learning.
  arXiv  Detail & Related papers  (2020-12-16T13:48:48Z)
• Robust Optimization as Data Augmentation for Large-scale Graphs [117.2376815614148]
  We propose FLAG (Free Large-scale Adversarial Augmentation on Graphs), which iteratively augments node features with gradient-based adversarial perturbations during training. FLAG is a general-purpose approach for graph data, which universally works in node classification, link prediction, and graph classification tasks.
  arXiv  Detail & Related papers  (2020-10-19T21:51:47Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.