GUNDAM: Aligning Large Language Models with Graph Understanding
Sheng Ouyang, Yulan Hu, Ge Chen, Yong Liu

TL;DR
This paper introduces GUNDAM, a model that adapts large language models to better understand and reason about graph structures, significantly improving graph reasoning tasks beyond textual data.
Contribution
The paper presents GUNDAM, a novel approach that enhances LLMs' ability to comprehend and utilize graph structures, with theoretical analysis and superior performance on benchmarks.
Findings
GUNDAM outperforms state-of-the-art baselines in graph reasoning benchmarks.
Key factors influencing LLMs' graph reasoning capabilities are identified.
Theoretical analysis shows reasoning paths improve LLMs' reasoning abilities.
Abstract
Large Language Models (LLMs) have achieved impressive results in processing text data, which has sparked interest in applying these models beyond textual data, such as graphs. In the field of graph learning, there is a growing interest in harnessing LLMs to comprehend and manipulate graph-structured data. Existing research predominantly focuses on graphs with rich textual features, such as knowledge graphs or text attribute graphs, leveraging LLMs' ability to process text but inadequately addressing graph structure. This work specifically aims to assess and enhance LLMs' abilities to comprehend and utilize the structural knowledge inherent in graph data itself, rather than focusing solely on graphs rich in textual content. To achieve this, we introduce the \textbf{G}raph \textbf{U}nderstanding for \textbf{N}atural Language \textbf{D}riven \textbf{A}nalytical \textbf{M}odel (\model).…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTopic Modeling · Natural Language Processing Techniques · Advanced Graph Neural Networks
