Conditional Local Feature Encoding for Graph Neural Networks
Yongze Wang, Haimin Zhang, Qiang Wu, Min Xu

TL;DR
This paper introduces Conditional Local Feature Encoding (CLFE), a novel method to preserve node-specific information in GNNs, addressing the issue of feature homogenization in deep message passing, and improves performance across various tasks.
Contribution
The paper proposes CLFE, a new encoding technique that enhances GNNs by maintaining node-specific features during message passing, leading to better performance.
Findings
Consistent performance improvements across seven benchmark datasets.
Effective in four different graph domain tasks.
Enhances baseline GNN models with minimal additional complexity.
Abstract
Graph neural networks (GNNs) have shown great success in learning from graph-based data. The key mechanism of current GNNs is message passing, where a node's feature is updated based on the information passing from its local neighbourhood. A limitation of this mechanism is that node features become increasingly dominated by the information aggregated from the neighbourhood as we use more rounds of message passing. Consequently, as the GNN layers become deeper, adjacent node features tends to be similar, making it more difficult for GNNs to distinguish adjacent nodes, thereby, limiting the performance of GNNs. In this paper, we propose conditional local feature encoding (CLFE) to help prevent the problem of node features being dominated by the information from local neighbourhood. The idea of our method is to extract the node hidden state embedding from message passing process and…
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.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Neural Networks · Neural Networks and Applications · Graph Theory and Algorithms
