Large Language Models-guided Dynamic Adaptation for Temporal Knowledge Graph Reasoning
Jiapu Wang, Kai Sun, Linhao Luo, Wei Wei, Yongli Hu, Alan Wee-Chung, Liew, Shirui Pan, Baocai Yin

TL;DR
This paper introduces LLM-DA, a method leveraging large language models to extract interpretable temporal rules from knowledge graphs and dynamically update them, enhancing reasoning accuracy without fine-tuning.
Contribution
The paper proposes a novel LLM-guided dynamic adaptation approach that extracts and updates temporal logical rules for knowledge graph reasoning, addressing interpretability and update challenges.
Findings
Significant accuracy improvements on multiple datasets.
Effective extraction of interpretable temporal rules.
No fine-tuning required for improved reasoning.
Abstract
Temporal Knowledge Graph Reasoning (TKGR) is the process of utilizing temporal information to capture complex relations within a Temporal Knowledge Graph (TKG) to infer new knowledge. Conventional methods in TKGR typically depend on deep learning algorithms or temporal logical rules. However, deep learning-based TKGRs often lack interpretability, whereas rule-based TKGRs struggle to effectively learn temporal rules that capture temporal patterns. Recently, Large Language Models (LLMs) have demonstrated extensive knowledge and remarkable proficiency in temporal reasoning. Consequently, the employment of LLMs for Temporal Knowledge Graph Reasoning (TKGR) has sparked increasing interest among researchers. Nonetheless, LLMs are known to function as black boxes, making it challenging to comprehend their reasoning process. Additionally, due to the resource-intensive nature of fine-tuning,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
Taxonomy
TopicsAdvanced Graph Neural Networks · Topic Modeling · Semantic Web and Ontologies
