The reviewed record of science sign in
Pith

arxiv: 2310.05845 · v1 · pith:3WDXGO4J · submitted 2023-10-09 · cs.CL · cs.AI

GraphLLM: Boosting Graph Reasoning Ability of Large Language Model

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:3WDXGO4Jrecord.jsonopen to challenge →

classification cs.CL cs.AI
keywords graphllmsreasoningabilityfundamentalgraphllmlanguagemodels
0
0 comments X
read the original abstract

The advancement of Large Language Models (LLMs) has remarkably pushed the boundaries towards artificial general intelligence (AGI), with their exceptional ability on understanding diverse types of information, including but not limited to images and audio. Despite this progress, a critical gap remains in empowering LLMs to proficiently understand and reason on graph data. Recent studies underscore LLMs' underwhelming performance on fundamental graph reasoning tasks. In this paper, we endeavor to unearth the obstacles that impede LLMs in graph reasoning, pinpointing the common practice of converting graphs into natural language descriptions (Graph2Text) as a fundamental bottleneck. To overcome this impediment, we introduce GraphLLM, a pioneering end-to-end approach that synergistically integrates graph learning models with LLMs. This synergy equips LLMs with the ability to proficiently interpret and reason on graph data, harnessing the superior expressive power of graph learning models. Our empirical evaluations across four fundamental graph reasoning tasks validate the effectiveness of GraphLLM. The results exhibit a substantial average accuracy enhancement of 54.44%, alongside a noteworthy context reduction of 96.45% across various graph reasoning tasks.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 4 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. GraphDC: A Divide-and-Conquer Multi-Agent System for Scalable Graph Algorithm Reasoning

    cs.AI 2026-04 unverdicted novelty 6.0

    GraphDC applies divide-and-conquer multi-agent LLM reasoning to graph algorithms by decomposing graphs into subgraphs for local agents and integrating via a master agent, outperforming direct methods especially on lar...

  2. GLIP: Graph and LLM Joint Pretraining for Graph-Level Tasks

    cs.LG 2026-06 unverdicted novelty 5.0

    GLIP is a joint GNN-LLM pretraining framework that uses augmentation, multi-token selection, a diffusion projector, and combined contrastive plus semantic losses to boost graph classification and reasoning after fine-...

  3. Query-Aware Learnable Graph Pooling Tokens as Prompt for Large Language Models

    cs.CL 2025-01 unverdicted novelty 5.0

    LGPT and Early Query Fusion create flexible graph representations for LLMs, achieving 4.13% improvement on GraphQA without training the model.

  4. Retrieval-Augmented Generation with Graphs (GraphRAG)

    cs.IR 2024-12 unverdicted novelty 5.0

    A survey proposing a holistic GraphRAG framework with components including query processor, retriever, organizer, generator, and data source, plus domain-tailored reviews, challenges, and future directions.