Beyond Low-Pass Filters: Adaptive Feature Propagation on Graphs

Abstract

Graph neural networks (GNNs) have been extensively studied for prediction tasks on graphs. As pointed out by recent studies, most GNNs assume local homophily, i.e., strong similarities in local neighborhoods. This assumption however limits the generalizability power of GNNs. To address this limitation, we propose a flexible GNN model, which is capable of handling any graphs without being restricted by their underlying homophily. At its core, this model adopts a node attention mechanism based on multiple learnable spectral filters; therefore, the aggregation scheme is learned adaptively for each graph in the spectral domain. We evaluated the proposed model on node classification tasks over eight benchmark datasets. The proposed model is shown to generalize well to both homophilic and heterophilic graphs. Further, it outperforms all state-of-the-art baselines on heterophilic graphs and performs comparably with them on homophilic graphs.

17 pages, 5 figures,conference

References in corpus (9)

• LINE: Large-scale Information Network Embedding
• Fast Graph Representation Learning with PyTorch Geometric
• Scaling Graph Neural Networks with Approximate PageRank
• Revisiting Graph Neural Networks: All We Have is Low-Pass Filters
• Beyond Homophily in Graph Neural Networks: Current Limitations and Effective Designs
• Geom-GCN: Geometric Graph Convolutional Networks
• Graph Wavelet Neural Network
• Non-Local Graph Neural Networks
• Beyond Low-Pass Filters: Adaptive Feature Propagation on Graphs

Cited by in corpus (2)

• How does Heterophily Impact the Robustness of Graph Neural Networks? Theoretical Connections and Practical Implications
• Beyond Low-Pass Filters: Adaptive Feature Propagation on Graphs