Sign inGet started
Paper · arXiv

Toward Graph-Tokenizing Large Language Models with Reconstructive Graph Instruction Tuning

The remarkable success of large language models (LLMs) has motivated researchers to adapt them as universal predictors for various graph-related tasks, with the ultimate goal of developing a graph foundation model that generalizes diverse scenarios. The key challenge is to align graph data with language spaces so that LLMs can better comprehend graphs. As a popular paradigm, Graph-Tokenizing LLMs (GTokenLLMs) encode complex structures and lengthy texts into a graph token sequence, and then align them with text tokens via language instructions tuning. Despite their initial success, our information-theoretic analysis reveals that existing GTokenLLMs rely solely on text supervision from lang...

AuthorsZhongjian Zhang, Xiao Wang, Mengmei Zhang et al.
Primary categorycs.CL
Published2 March 2026
Last updated at source2 March 2026
cs.CLcs.AI
Embed this entry
<iframe src="https://silytics.si/embed/item/87c90818-e6b3-4187-8225-70b865eabbf3" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.