GIPA: A General Information Propagation Algorithm for Graph Learning
Houyi Li, Zhihong Chen, Zhao Li, Qinkai Zheng, Peng Zhang, Shuigeng, Zhou

TL;DR
This paper introduces GIPA, a novel graph neural network propagation algorithm that leverages fine-grained bit-wise and feature-wise correlations, improving prediction accuracy on benchmark datasets.
Contribution
GIPA is the first to incorporate both bit-wise and feature-wise correlations based on edge features into graph neural network propagation.
Findings
GIPA achieves an average ROC-AUC of 0.8901 on OGBN-proteins.
GIPA outperforms existing state-of-the-art models.
Experimental results validate the effectiveness of GIPA.
Abstract
Graph neural networks (GNNs) have been widely used in graph-structured data computation, showing promising performance in various applications such as node classification, link prediction, and network recommendation. Existing works mainly focus on node-wise correlation when doing weighted aggregation of neighboring nodes based on attention, such as dot product by the dense vectors of two nodes. This may cause conflicting noise in nodes to be propagated when doing information propagation. To solve this problem, we propose a General Information Propagation Algorithm (GIPA in short), which exploits more fine-grained information fusion including bit-wise and feature-wise correlations based on edge features in their propagation. Specifically, the bit-wise correlation calculates the element-wise attention weight through a multi-layer perceptron (MLP) based on the dense representations of two…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Neural Networks · Bioinformatics and Genomic Networks · Topic Modeling
