Generalization of Graph Neural Networks is Robust to Model Mismatch
Zhiyang Wang, Juan Cervino, Alejandro Ribeiro

TL;DR
This paper demonstrates that graph neural networks can still generalize effectively even when there is a mismatch between the training and testing data models, especially on geometric graphs from manifolds.
Contribution
It provides a theoretical analysis of GNN robustness to model mismatch on manifold-generated graphs, extending understanding beyond i.i.d. assumptions.
Findings
GNNs generalize well despite model mismatch.
Generalization gap decreases with larger training graphs.
Trade-off exists between generalization and high-frequency discrimination.
Abstract
Graph neural networks (GNNs) have demonstrated their effectiveness in various tasks supported by their generalization capabilities. However, the current analysis of GNN generalization relies on the assumption that training and testing data are independent and identically distributed (i.i.d). This imposes limitations on the cases where a model mismatch exists when generating testing data. In this paper, we examine GNNs that operate on geometric graphs generated from manifold models, explicitly focusing on scenarios where there is a mismatch between manifold models generating training and testing data. Our analysis reveals the robustness of the GNN generalization in the presence of such model mismatch. This indicates that GNNs trained on graphs generated from a manifold can still generalize well to unseen nodes and graphs generated from a mismatched manifold. We attribute this mismatch to…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
Taxonomy
TopicsNeural Networks and Applications · Fault Detection and Control Systems
