Heterophilic Graph
Heterophilic graphs, where connected nodes tend to have dissimilar features or labels, pose a significant challenge to traditional graph neural networks (GNNs) designed for homophilic data. Current research focuses on developing GNN architectures and algorithms that effectively handle this heterophily, including methods that adapt message passing, employ personalized node-specific aggregation, and leverage auxiliary information like node attributes or textual data. Overcoming this limitation is crucial for advancing GNN applications in diverse fields, as many real-world networks exhibit significant heterophily, hindering the performance of standard GNN approaches.
Papers
Sign is Not a Remedy: Multiset-to-Multiset Message Passing for Learning on Heterophilic Graphs
Langzhang Liang, Sunwoo Kim, Kijung Shin, Zenglin Xu, Shirui Pan, Yuan Qi
Heterophilous Distribution Propagation for Graph Neural Networks
Zhuonan Zheng, Sheng Zhou, Hongjia Xu, Ming Gu, Yilun Xu, Ao Li, Yuhong Li, Jingjun Gu, Jiajun Bu