Pith. sign in

REVIEW 2 cited by

LangTopo: Aligning Language Descriptions of Graphs with Tokenized Topological Modeling

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2406.13250 v1 pith:ULUPK5CN submitted 2024-06-19 cs.AI cs.CLcs.LG

classification cs.AIcs.CLcs.LG
keywords graphmodelinglanguagellmsstructuretopologicalcapabilitieslangtopo
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Recently, large language models (LLMs) have been widely researched in the field of graph machine learning due to their outstanding abilities in language comprehension and learning. However, the significant gap between natural language tasks and topological structure modeling poses a nonnegligible challenge. Specifically, since natural language descriptions are not sufficient for LLMs to understand and process graph-structured data, fine-tuned LLMs perform even worse than some traditional GNN models on graph tasks, lacking inherent modeling capabilities for graph structures. Existing research overly emphasizes LLMs' understanding of semantic information captured by external models, while inadequately exploring graph topological structure modeling, thereby overlooking the genuine capabilities that LLMs lack. Consequently, in this paper, we introduce a new framework, LangTopo, which aligns graph structure modeling with natural language understanding at the token level. LangTopo quantifies the graph structure modeling capabilities of GNNs and LLMs by constructing a codebook for the graph modality and performs consistency maximization. This process aligns the text description of LLM with the topological modeling of GNN, allowing LLM to learn the ability of GNN to capture graph structures, enabling LLM to handle graph-structured data independently. We demonstrate the effectiveness of our proposed method on multiple datasets.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

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

  1. Attention Mechanisms Perspective: Exploring LLM Processing of Graph-Structured Data

    cs.AI 2025-05 conditional novelty 7.0 of 10

    Fine-tuning LLMs on graph tasks with a restricted attention window that includes partial graph links, then switching to a fully connected window at inference, improves node classification over standard full-attention ...

  2. Each Graph is a New Language: Graph Learning with LLMs

    cs.CL 2025-01 conditional novelty 6.0 of 10

    GDL4LLM pre-trains LLMs to predict random-walk sequences of node tokens, then fine-tunes on those sequences for node classification, outperforming description- and embedding-based baselines.

Pith tools