A 55-template prompt benchmark showing general LLMs can beat specialized graph LLMs and GNNs on node classification and link prediction, though the reported margins are inflated by test-set prompt selection.
A Prompt-Based Knowledge Graph Foundation Model for Universal In-Context Reasoning
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
Extensive knowledge graphs (KGs) have been constructed to facilitate knowledge-driven tasks across various scenarios. However, existing work usually develops separate reasoning models for different KGs, lacking the ability to generalize and transfer knowledge across diverse KGs and reasoning settings. In this paper, we propose a prompt-based KG foundation model via in-context learning, namely KG-ICL, to achieve a universal reasoning ability. Specifically, we introduce a prompt graph centered with a query-related example fact as context to understand the query relation. To encode prompt graphs with the generalization ability to unseen entities and relations in queries, we first propose a unified tokenizer that maps entities and relations in prompt graphs to predefined tokens. Then, we propose two message passing neural networks to perform prompt encoding and KG reasoning, respectively. We conduct evaluation on 43 different KGs in both transductive and inductive settings. Results indicate that the proposed KG-ICL outperforms baselines on most datasets, showcasing its outstanding generalization and universal reasoning capabilities. The source code is accessible on GitHub: https://github.com/nju-websoft/KG-ICL.
fields
cs.LG 1years
2025 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
GraphICL: Unlocking Graph Learning Potential in LLMs through Structured Prompt Design
A 55-template prompt benchmark showing general LLMs can beat specialized graph LLMs and GNNs on node classification and link prediction, though the reported margins are inflated by test-set prompt selection.