Training Graph Neural Networks by Graphon Estimation
Not on the map. Why?
Abstract (arXiv)
In this work, we propose to train a graph neural network via resampling from a graphon estimate obtained from the underlying network data. More specifically, the graphon or the link probability matrix of the underlying network is first obtained from which a new network will be resampled and used during the training process at each layer. Due to the uncertainty induced from the resampling, it helps mitigate the well-known issue of over-smoothing in a graph neural network (GNN) model. Our framework is general, computationally efficient, and conceptually simple. Another appealing feature of our method is that it requires minimal additional tuning during the training process. Extensive numerical results show that our approach is competitive with and in many cases outperform the other over-smoothing reducing GNN training methods.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 22 of its 31 references that are in the map. First posted on arXiv 4 Sep 2021.
Builds on
22 of 31 references.
References · 22
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
- 2017Inductive Representation Learning on Large Graphscited by 6,284
- 2019A Comprehensive Survey on Graph Neural Networkscited by 2,906
- 2019Fast Graph Representation Learning with PyTorch Geometriccited by 2,414
- 2018Graph Neural Networks: A Review of Methods and Applicationscited by 1,571
- 2016Variational Graph Auto-Encoderscited by 1,373
- 2018Deeper Insights into Graph Convolutional Networks for Semi-Supervised Learningcited by 1,099
- 2016Geometric deep learning: going beyond Euclidean datacited by 1,042
- 2016Revisiting Semi-Supervised Learning with Graph Embeddingscited by 970
- 2018Representation Learning on Graphs with Jumping Knowledge Networkscited by 875
- 2019DropEdge: Towards Deep Graph Convolutional Networks on Node Classificationcited by 679
10 more
- 2018FastGCN: Fast Learning with Graph Convolutional Networks via Importance Samplingcited by 583
- 2019Learning Discrete Structures for Graph Neural Networkscited by 228
- 2017CayleyNets: Graph Convolutional Neural Networks with Complex Rational Spectral Filterscited by 203
- 2020Data Augmentation for Graph Neural Networkscited by 200
- 2018Bayesian graph convolutional neural networks for semi-supervised classificationcited by 88
- 2020Bayesian Graph Neural Networks with Adaptive Connection Samplingcited by 81
- 2015Estimating network edge probabilities by neighborhood smoothingcited by 28
- 2014A goodness-of-fit test for stochastic block modelscited by 20
- 2019Graph Neural Networks Exponentially Lose Expressive Power for Node Classificationcited by 16
- 2019Change-point detection in dynamic networks via graphon estimationcited by 3
Built on by
Citing papers per year: 2022: 1; 2023: 1; 2024: 1; 2025: 1.
4 papers.
- 2022G-Mixup: Graph Data Augmentation for Graph Classificationcited by 145
- 2023Transferability of Graph Neural Networks using Graphon and Sampling Theoriescited by 2
- 2025SlideMamba: Entropy-Based Adaptive Fusion of GNN and Mamba for Enhanced Representation Learning in Digital Pathologycited by 1
- 2024Graph data augmentation with Gromow-Wasserstein Barycenterscited by 0
- 2025SlideMamba: Entropy-Based Adaptive Fusion of GNN and Mamba for Enhanced Representation Learning in Digital Pathology25 Sep 2025
- 2024Graph data augmentation with Gromow-Wasserstein Barycenters12 Apr 2024
- 2023Transferability of Graph Neural Networks using Graphon and Sampling Theories25 Jul 2023
- 2022G-Mixup: Graph Data Augmentation for Graph Classification15 Feb 2022