让大模型更懂时间顺序,用记忆增强的时空图提升推理能力
MemoTime: Memory-Augmented Temporal Knowledge Graph Enhanced Large Language Model Reasoning
- 构建分层时间树,按操作符精准控制事件时间顺序
- 在多个数据集上超越强基线24.0%,小模型性能媲美GPT-4-Turbo
- 自带可复用记忆库,适合需要长期推理与跨任务学习的场景
大语言模型在复杂推理方面表现优异,但在涉及多实体、复合操作符和动态事件序列的时间理解上仍存在困难。时序知识图谱(TKGs)以结构化方式存储海量时序事实,为时间推理提供了可靠依据。然而现有基于TKG的推理方法仍面临四大挑战:多跳推理中保持时间一致性、多实体时间同步、适应多样化时间操作符的检索策略,以及复用过往推理经验以提高稳定性和效率。为此,我们提出MemoTime——一种基于记忆增强的时序知识图框架,通过结构化锚定、递归推理和持续经验学习提升大模型推理能力。MemoTime将复杂时序问题分解为分层时间树,实现操作符感知推理,强制时间戳单调性,并统一约束多个实体的时间范围。动态证据检索层根据操作符自适应选择检索策略,而自演化经验记忆则存储已验证的推理轨迹、工具决策和子问题嵌入,支持跨类型复用。在多个时序问答基准上的实验证明,MemoTime整体达到当前最优水平,最高优于强基线24.0%。此外,该方法使较小模型(如Qwen3-4B)的推理性能接近GPT-4-Turbo。
原文摘要 · Abstract (English)
Large Language Models (LLMs) have achieved impressive reasoning abilities, but struggle with temporal understanding, especially when questions involve multiple entities, compound operators, and evolving event sequences. Temporal Knowledge Graphs (TKGs), which capture vast amounts of temporal facts in a structured format, offer a reliable source for temporal reasoning. However, existing TKG-based LLM reasoning methods still struggle with four major challenges: maintaining temporal faithfulness in multi-hop reasoning, achieving multi-entity temporal synchronization, adapting retrieval to diverse temporal operators, and reusing prior reasoning experience for stability and efficiency. To address these issues, we propose MemoTime, a memory-augmented temporal knowledge graph framework that enhances LLM reasoning through structured grounding, recursive reasoning, and continual experience learning. MemoTime decomposes complex temporal questions into a hierarchical Tree of Time, enabling operator-aware reasoning that enforces monotonic timestamps and co-constrains multiple entities under unified temporal bounds. A dynamic evidence retrieval layer adaptively selects operator-specific retrieval strategies, while a self-evolving experience memory stores verified reasoning traces, toolkit decisions, and sub-question embeddings for cross-type reuse. Comprehensive experiments on multiple temporal QA benchmarks show that MemoTime achieves overall state-of-the-art results, outperforming the strong baseline by up to 24.0%. Furthermore, MemoTime enables smaller models (e.g., Qwen3-4B) to achieve reasoning performance comparable to that of GPT-4-Turbo.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。