Neighbourhood Transformer: Switchable Attention for Monophily-Aware Graph Learning

TL;DR

The paper introduces Neighbourhood Transformers, a novel graph neural network paradigm that is monophily-aware, scalable, and outperforms existing methods on diverse real-world datasets.

Contribution

It proposes a switchable attention-based neighborhood partitioning strategy for GNNs, significantly reducing resource consumption and enhancing performance on heterophilic and homophilic graphs.

Findings

NT outperforms state-of-the-art methods on 10 datasets.

Reduces space consumption by over 95%.

Reduces time consumption by up to 92.67%.

Abstract

Graph neural networks (GNNs) have been widely adopted in engineering applications such as social network analysis, chemical research and computer vision. However, their efficacy is severely compromised by the inherent homophily assumption, which fails to hold for heterophilic graphs where dissimilar nodes are frequently connected. To address this fundamental limitation in graph learning, we first draw inspiration from the recently discovered monophily property of real-world graphs, and propose Neighbourhood Transformers (NT), a novel paradigm that applies self-attention within every local neighbourhood instead of aggregating messages to the central node as in conventional message-passing GNNs. This design makes NT inherently monophily-aware and theoretically guarantees its expressiveness is no weaker than traditional message-passing frameworks. For practical engineering deployment, we further develop a neighbourhood partitioning strategy equipped with switchable attentions, which reduces the space consumption of NT by over 95% and time consumption by up to 92.67%, significantly expanding its applicability to larger graphs. Extensive experiments on 10 real-world datasets (5 heterophilic and 5 homophilic graphs) show that NT outperforms all current state-of-the-art methods on node classification tasks, demonstrating its superior performance and cross-domain adaptability. The full implementation code of this work is publicly available at https://github.com/cf020031308/MoNT to facilitate reproducibility and industrial adoption.