Simple GNN Regularisation for 3D Molecular Property Prediction and Beyond
Jonathan Godwin, Michael Schaarschmidt, Alexander L. Gaunt, Alvaro Sanchez-Gonzalez, Yulia Rubanova, Petar Velickovic, James Kirkpatrick, Peter W. Battaglia
Abstract
In this paper we show that simple noisy regularisation can be an effective way to address GNN oversmoothing. First we argue that regularisers addressing oversmoothing should both penalise node latent similarity and encourage meaningful node representations. From this observation we derive "Noisy Nodes", a simple technique in which we corrupt the input graph with noise, and add a noise correcting node-level loss. The diverse node level loss encourages latent node diversity, and the denoising objective encourages graph manifold learning. Our regulariser applies well-studied methods in simple, straightforward ways which allow even generic architectures to overcome oversmoothing and achieve state of the art results on quantum chemistry tasks, and improve results significantly on Open Graph Benchmark (OGB) datasets. Our results suggest Noisy Nodes can serve as a complementary building block in the GNN toolkit.
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 fc992c65-3d0f-4f39-b95a-8946da3999adCited by top-tier papers30
- EquiformerV2: Improved Equivariant Transformer for Scaling to Higher-Degree RepresentationsYi-Lun Liao, Brandon M. Wood, Abhishek Das, Tess E. SmidtICLR 2024 · 311 citations
- Spherical Message Passing for 3D Molecular GraphsYi Liu, Limei Wang, Meng Liu, Yuchao Lin et al.ICLR 2022 · 256 citations
- ComENet: Towards Complete and Efficient Message Passing for 3D Molecular GraphsLimei Wang, Yi Liu, Yuchao Lin, Haoran Liu et al.NeurIPS 2022 · 130 citations
- The CLRS Algorithmic Reasoning BenchmarkPetar Velickovic, Adrià Puigdomènech Badia, David Budden, Razvan Pascanu et al.ICML 2022 · 118 citations
- Robust Optimization as Data Augmentation for Large-scale GraphsKezhi Kong, Guohao Li, Mucong Ding, Zuxuan Wu et al.CVPR 2022 · 87 citations
Builds on13
- Language Models are Few-Shot LearnersTom B. Brown, Benjamin Mann, Nick Ryder, Melanie Subbiah et al.NeurIPS 2020 · 64,255 citations
- Open Graph Benchmark: Datasets for Machine Learning on GraphsWeihua Hu, Matthias Fey, Marinka Zitnik, Yuxiao Dong et al.NeurIPS 2020 · 3,935 citations
- Graph Contrastive Learning with AugmentationsYuning You, Tianlong Chen, Yongduo Sui, Ting Chen et al.NeurIPS 2020 · 3,042 citations
- Strategies for Pre-training Graph Neural NetworksWeihua Hu, Bowen Liu, Joseph Gomes, Marinka Zitnik et al.ICLR 2020 · 1,744 citations
- DeepGCNs: Can GCNs Go As Deep As CNNs?Guohao Li, Matthias Müller, Ali K. Thabet, Bernard GhanemICCV 2019 · 1,586 citations
Related papers
- Measuring and Relieving the Over-Smoothing Problem for Graph Neural Networks from the Topological ViewDeli Chen, Yankai Lin, Wei Li, Peng Li et al.AAAI 2020 · 1,353 citations
- Towards Deeper Graph Neural Networks with Differentiable Group NormalizationKaixiong Zhou, Xiao Huang, Yuening Li, Daochen Zha et al.NeurIPS 2020 · 248 citations
- Graph Neural Networks Need Cluster-Normalize-Activate ModulesArseny Skryagin, Felix Divo, Mohammad Amin Ali, Devendra Singh Dhami et al.NeurIPS 2024 · 8 citations
- A Dynamical Systems-Inspired Pruning Strategy for Addressing Oversmoothing in Graph Attention NetworksBiswadeep Chakraborty, Harshit Kumar, Saibal MukhopadhyayICML 2025
- Feature Overcorrelation in Deep Graph Neural Networks: A New PerspectiveWei Jin, Xiaorui Liu, Yao Ma, Charu C. Aggarwal et al.KDD 2022 · 28 citations
