Redesigning graph filter-based GNNs to relax the homophily assumption This work was supported in part by the Spanish AEI Grants PID2022-136887NB-I00, PID2023-149457OB-I00, FPU20/05554, the Community of Madrid (Madrid ELLIS Unit), and the NSF under award CCF-2340481. Research was sponsored by the Army Research Office and was accomplished under Grant Number W911NF-17-S-0002. The views and conclusions contained in this document are those of the authors and should not be interpreted as representing the official policies, either expressed or implied, of the Army Research Office or the U.S. Army or the U.S. Government. The U.S. Government is authorized to reproduce and distribute reprints for Government purposes notwithstanding any copyright notation herein. Emails: samuel.rey.escudero@urjc.es, nav@rice.edu, victor.tenorio@urjc.es, segarra@rice.edu, antonio.garcia.marques@urjc.es
Abstract
Graph neural networks (GNNs) have become a workhorse approach for learning from data defined over irregular domains, typically by implicitly assuming that the data structure is represented by a homophilic graph. However, recent works have revealed that many relevant applications involve heterophilic data where the performance of GNNs can be notably compromised. To address this challenge, we present a simple yet effective architecture designed to mitigate the limitations of the homophily assumption. The proposed architecture reinterprets the role of graph filters in convolutional GNNs, resulting in a more general architecture while incorporating a stronger inductive bias than GNNs based on filter banks. The proposed convolutional layer enhances the expressive capacity of the architecture enabling it to learn from both homophilic and heterophilic data and preventing the issue of oversmoothing. From a theoretical standpoint, we show that the proposed architecture is permutation equivariant. Finally, we show that the proposed GNNs compares favorably relative to several state-of-the-art baselines in both homophilic and heterophilic datasets, showcasing its promising potential.
Benchmark Results
Tested on 2 datasets 8 baseline values reported too low
Tables show presented results in global context (best 3 papers + GCN + MLP).
Heterophilic Graphs
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | P^2GNN | 0.9672
±0.0147 | |
| 2 | DoG | 0.9660
±0.0210 | |
| 3 | GPF-plus | 0.9583
±0.0419 | |
| 34 | MLP | 0.9230
±0.0070 best reported | |
| 53 | GraphSAGE | 0.9000
±0.0365 | |
| 131 | AAGCN-N_H | 0.8570
±0.0510 | This paper |
| 133 | AAGCN-N_A | 0.8550
±0.0510 | This paper |
| 172 | AAGCN | 0.8380
±0.0550 | This paper |
| 189 | SAGE | 0.8269 best reported | best today: Language Models as Messengers: Enhancing Message Passing in Heterophilic Graph Learning (2025) Difference within reported uncertainty; not counted as underperformance. |
| 211 | GAT | 0.8162
±0.0645 best reported | best at pub: A Quasi-Wasserstein Loss for Learning Graph Neural Networks (WWW 2023) best today: Equivariance Everywhere All At Once: A Recipe for Graph Foundation Models (2025) |
| 248 | FB-GCN-N_A | 0.7970
±0.0220 | This paper |
| 257 | GCN | 0.7933
±0.0447 best reported | best at pub: Restructuring Graphs for Higher Homophily via Adaptive Spectral Clustering (AAAI 2022) best today: Graph Wave Networks (WWW 2025) |
| 308 | FB-GCN | 0.7570
±0.0480 | prev best: Complete the Missing Half: Augmenting Aggregation Filtering with Diversification for Graph Convolutional Networks (NeurIPS 2020) Improvement within reported uncertainty; not highlighted. |
| 326 | GIN | 0.7460
±0.0080 best reported | |
| 524 | GCN-N_A | 0.5920
±0.0550 | This paper |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | P^2GNN | 0.9541
±0.0272 | |
| 2 | ACM-GCN | 0.9480
±0.0380 | |
| 3 | RF-GCN | 0.9429 | |
| 24 | MLP | 0.9136
±0.0070 best reported | best at pub: Node-oriented Spectral Filtering for Graph Neural Networks (2022) |
| 138 | SAGE | 0.6460
±0.0630 | prev best: On Performance Discrepancies Across Local Homophily Levels in Graph Neural Networks (2023) best today: Language Models as Messengers: Enhancing Message Passing in Heterophilic Graph Learning (2025) Improvement within reported uncertainty; not highlighted. |
| 157 | GraphSAGE | 0.8196
±0.0739 | |
| 158 | GAT | 0.8190
±0.0540 best reported | best at pub: Restructuring Graphs for Higher Homophily via Adaptive Spectral Clustering (AAAI 2022) |
| 170 | GCN | 0.8082
±0.0360 best reported | best at pub: Differentiable Cluster Graph Neural Network (2024) best today: Bayesian Neighborhood Adaptation for Graph Neural Networks (TMLR 2025) |
| 201 | GIN | 0.7800
±0.0190 best reported | |
| 207 | AAGCN | 0.7760
±0.0680 | This paper |
| 214 | AAGCN-N_H | 0.7730
±0.0440 | This paper |
| 222 | AAGCN-N_A | 0.7620
±0.0340 | This paper |
| 232 | FB-GCN-N_A | 0.7510
±0.0430 | This paper |
| 245 | FB-GCN | 0.7430
±0.0440 | prev best: Complete the Missing Half: Augmenting Aggregation Filtering with Diversification for Graph Convolutional Networks (NeurIPS 2020) Improvement within reported uncertainty; not highlighted. |
| 550 | GCN-N_A | 0.4110
±0.0510 | This paper |
