




















Abstract:Graphs provide a unified representation of semantic content and relational structure, making them a natural fit for domains such as molecular modeling, citation networks, and social graphs. Meanwhile, large language models (LLMs) have excelled at understanding natural language and integrating cross-modal signals, sparking interest in their potential for graph reasoning. Recent work has explored this by either designing template-based graph templates or using graph neural networks (GNNs) to encode structural information. In this study, we investigate how different strategies for encoding graph structure affect LLM performance on text-attributed graphs. Surprisingly, our systematic experiments reveal that: (i) LLMs leveraging only node textual descriptions already achieve strong performance across tasks; and (ii) most structural encoding strategies offer marginal or even negative gains. We show that explicit structural priors are often unnecessary and, in some cases, counterproductive when powerful language models are involved. This represents a significant departure from traditional graph learning paradigms and highlights the need to rethink how structure should be represented and utilized in the LLM era. Our study is to systematically challenge the foundational assumption that structure is inherently beneficial for LLM-based graph reasoning, opening the door to new, semantics-driven approaches for graph learning.
| Comments: | LoG 2025 |
| Subjects: | Machine Learning (cs.LG) |
| Cite as: | arXiv:2511.16767 [cs.LG] |
| (or arXiv:2511.16767v2 [cs.LG] for this version) | |
| https://doi.org/10.48550/arXiv.2511.16767 arXiv-issued DOI via DataCite |
From: Haotian Xu [view email]
[v1]
Thu, 20 Nov 2025 19:34:58 UTC (2,922 KB)
[v2]
Thu, 30 Apr 2026 21:16:34 UTC (2,922 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。