Graph Neural Networks Need Cluster-Normalize-Activate Modules
Arseny Skryagin, Felix Divo, Mohammad Amin Ali, Devendra Singh Dhami, Kristian Kersting
Abstract
Graph Neural Networks (GNNs) are non-Euclidean deep learning models for graph-structured data. Despite their successful and diverse applications, oversmoothing prohibits deep architectures due to node features converging to a single fixed point. This severely limits their potential to solve complex tasks. To counteract this tendency, we propose a plug-and-play module consisting of three steps: Cluster-Normalize-Activate (CNA). By applying CNA modules, GNNs search and form super nodes in each layer, which are normalized and activated individually. We demonstrate in node classification and property prediction tasks that CNA significantly improves the accuracy over the state-of-the-art. Particularly, CNA reaches 94.18% and 95.75% accuracy on Cora and CiteSeer, respectively. It further benefits GNNs in regression tasks as well, reducing the mean squared error compared to all baselines. At the same time, GNNs with CNA require substantially fewer learnable parameters than competing architectures.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext fcf2979b-dfc4-4ef3-aad4-f7059699eeb1Builds on19
- Open Graph Benchmark: Datasets for Machine Learning on GraphsWeihua Hu, Matthias Fey, Marinka Zitnik, Yuxiao Dong et al.NeurIPS 2020 · 3,935 citations
- Geom-GCN: Geometric Graph Convolutional NetworksHongbin Pei, Bingzhe Wei, Kevin Chen-Chuan Chang, Yu Lei et al.ICLR 2020 · 1,445 citations
- Understanding over-squashing and bottlenecks on graphs via curvatureJake Topping, Francesco Di Giovanni, Benjamin Paul Chamberlain, Xiaowen Dong et al.ICLR 2022 · 628 citations
- PairNorm: Tackling Oversmoothing in GNNsLingxiao Zhao, Leman AkogluICLR 2020 · 590 citations
- Revisiting Heterophily For Graph Neural NetworksSitao Luan, Chenqing Hua, Qincheng Lu, Jiaqi Zhu et al.NeurIPS 2022 · 351 citations
Related papers
- NAFS: A Simple yet Tough-to-beat Baseline for Graph Representation LearningWentao Zhang, Zeang Sheng, Mingyu Yang, Yang Li et al.ICML 2022 · 24 citations
- Improving Expressivity of GNNs with Subgraph-specific Factor Embedded NormalizationKaixuan Chen, Shunyu Liu, Tongtian Zhu, Ji Qiao et al.KDD 2023 · 13 citations
- Towards Deeper Graph Neural Networks with Differentiable Group NormalizationKaixiong Zhou, Xiao Huang, Yuening Li, Daochen Zha et al.NeurIPS 2020 · 248 citations
- Not too little, not too much: a theoretical analysis of graph (over)smoothingNicolas KerivenNeurIPS 2022 · 190 citations
- Feature Overcorrelation in Deep Graph Neural Networks: A New PerspectiveWei Jin, Xiaorui Liu, Yao Ma, Charu C. Aggarwal et al.KDD 2022 · 28 citations
