Generalization Error of Graph Neural Networks in the Mean-field Regime
Not on the map. Why?
Abstract (arXiv)
This work provides a theoretical framework for assessing the generalization error of graph neural networks in the over-parameterized regime, where the number of parameters surpasses the quantity of data points. We explore two widely utilized types of graph neural networks: graph convolutional neural networks and message passing graph neural networks. Prior to this study, existing bounds on the generalization error in the over-parametrized regime were uninformative, limiting our understanding of over-parameterized network performance. Our novel approach involves deriving upper bounds within the mean-field regime for evaluating the generalization error of these graph neural networks. We establish upper bounds with a convergence rate of O(1/n), where n is the number of graph samples. These upper bounds offer a theoretical assurance of the networks' performance on unseen data in the challenging over-parameterized regime and overall contribute to our understanding of their performance.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 51 of its 76 references that are in the map. First posted on arXiv 10 Feb 2024.
Builds on
51 of 76 references.
References · 51
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
- 2017Graph Attention Networkscited by 8,854
- 2017Inductive Representation Learning on Large Graphscited by 6,284
- 2018How Powerful are Graph Neural Networks?cited by 4,355
- 2017Neural Message Passing for Quantum Chemistrycited by 3,460
- 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,597
- 2016Convolutional Neural Networks on Graphs with Fast Localized Spectral Filteringcited by 2,085
- 2018Relational inductive biases, deep learning, and graph networkscited by 1,341
- 2018Graph Convolutional Neural Networks for Web-Scale Recommender Systemscited by 1,133
- 2016Geometric deep learning: going beyond Euclidean datacited by 1,042
- 2018Reconciling modern machine learning practice and the bias-variance trade-offcited by 919
- 2018Hierarchical Graph Representation Learning with Differentiable Poolingcited by 786
38 more
- 2019Graph Neural Networks for Social Recommendationcited by 711
- 2019Graph U-Netscited by 489
- 2018Hypergraph Neural Networkscited by 482
- 2016Geometric deep learning on graphs and manifolds using mixture model CNNscited by 468
- 2018A Mean Field View of the Landscape of Two-Layers Neural Networkscited by 463
- 2018On the Global Convergence of Gradient Descent for Over-parameterized Models using Optimal Transportcited by 422
- 2019The generalization error of random features regression: Precise asymptotics and double descent curvecited by 410
- 2017A PAC-Bayesian Approach to Spectrally-Normalized Margin Bounds for Neural Networkscited by 309
- 2021Deep learning: a statistical viewpointcited by 239
- 2015Order Matters: Sequence to sequence for setscited by 236
- 2019Generalization Bounds of Stochastic Gradient Descent for Wide and Deep Neural Networkscited by 221
- 2020Generalization and Representational Limits of Graph Neural Networkscited by 217
- 2019Mean-field theory of two-layers neural networks: dimension-free bounds and kernel limitcited by 187
- 2020Feature Learning in Infinite-Width Neural Networkscited by 182
- 2019Graph Neural Tangent Kernel: Fusing Graph Neural Networks with Graph Kernelscited by 160
- 2019Linearized two-layers neural networks in high dimensioncited by 155
- 2016Discriminative Embeddings of Latent Variable Models for Structured Datacited by 130
- 2018Billion-scale Commodity Embedding for E-commerce Recommendation in Alibabacited by 105
- 2018Towards Sparse Hierarchical Graph Classifierscited by 100
- 2019What Can ResNet Learn Efficiently, Going Beyond Kernels?cited by 91
- 2020A PAC-Bayesian Approach to Generalization Bounds for Graph Neural Networkscited by 84
- 2019Stability and Generalization of Graph Convolutional Neural Networkscited by 81
- 2020Rethinking pooling in graph neural networkscited by 73
- 2018A jamming transition from under- to over-parametrization affects loss landscape and generalizationcited by 65
- 2021On Provable Benefits of Depth in Training Graph Convolutional Networkscited by 58
- 2022Generalization Analysis of Message Passing Neural Networks on Large Random Graphscited by 58
- 2021Learning Theory Can (Sometimes) Explain Generalisation in Graph Neural Networkscited by 51
- 2019Mean-Field Langevin Dynamics and Energy Landscape of Neural Networkscited by 49
- 2019Deep learning is adaptive to intrinsic dimensionality of model smoothness in anisotropic Besov spacecited by 46
- 2019Mean Field Analysis of Deep Neural Networkscited by 42
- 2023Towards Understanding the Generalization of Graph Neural Networkscited by 41
- 2023Generalization in Graph Neural Networks: Improved PAC-Bayesian Bounds on Graph Diffusioncited by 39
- 2020Optimization and Generalization Analysis of Transduction through Gradient Boosting and Application to Multi-scale Graph Neural Networkscited by 31
- 2020Fast Learning of Graph Neural Networks with Guaranteed Generalizability: One-hidden-layer Casecited by 24
- 2022Generalization Guarantee of Training Graph Convolutional Networks with Graph Topology Samplingcited by 23
- 2020Particle Dual Averaging: Optimization of Mean Field Neural Networks with Global Convergence Rate Analysiscited by 21
- 2021Generalization bounds for graph convolutional neural networks via Rademacher complexitycited by 17
- 2020Mathematical Models of Overparameterized Neural Networkscited by 15
50 most cited of 51 All 51 (JSON)
Built on by
Citing papers per year: 2024: 2; 2025: 2.
4 papers.
- 2025Memorization in Graph Neural Networks26 Aug 2025
- 2025Unveiling Mode Connectivity in Graph Neural Networks18 Feb 2025
- 2024Understanding Transfer Learning via Mean-field Analysis22 Oct 2024
- 2024When narrower is better: the narrow width limit of Bayesian parallel branching neural networks26 Jul 2024