Graph Random Neural Network for Semi-Supervised Learning on Graphs
We study the problem of semi-supervised learning on graphs, for which graph neural networks (GNNs) have been extensively explored. However, most existing GNNs inherently suffer from the limitations of over-smoothing, non-robustness, and weak-generalization when labeled nodes are scarce. In this paper, we propose a simple yet effective framework -- GRAPH RANDOM NEURAL NETWORKS (GRAND) -- to address these issues. In GRAND, we first design a random propagation strategy to perform graph data augmentation. Then we leverage consistency regularization to optimize the prediction consistency of unlabeled nodes across different data augmentations. Extensive experiments on graph benchmark datasets suggest that GRAND significantly outperforms state-of-the-art GNN baselines on semi-supervised node classification. Finally, we show that GRAND mitigates the issues of over-smoothing and non-robustness, exhibiting better generalization behavior than existing GNNs. The source code of GRAND is publicly available at https://github.com/Grand20/grand.
Code (9)
Tasks
Data AugmentationGraph LearningNode ClassificationSimilar Papers 제목 키워드 기반
Graph Random Neural Networks for Semi-Supervised Learning on Graphs
We study the problem of semi-supervised learning on graphs, for which graph neural networks (GNNs) have been extensively explored. However, most existing GNNs inherently suffer from the limitations of over-smoothing, non…
Data AugmentationNode ClassificationAnalysis and algorithms for $\ell_p$-based semi-supervised learning on graphs
This paper addresses theory and applications of $\ell_p$-based Laplacian regularization in semi-supervised learning. The graph $p$-Laplacian for $p>2$ has been proposed recently as a replacement for the standard ($p=2$) …
General ClassificationAnalysis of Semi-Supervised Learning on Hypergraphs
Hypergraphs provide a natural framework for modeling multiway interactions. We analyze a class of variational semi-supervised learning problems posed on random geometric hypergraphs and establish asymptotic consistency i…
Semi-Supervised Node Classification on Graphs: Markov Random Fields vs. Graph Neural Networks
Semi-supervised node classification on graph-structured data has many applications such as fraud detection, fake account and review detection, user's private attribute inference in social networks, and community detectio…
AttributeClassificationCommunity DetectionFraud Detection+2GRAND+: Scalable Graph Random Neural Networks
Graph neural networks (GNNs) have been widely adopted for semi-supervised learning on graphs. A recent study shows that the graph random neural network (GRAND) model can generate state-of-the-art performance for this pro…
Data AugmentationGraph LearningModel OptimizationNode Classification