Neighbour-level Message Interaction Encoding for Improved Representation Learning on Graphs
Not on the map. Why?
Abstract (arXiv)
Message passing has become the dominant framework in graph representation learning. The essential idea of the message-passing framework is to update node embeddings based on the information aggregated from local neighbours. However, most existing aggregation methods have not encoded neighbour-level message interactions into the aggregated message, resulting in an information lost in embedding generation. And this information lost could be accumulated and become more serious as more layers are added to the graph network model. To address this issue, we propose a neighbour-level message interaction information encoding method for improving graph representation learning. For messages that are aggregated at a node, we explicitly generate an encoding between each message and the rest messages using an encoding function. Then we aggregate these learned encodings and take the sum of the aggregated encoding and the aggregated message to update the embedding for the node. By this way, neighbour-level message interaction information is integrated into the generated node embeddings. The proposed encoding method is a generic method which can be integrated into message-passing graph convolutional networks. Extensive experiments are conducted on six popular benchmark datasets across four highly-demanded tasks. The results show that integrating neighbour-level message interactions achieves improved performance of the base models, advancing the state of the art results for representation learning over graphs.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 27 of its 41 references that are in the map. First posted on arXiv 15 Apr 2024.
Builds on
27 of 41 references.
References · 27
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2017Graph Attention Networkscited by 8,854
- 2015Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shiftcited by 6,979
- 2017Inductive Representation Learning on Large Graphscited by 6,284
- 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
- 2020LightGCN: Simplifying and Powering Graph Convolution Network for Recommendationcited by 1,134
- 2013Spectral Networks and Locally Connected Networks on Graphscited by 1,097
- 2018Representation Learning on Graphs with Jumping Knowledge Networkscited by 875
- 2020Simple and Deep Graph Convolutional Networkscited by 857
15 more
- 2019DropEdge: Towards Deep Graph Convolutional Networks on Node Classificationcited by 679
- 2020Benchmarking Graph Neural Networkscited by 672
- 2016Geometric deep learning on graphs and manifolds using mixture model CNNscited by 468
- 2019Provably Powerful Graph Networkscited by 385
- 2017Residual Gated Graph ConvNetscited by 341
- 2017Community Detection and Stochastic Block Modelscited by 317
- 2019PairNorm: Tackling Oversmoothing in GNNscited by 297
- 2019Deep Graph Library: A Graph-Centric, Highly-Performant Package for Graph Neural Networkscited by 241
- 2019On the equivalence between graph isomorphism testing and function approximation with GNNscited by 172
- 2017Encoding Sentences with Graph Convolutional Networks for Semantic Role Labelingcited by 137
- 2023Towards Deep Attention in Graph Neural Networks: Problems and Remediescited by 24
- 2021Graph-Based Tri-Attention Network for Answer Ranking in CQAcited by 8
- 2022PatchGT: Transformer over Non-trainable Clusters for Learning Graph Representationscited by 8
- 2020Graph Polish: A Novel Graph Generation Paradigm for Molecular Optimizationcited by 6
- 2021SSFG: Stochastically Scaling Features and Gradients for Regularizing Graph Convolutional Networkscited by 6
Built on by
Not cited yet.