AugWard: Augmentation-Aware Representation Learning for Accurate Graph Classification
How can we accurately classify graphs? Graph classification is a pivotal task in data mining with applications in social network analysis, web analysis, drug discovery, molecular property prediction, etc. Graph neural networks have achieved the state-of-the-art performance in graph classification, but they consistently struggle with overfitting. To mitigate overfitting, researchers have introduced various representation learning methods utilizing graph augmentation. However, existing methods rely on simplistic use of graph augmentation, which loses augmentation-induced differences and limits the expressiveness of representations. In this paper, we propose AugWard (Augmentation-Aware Training with Graph Distance and Consistency Regularization), a novel graph representation learning framework that carefully considers the diversity introduced by graph augmentation. AugWard applies augmentation-aware training to predict the graph distance between the augmented graph and its original one, aligning the representation difference directly with graph distance at both feature and structure levels. Furthermore, AugWard employs consistency regularization to encourage the classifier to handle richer representations. Experimental results show that AugWard gives the state-of-the-art performance in supervised, semi-supervised graph classification, and transfer learning.
Code (1)
Tasks
DiversityDrug DiscoveryGraph ClassificationGraph Representation LearningMolecular Property PredictionProperty PredictionRepresentation LearningTransfer LearningSimilar Papers 제목 키워드 기반
Graph Contrastive Learning with Cohesive Subgraph Awareness
Graph contrastive learning (GCL) has emerged as a state-of-the-art strategy for learning representations of diverse graphs including social and biomedical networks. GCL widely uses stochastic graph topology augmentation,…
Contrastive LearningGraph ClassificationGraph LearningGraph Representation Learning+1Augmentations in Graph Contrastive Learning: Current Methodological Flaws & Towards Better Practices
Unsupervised graph representation learning is critical to a wide range of applications where labels may be scarce or expensive to procure. Contrastive learning (CL) is an increasingly popular paradigm for such settings a…
ClassificationContrastive LearningData AugmentationDocument Classification+5Structure Matters: Brain Graph Augmentation via Learnable Edge Masking for Data-efficient Psychiatric Diagnosis
The limited availability of labeled brain network data makes it challenging to achieve accurate and interpretable psychiatric diagnoses. While self-supervised learning (SSL) offers a promising solution, existing methods …
Self-Supervised LearningMitigating Degree Biases in Message Passing Mechanism by Utilizing Community Structures
This study utilizes community structures to address node degree biases in message-passing (MP) via learnable graph augmentations and novel graph transformers. Recent augmentation-based methods showed that MP neural netwo…
Node ClassificationNode ClusteringSelf-Supervised LearningFairness-Aware Node Representation Learning
Node representation learning has demonstrated its effectiveness for various applications on graphs. Particularly, recent developments in contrastive learning have led to promising results in unsupervised node representat…
Contrastive LearningFairnessNode ClassificationRepresentation Learning