Distribution Preserving Graph Representation Learning
Graph neural network (GNN) is effective to model graphs for distributed representations of nodes and an entire graph. Recently, research on the expressive power of GNN attracted growing attention. A highly-expressive GNN has the ability to generate discriminative graph representations. However, in the end-to-end training process for a certain graph learning task, a highly-expressive GNN risks generating graph representations overfitting the training data for the target task, while losing information important for the model generalization. In this paper, we propose Distribution Preserving GNN (DP-GNN) - a GNN framework that can improve the generalizability of expressive GNN models by preserving several kinds of distribution information in graph representations and node representations. Besides the generalizability, by applying an expressive GNN backbone, DP-GNN can also have high expressive power. We evaluate the proposed DP-GNN framework on multiple benchmark datasets for graph classification tasks. The experimental results demonstrate that our model achieves state-of-the-art performances.
Code (0)
등록된 구현이 없습니다.
Tasks
Graph ClassificationGraph LearningGraph Neural NetworkGraph Representation LearningRepresentation LearningSimilar Papers 제목 키워드 기반
Distribution-induced Bidirectional Generative Adversarial Network for Graph Representation Learning
Graph representation learning aims to encode all nodes of a graph into low-dimensional vectors that will serve as input of many compute vision tasks. However, most existing algorithms ignore the existence of inherent dat…
Generative Adversarial NetworkGraph Representation LearningRepresentation LearningInvariant Graph Transformer for Out-of-Distribution Generalization
Graph Transformers (GTs) have demonstrated great effectiveness across various graph analytical tasks. However, the existing GTs focus on training and testing graph data originated from the same distribution, but fail to …
Independent Distribution Regularization for Private Graph Embedding
Learning graph embeddings is a crucial task in graph mining tasks. An effective graph embedding model can learn low-dimensional representations from graph-structured data for data publishing benefiting various downstream…
AttributeGraph EmbeddingGraph MiningLink Prediction+3SGOOD: Substructure-enhanced Graph-Level Out-of-Distribution Detection
Graph-level representation learning is important in a wide range of applications. Existing graph-level models are generally built on i.i.d. assumption for both training and testing graphs. However, in an open world, mode…
Out-of-Distribution DetectionRepresentation LearningConditional Distribution Learning on Graphs
Leveraging the diversity and quantity of data provided by various graph-structured data augmentations while preserving intrinsic semantic information is challenging. Additionally, successive layers in graph neural networ…
Contrastive LearningData AugmentationGraph ClassificationGraph Neural Network+2