EvenNet: Ignoring Odd-Hop Neighbors Improves Robustness of Graph Neural Networks

Understand

Graph Neural Networks (GNNs) have received extensive research attention for their promising performance in graph machine learning.

• Despite their extraordinary predictive accuracy, existing approaches, such as GCN and GPRGNN, are not robust in the face of homophily changes on test graphs, rendering these models vulnerable to graph structural attacks and with limited capacity in generalizing to graphs of varied homophily levels.
• Although many methods have been proposed to improve the robustness of GNN models, most of these techniques are restricted to the spatial domain and employ complicated defense mechanisms, such as learning new graph structures or calculating edge attentions.
• In this paper, we study the problem of designing simple and robust GNN models in the spectral domain.