Sheaf Graph Neural Networks via PAC-Bayes Spectral Optimization

📅 2025-08-01
📈 Citations: 0
Influential: 0
📄 PDF
🤖 AI Summary
To address node feature collapse in graph neural networks (GNNs) on heterophilous graphs caused by oversmoothing, this paper proposes a cellular layer bundle—a novel message-passing architecture. The method integrates optimal transport enhancement, variance-reduced diffusion, and a new PAC-Bayes spectral regularizer to enable dynamic, topology-adaptive layer-structure learning, backed by verifiable stability guarantees. Unlike static or over-parameterized layer-bundle models, our approach supports end-to-end training and achieves linear-time inference complexity. Evaluated on nine homogeneous and heterophilous graph benchmarks, it significantly outperforms existing spectral methods and layer-bundle GNNs in semi-supervised node classification, achieving state-of-the-art performance. Moreover, it is the first to provide certified confidence intervals for unseen nodes—demonstrating superior generalization and robustness under distributional shift.

Technology Category

Application Category

📝 Abstract
Over-smoothing in Graph Neural Networks (GNNs) causes collapse in distinct node features, particularly on heterophilic graphs where adjacent nodes often have dissimilar labels. Although sheaf neural networks partially mitigate this problem, they typically rely on static or heavily parameterized sheaf structures that hinder generalization and scalability. Existing sheaf-based models either predefine restriction maps or introduce excessive complexity, yet fail to provide rigorous stability guarantees. In this paper, we introduce a novel scheme called SGPC (Sheaf GNNs with PAC-Bayes Calibration), a unified architecture that combines cellular-sheaf message passing with several mechanisms, including optimal transport-based lifting, variance-reduced diffusion, and PAC-Bayes spectral regularization for robust semi-supervised node classification. We establish performance bounds theoretically and demonstrate that the resulting bound-aware objective can be achieved via end-to-end training in linear computational complexity. Experiments on nine homophilic and heterophilic benchmarks show that SGPC outperforms state-of-the-art spectral and sheaf-based GNNs while providing certified confidence intervals on unseen nodes.
Problem

Research questions and friction points this paper is trying to address.

Address over-smoothing in GNNs on heterophilic graphs
Overcome static sheaf structures limiting generalization
Provide rigorous stability guarantees for sheaf-based models
Innovation

Methods, ideas, or system contributions that make the work stand out.

PAC-Bayes spectral regularization for stability
Optimal transport-based lifting for feature enhancement
Variance-reduced diffusion for scalable training
🔎 Similar Papers
No similar papers found.
Yoonhyuk Choi
Yoonhyuk Choi
Assistant Professor, Sookmyung Women's University
Machine LearningGraph Neural NetworksRecommender SystemLarge Language Model
J
Jiho Choi
Korea Advanced Institute of Science and Technology (KAIST), Seoul, Republic of Korea
C
Chong-Kwon Kim
Korea Institute of Energy Technology (KENTECH), Naju, Republic of Korea