mlsanityData to 7 Oct 2026

Memory-based Message Passing: Decoupling the Message for Propogation from Discrimination

arXiv 2202.00423 ↗First posted 1 Feb 2022cs.LG cs.AIcited by 6

Not on the map. Why?

Abstract (arXiv)

Message passing is a fundamental procedure for graph neural networks in the field of graph representation learning. Based on the homophily assumption, the current message passing always aggregates features of connected nodes, such as the graph Laplacian smoothing process. However, real-world graphs tend to be noisy and/or non-smooth. The homophily assumption does not always hold, leading to sub-optimal results. A revised message passing method needs to maintain each node's discriminative ability when aggregating the message from neighbors. To this end, we propose a Memory-based Message Passing (MMP) method to decouple the message of each node into a self-embedding part for discrimination and a memory part for propagation. Furthermore, we develop a control mechanism and a decoupling regularization to control the ratio of absorbing and excluding the message in the memory for each node. More importantly, our MMP is a general skill that can work as an additional layer to help improve traditional GNNs performance. Extensive experiments on various datasets with different homophily ratios demonstrate the effectiveness and robustness of the proposed method.

Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). Builds on 18 of its 21 references that are in the map. First posted on arXiv 1 Feb 2022.

Builds on

18 of 21 references.

References · 18

  1. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  2. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
  3. 2017Graph Attention Networkscited by 8,854
  4. 2017Inductive Representation Learning on Large Graphscited by 6,284
  5. 2014Learning Phrase Representations using RNN Encoder-Decoder for Statistical Machine Translationcited by 4,016
  6. 2017Neural Message Passing for Quantum Chemistrycited by 3,460
  7. 2019A Comprehensive Survey on Graph Neural Networkscited by 2,906
  8. 2018Deeper Insights into Graph Convolutional Networks for Semi-Supervised Learningcited by 1,099
  9. 2018Predict then Propagate: Graph Neural Networks meet Personalized PageRankcited by 987
  10. 2018Representation Learning on Graphs with Jumping Knowledge Networkscited by 875
  11. 2020Geom-GCN: Geometric Graph Convolutional Networkscited by 821
  12. 2019DropEdge: Towards Deep Graph Convolutional Networks on Node Classificationcited by 679
6 more
  1. 2020Adaptive Universal Generalized PageRank Graph Neural Networkcited by 592
  2. 2019MixHop: Higher-Order Graph Convolutional Architectures via Sparsified Neighborhood Mixingcited by 442
  3. 2021Beyond Low-frequency Information in Graph Convolutional Networkscited by 361
  4. 2020Iterative Deep Graph Learning for Graph Neural Networks: Better and Robust Node Embeddingscited by 212
  5. 2020Graph Neural Networks with Heterophilycited by 202
  6. 2021Graph Decoupling Attention Markov Networks for Semi-supervised Graph Node Classificationcited by 8

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2022: 4; 2023: 0; 2024: 1; 2025: 0; 2026: 1.

6 papers.