Saved in:
Bibliographic Details
Main Authors: Cheng, Dawei, Wang, Wenjun, Guang, Mingjian
Format: Preprint
Published: 2025
Subjects:
Online Access:https://arxiv.org/abs/2505.19762
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866908854953967616
author Cheng, Dawei
Wang, Wenjun
Guang, Mingjian
author_facet Cheng, Dawei
Wang, Wenjun
Guang, Mingjian
contents Graph neural networks (GNNs) have become a standard paradigm for graph representation learning, yet their message passing mechanism implicitly assumes that messages can be represented by source node embeddings, an assumption that fails in heterophilic graphs. While existing methods attempt to address heterophily through graph structure refinement or adaptation of neighbor aggregation, they often overlook the semantic potential of node text, relying on suboptimal message representation for propagation and compromise performance on homophilic graphs. To address these limitations, we propose LEMP4HG, a novel language model (LM)-enhanced message passing approach for heterophilic graph learning. Specifically, for text-attributed graphs (TAG), we leverage a LM to explicitly model inter-node semantic relationships from paired node texts, synthesizing semantically informed messages for propagation. To ensure practical efficiency, we further introduce an active learning-inspired strategy guided by a tailored heuristic, MVRD, which selectively enhances messages for node pairs most affected by message passing. Extensive experiments demonstrate that LEMP4HG consistently outperforms state-of-the-art methods on heterophilic graphs while maintaining robust performance on homophilic graphs under a practical computational budget.
format Preprint
id arxiv_https___arxiv_org_abs_2505_19762
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Language Models as Messengers: Enhancing Message Passing in Heterophilic Graph Learning
Cheng, Dawei
Wang, Wenjun
Guang, Mingjian
Artificial Intelligence
Graph neural networks (GNNs) have become a standard paradigm for graph representation learning, yet their message passing mechanism implicitly assumes that messages can be represented by source node embeddings, an assumption that fails in heterophilic graphs. While existing methods attempt to address heterophily through graph structure refinement or adaptation of neighbor aggregation, they often overlook the semantic potential of node text, relying on suboptimal message representation for propagation and compromise performance on homophilic graphs. To address these limitations, we propose LEMP4HG, a novel language model (LM)-enhanced message passing approach for heterophilic graph learning. Specifically, for text-attributed graphs (TAG), we leverage a LM to explicitly model inter-node semantic relationships from paired node texts, synthesizing semantically informed messages for propagation. To ensure practical efficiency, we further introduce an active learning-inspired strategy guided by a tailored heuristic, MVRD, which selectively enhances messages for node pairs most affected by message passing. Extensive experiments demonstrate that LEMP4HG consistently outperforms state-of-the-art methods on heterophilic graphs while maintaining robust performance on homophilic graphs under a practical computational budget.
title Language Models as Messengers: Enhancing Message Passing in Heterophilic Graph Learning
topic Artificial Intelligence
url https://arxiv.org/abs/2505.19762