解决大模型长期记忆中事实断裂和状态冲突问题
AriadneMem: Threading the Maze of Lifelong Memory for LLM Agents
- 分两阶段构建:离线过滤噪声并建模时间边,线上快速补全逻辑路径
- 多跳问答准确率提升15.2%,平均准确率提升9.0%,仅用497个上下文标记
- 适合需要长期记忆的对话代理,显著降低推理耗时
长时程大模型代理需要在固定上下文预算下保持记忆准确性。现有系统面临两大挑战:(i) 事实断裂——多跳回答需关联跨时间分布的事实;(ii) 状态更新——随时间变化的信息(如日程变更)与旧静态记录产生冲突。本文提出AriadneMem,一种结构化记忆系统,通过解耦的两阶段流程应对上述问题。离线构建阶段采用熵感知门控过滤低信息消息,并用冲突感知粗粒化合并静态重复项,同时保留状态变迁为时间边。在线推理阶段,不依赖昂贵的迭代规划,而是执行算法桥接发现以重建缺失逻辑路径,再进行单次调用的拓扑感知合成。在LoCoMo数据集上使用GPT-4o实验显示,AriadneMem相比强基线多跳F1提升15.2%,平均F1提升9.0%。关键在于将推理卸载至图层,仅用497个上下文标记即实现总运行时减少77.8%。代码已开源。
原文摘要 · Abstract (English)
Long-horizon LLM agents require memory systems that remain accurate under fixed context budgets. However, existing systems struggle with two persistent challenges in long-term dialogue: (i) \textbf{disconnected evidence}, where multi-hop answers require linking facts distributed across time, and (ii) \textbf{state updates}, where evolving information (e.g., schedule changes) creates conflicts with older static logs. We propose AriadneMem, a structured memory system that addresses these failure modes via a decoupled two-phase pipeline. In the \textbf{offline construction phase}, AriadneMem employs \emph{entropy-aware gating} to filter noise and low-information message before LLM extraction and applies \emph{conflict-aware coarsening} to merge static duplicates while preserving state transitions as temporal edges. In the \textbf{online reasoning phase}, rather than relying on expensive iterative planning, AriadneMem executes \emph{algorithmic bridge discovery} to reconstruct missing logical paths between retrieved facts, followed by \emph{single-call topology-aware synthesis}. On LoCoMo experiments with GPT-4o, AriadneMem improves \textbf{Multi-Hop F1 by 15.2\%} and \textbf{Average F1 by 9.0\%} over strong baselines. Crucially, by offloading reasoning to the graph layer, AriadneMem reduces \textbf{total runtime by 77.8\%} using only \textbf{497} context tokens. The code is available at https://github.com/LLM-VLM-GSL/AriadneMem.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。