Stochastic Aggregation in Graph Neural Networks
Not on the map. Why?
Abstract (arXiv)
Graph neural networks (GNNs) manifest pathologies including over-smoothing and limited discriminating power as a result of suboptimally expressive aggregating mechanisms. We herein present a unifying framework for stochastic aggregation (STAG) in GNNs, where noise is (adaptively) injected into the aggregation process from the neighborhood to form node embeddings. We provide theoretical arguments that STAG models, with little overhead, remedy both of the aforementioned problems. In addition to fixed-noise models, we also propose probabilistic versions of STAG models and a variational inference framework to learn the noise posterior. We conduct illustrative experiments clearly targeting oversmoothing and multiset aggregation limitations. Furthermore, STAG enhances general performance of GNNs demonstrated by competitive performance in common citation and molecule graph benchmark datasets.
Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). Builds on 19 of its 31 references that are in the map. First posted on arXiv 25 Feb 2021.
Builds on
19 of 31 references.
References · 19
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
- 2017Inductive Representation Learning on Large Graphscited by 6,284
- 2015Dropout as a Bayesian Approximation: Representing Model Uncertainty in Deep Learningcited by 4,416
- 2018How Powerful are Graph Neural Networks?cited by 4,355
- 2017Neural Message Passing for Quantum Chemistrycited by 3,460
- 2019A Comprehensive Survey on Graph Neural Networkscited by 2,906
- 2016Variational Inference: A Review for Statisticianscited by 1,466
- 2018Relational inductive biases, deep learning, and graph networkscited by 1,341
- 2018Deeper Insights into Graph Convolutional Networks for Semi-Supervised Learningcited by 1,099
- 2018FastGCN: Fast Learning with Graph Convolutional Networks via Importance Samplingcited by 583
7 more
- 2015Weight Uncertainty in Neural Networkscited by 554
- 2015Variational Dropout and the Local Reparameterization Trickcited by 489
- 2020Principal Neighbourhood Aggregation for Graph Netscited by 477
- 2020A Note on Over-Smoothing for Graph Neural Networkscited by 245
- 2018Janossy Pooling: Learning Deep Permutation-Invariant Functions for Variable-Size Inputscited by 96
- 2018Bayesian graph convolutional neural networks for semi-supervised classificationcited by 88
- 2019Graph Neural Networks Exponentially Lose Expressive Power for Node Classificationcited by 16
Built on by
Citing papers per year: 2021: 1; 2022: 0; 2023: 1; 2024: 3; 2025: 1.
6 papers.
- 2024Non-convolutional Graph Neural Networkscited by 11
- 2021Adaptive Neural Message Passing for Inductive Learning on Hypergraphscited by 10
- 2023Machine-learned molecular mechanics force field for the simulation of protein-ligand systems and beyondcited by 5
- 2024On the design space between molecular mechanics and machine learning force fieldscited by 3
- 2024Molecular Dynamics and Machine Learning Unlock Possibilities in Beauty Design -- A Perspectivecited by 1
- 2025Integrating Causality with Neurochaos Learning: Proposed Approach and Research Agendacited by 0
- 2025Integrating Causality with Neurochaos Learning: Proposed Approach and Research Agenda23 Jan 2025
- 2024Molecular Dynamics and Machine Learning Unlock Possibilities in Beauty Design -- A Perspective8 Oct 2024
- 2024On the design space between molecular mechanics and machine learning force fields3 Sep 2024
- 2024Non-convolutional Graph Neural Networks31 Jul 2024
- 2023Machine-learned molecular mechanics force field for the simulation of protein-ligand systems and beyond13 Jul 2023
- 2021Adaptive Neural Message Passing for Inductive Learning on Hypergraphs22 Sep 2021