Memory-based Message Passing: Decoupling the Message for Propogation from Discrimination
원문 초록
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.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Positional Encoding meets Persistent Homology on Graphs
Subgraph Gaussian Embedding Contrast for Self-Supervised Graph Representation Learning
LOBSTUR: A Local Bootstrap Framework for Tuning Unsupervised Representations in Graph Neural Networks
PyTDC: A multimodal machine learning training, evaluation, and inference platform for biomedical foundation models
Permutation Equivariant Neural Controlled Differential Equations for Dynamic Graph Representation Learning
Wasserstein Hypergraph Neural Network
토론
이 논문과 연결된 포럼 글이 아직 없습니다.