A Manifold Perspective on the Statistical Generalization of Graph Neural Networks
<|reference_start|>A Manifold Perspective on the Statistical Generalization of Graph Neural Networks: Convolutional neural networks have been successfully extended to operate on graphs, giving rise to Graph Neural Networks (GNNs). GNNs combine information from adjacent nodes by successive applications of graph convolutions. GNNs have been implemented successfully in various learning tasks while the theoretical understanding of their generalization capability is still in progress. In this paper, we leverage manifold theory to analyze the statistical generalization gap of GNNs operating on graphs constructed on sampled points from manifolds. We study the generalization gaps of GNNs on both node-level and graph-level tasks. We show that the generalization gaps decrease with the number of nodes in the training graphs, which guarantees the generalization of GNNs to unseen points over manifolds. We validate our theoretical results in multiple real-world datasets.<|reference_end|>
@article{wang2024a,
    title={A Manifold Perspective on the Statistical Generalization of Graph Neural
  Networks},
    author={Zhiyang Wang, Juan Cervino, Alejandro Ribeiro},
    journal={arXiv preprint arXiv:2406.05225},
    year={2024},
    archivePrefix={arXiv},
    eprint={2406.05225},
    primaryClass={cs.LG stat.ML}
}