Asynchronous Neural Networks for Learning in Graphs
Not on the map. Why?
Abstract (arXiv)
This paper studies asynchronous message passing (AMP), a new paradigm for applying neural network based learning to graphs. Existing graph neural networks use the synchronous distributed computing model and aggregate their neighbors in each round, which causes problems such as oversmoothing and limits their expressiveness. On the other hand, AMP is based on the asynchronous model, where nodes react to messages of their neighbors individually. We prove that (i) AMP can simulate synchronous GNNs and that (ii) AMP can theoretically distinguish any pair of graphs. We experimentally validate AMP's expressiveness. Further, we show that AMP might be better suited to propagate messages over large distances in graphs and performs well on several graph classification benchmarks.
Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). Builds on 48 of its 62 references that are in the map. First posted on arXiv 24 May 2022.
Builds on
48 of 62 references.
References · 48
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
- 2017Graph Attention Networkscited by 8,923
- 2017Inductive Representation Learning on Large Graphscited by 6,320
- 2018How Powerful are Graph Neural Networks?cited by 4,393
- 2014Learning Phrase Representations using RNN Encoder-Decoder for Statistical Machine Translationcited by 4,057
- 2017Neural Message Passing for Quantum Chemistrycited by 3,487
- 2014Sequence to Sequence Learning with Neural Networkscited by 2,986
- 2019A Comprehensive Survey on Graph Neural Networkscited by 2,919
- 2018Relational inductive biases, deep learning, and graph networkscited by 1,360
- 2018Deeper Insights into Graph Convolutional Networks for Semi-Supervised Learningcited by 1,102
- 2018Weisfeiler and Leman Go Neural: Higher-order Graph Neural Networkscited by 881
36 more
- 2018Representation Learning on Graphs with Jumping Knowledge Networkscited by 877
- 2020Simple and Deep Graph Convolutional Networkscited by 860
- 2021How Attentive are Graph Attention Networks?cited by 835
- 2019DropEdge: Towards Deep Graph Convolutional Networks on Node Classificationcited by 680
- 2018Universal Transformerscited by 647
- 2020On the Bottleneck of Graph Neural Networks and its Practical Implicationscited by 631
- 2020Directional Message Passing for Molecular Graphscited by 561
- 2019Measuring and Relieving the Over-smoothing Problem for Graph Neural Networks from the Topological Viewcited by 545
- 2019DeepGCNs: Can GCNs Go as Deep as CNNs?cited by 527
- 2016Adaptive Computation Time for Recurrent Neural Networkscited by 506
- 2021Understanding over-squashing and bottlenecks on graphs via curvaturecited by 478
- 2019Diffusion Improves Graph Learningcited by 414
- 2019Provably Powerful Graph Networkscited by 389
- 2016Learning Convolutional Neural Networks for Graphscited by 314
- 2019PairNorm: Tackling Oversmoothing in GNNscited by 297
- 2020How Neural Networks Extrapolate: From Feedforward to Graph Neural Networkscited by 222
- 2020Generalization and Representational Limits of Graph Neural Networkscited by 218
- 2020Graph Random Neural Network for Semi-Supervised Learning on Graphscited by 213
- 2019What graph neural networks cannot learn: depth vs widthcited by 201
- 2022Representing Long-Range Context for Graph Neural Networks with Global Attentioncited by 195
- 2020Random Features Strengthen Graph Neural Networkscited by 186
- 2019On the equivalence between graph isomorphism testing and function approximation with GNNscited by 172
- 2019What Can Neural Networks Reason About?cited by 159
- 2021Equivariant Subgraph Aggregation Networkscited by 154
- 2020Rumor Detection on Social Media with Bi-Directional Graph Convolutional Networkscited by 153
- 2019Neural Execution of Graph Algorithmscited by 121
- 2021DropGNN: Random Dropouts Increase the Expressiveness of Graph Neural Networkscited by 118
- 2020Towards Deeper Graph Neural Networks with Differentiable Group Normalizationcited by 114
- 2020Building powerful and equivariant graph neural networks with structural message-passingcited by 97
- 2020Bayesian Graph Neural Networks with Adaptive Connection Samplingcited by 81
- 2018Neural Arithmetic Logic Unitscited by 70
- 2019Approximation Ratios of Graph Neural Networks for Combinatorial Problemscited by 69
- 2022Rewiring with Positional Encodings for Graph Neural Networkscited by 36
- 2020Neural Arithmetic Unitscited by 28
- 2020Neural Power Unitscited by 7
- 2020Neural Status Registerscited by 3
Built on by
Citing papers per year: 2023: 2; 2024: 0; 2025: 2.
4 papers.
- 2023DRew: Dynamically Rewired Message Passing with Delaycited by 82
- 2023Cooperative Graph Neural Networkscited by 36
- 2025Spectral Theory for Edge Pruning in Asynchronous Recurrent Graph Neural Networkscited by 0
- 2025ParaGate: Parasitic-Driven Domain Adaptation Transfer Learning for Netlist Performance Predictioncited by 0
- 2025ParaGate: Parasitic-Driven Domain Adaptation Transfer Learning for Netlist Performance Prediction28 Nov 2025
- 2025Spectral Theory for Edge Pruning in Asynchronous Recurrent Graph Neural Networks23 Feb 2025
- 2023Cooperative Graph Neural Networks2 Oct 2023
- 2023DRew: Dynamically Rewired Message Passing with Delay13 May 2023