arrow
Return

From implicit parameters to explicit knowledge graphs: A structured knowledge recall framework for bidirectional generalization in LLMs

delete2026-08-06
delete0
PRE
AI
P
Peiyuan Yang
Z
Zhichao Yan
B
Boxiang Ma
J
Jiapu Wang
R
Ru Li *
J
Jeff Z. Pan
DOI:10.1016/j.eswa.2026.133844delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
• Introduce a KG-based evaluation revealing LLMs’ insufficient knowledge understanding. • Mitigate the ”Reversal Curse” and enhance the bidirectional generalization of LLMs. • Reveal that self-recalled knowledge surpasses external injection for reasoning tasks. Abstract Large Language Models (LLMs) have become a core component of modern intelligent systems for knowledge-intensive applications. However, despite storing vast amounts of factual knowledge in their parameters, they often fail to effectively utilize this knowledge for bidirectional reasoning. A representative manifestation of this limitation is the “Reversal Curse”, where models trained on “A is B” cannot generalize to “B is A.” To systematically diagnose this deficiency, we design a knowledge graph-based structured recall evaluation framework that assesses whether LLMs can externalize internally stored knowledge into explicit relational triples. Evaluating six LLMs of varying scales and training strategies on a benchmark of 4000 entities with 84,142 Wikidata triples, we find that even the strongest models achieve less than 12% zero-shot structured recall accuracy on the model-specific benchmark, and recall rates remain critically low on a cross-validated intersection benchmark that controls for dataset variation. This finding suggests that the bottleneck lies not merely in knowledge storage, but in the model’s ability to actively retrieve and organize its parametric knowledge into structured representations that support inference. To address this, we propose the Structured Knowledge Recall (SKR) framework, a curriculum learning-inspired two-stage training paradigm that teaches models to first recall entity-centered knowledge graphs from their parameters and then perform reasoning over the explicitly recalled structures. Extensive experiments across four datasets and three model backbones demonstrate that SKR substantially mitigates the Reversal Curse, achieving over 92% reverse generalization accuracy while maintaining forward accuracy above 98%, and that endogenously recalled structured knowledge significantly outperforms externally injected knowledge, offering a new practical pathway for building more robust intelligent language systems.
Keywords:
Large language models
Knowledge graph
Fine-tuning
Knowledge management
Bidirectional generalization

Journal

Expert Systems with Applications cover
Expert Systems with Applications
IF:
7.5
Papers:
3.0W
Citations:
10.2W

Organization

N
nanjing university of science and technology
Scholars:
4.1K
Papers: 1.4K
Citations: 0
S
Shanxi University
Scholars:
1.3W
Papers: 8.4K
Citations: 1.2W
T
The University of Edinburgh
Scholars:
820
Papers: 371
Citations: 0
researcher View more organizations
Cited Papers

Cited Papers

CaReKGC: A Causal-Guided Structural Reasoning Framework for LLM-based Knowledge Graph Completion
err2026-03-13
err0
PREAI
errQionghao Huang; Feiyang Shu; Changqin Huang; Di Zhang; Fan Jiang; Jianhui Yu
errShare
errSave
Towards a Theoretical Understanding of the 'Reversal Curse' via Training Dynamics
err2024-01-01
err0
PREAI
errZhu,Hanlin; Huang,Baihe; Zhang,Shaolun; Jordan,Michael; Jiao,Jiantao; Tian,Yuandong; Russell,Stuart
errShare
errSave
errShare
errSave
Prompting disentangled embeddings for knowledge graph completion with pre-trained language model
err2025-04-01
err1
errOAAI
errGeng, Yuxia; Chen, Jiaoyan; Zeng, Yuhang; Chen, Zhuo; Zhang, Wen; Pan, Jeff Z.; Wang, Yuxiang
errShare
errSave
no more