Heterophily-informed Message Passing
Haishan Wang, Arno Solin, Vikas Garg
TL;DR
This work tackles oversmoothing in graph neural networks by addressing the implicit homophily bias in message passing. It introduces heterophily-informed MP, a flexible, architecture-agnostic scheme that modulates messages across three channels (orig., hom., het.) using cosine-based similarity to preserve both low- and high-frequency information, and demonstrates substantial gains on node classification benchmarks. The authors extend the idea to molecular generation with HetFlows, a flow-based model that replaces MoFlow's GCNs with MixMP blocks, achieving improved chemoinformatics metrics and structured latent spaces on QM9 and zinc-250k. Collectively, the approach provides a label-free, generalizable prior for heterophily that enhances both discriminative and generative graph tasks, with clear implications for robust graph learning in diverse domains.
Abstract
Graph neural networks (GNNs) are known to be vulnerable to oversmoothing due to their implicit homophily assumption. We mitigate this problem with a novel scheme that regulates the aggregation of messages, modulating the type and extent of message passing locally thereby preserving both the low and high-frequency components of information. Our approach relies solely on learnt embeddings, obviating the need for auxiliary labels, thus extending the benefits of heterophily-aware embeddings to broader applications, e.g., generative modelling. Our experiments, conducted across various data sets and GNN architectures, demonstrate performance enhancements and reveal heterophily patterns across standard classification benchmarks. Furthermore, application to molecular generation showcases notable performance improvements on chemoinformatics benchmarks.
