paper-with-me

홈 › Papers

AugWard: Augmentation-Aware Representation Learning for Accurate Graph Classification

2025-03-27 · Minjun Kim, Jaehyeon Choi, SeungJoo Lee, Jinhong Jung, U Kang

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.

📄 PDF Abstract BibTeX arXiv:2503.21105

Code (1)

snudatalab/AugWard 공식 구현 pytorch

Tasks

DiversityDrug DiscoveryGraph ClassificationGraph Representation LearningMolecular Property PredictionProperty PredictionRepresentation LearningTransfer Learning

Similar Papers 제목 키워드 기반

Graph Contrastive Learning with Cohesive Subgraph Awareness

2024-01-31 · Yucheng Wu, Leye Wang, Xiao Han, Han-Jia Ye

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+1

Augmentations in Graph Contrastive Learning: Current Methodological Flaws & Towards Better Practices

2021-11-05 · Puja Trivedi, Ekdeep Singh Lubana, Yujun Yan, Yaoqing Yang 외

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+5

Structure Matters: Brain Graph Augmentation via Learnable Edge Masking for Data-efficient Psychiatric Diagnosis

2025-09-11 · Mujie Liu, Chenze Wang, Liping Chen, Nguyen Linh Dan Le 외 arxiv

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 Learning

Mitigating Degree Biases in Message Passing Mechanism by Utilizing Community Structures

2023-12-28 · Van Thuy Hoang, O-Joun Lee

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 Learning

Fairness-Aware Node Representation Learning

2021-06-09 · Öykü Deniz Köse, Yanning Shen

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