arXiv:2608.17534cs.CL2026-08

让大模型像走迷宫一样智能找回对话状态,避免混淆不同任务轨迹。

ArborMem: Navigating Interaction States with Memory Forests

论文配图:ArborMem: Navigating Interaction States with Memory Forests
图 1 · 摘自论文原文
  • 用多分支森林结构管理长期对话,每条分支代表一个独立对话流。
  • 在多任务交错场景下,准确恢复中断的对话状态,性能提升5至10个百分点。
  • 专为复杂对话设计,适合需要持续交互的智能助手研发者使用。

大型语言模型越来越多地作为持久对话助手,需要能够保留相关经验并维持跨轮次的连续性。现有方法通过长上下文处理、选择性检索和结构化记忆组织来改善历史信息访问,但多数系统将记忆访问视为直接获取过去信息,而未先确定当前回合应恢复的先前对话状态。这一局限在对话交织多个任务、人物和计划且可能被中断后重续时尤为显著。本文提出ArborMem,一种在线记忆框架,将长期对话表示为可导航的交互状态森林。每个分支保存局部连贯的轨迹,而森林整体维护多个可后续恢复的轨迹。对于新输入,ArborMem定位相关状态,恢复其分支局部上下文,并跨分支引入可复用证据,从而在不混淆语义相关但结构不同的轨迹的前提下保持交互连续性。现有长期记忆基准涵盖多样化的记忆与推理能力,但未显式测试分支结构挑战。因此,本文引入BranchMemEval,一个用于交错与可恢复对话轨迹的受控诊断基准。在LongMemEval、LoCoMo、BEAM 100K和BranchMemEval上的实验表明,ArborMem在三个既有基准上优于最强基线3.36至10.31个百分点,在BranchMemEval上提升5.0个百分点。其优势在读取预算受限时更明显,完整内存查询耗时始终低于半秒。

原文摘要 · Abstract (English)

Large language models increasingly serve as persistent conversational assistants, requiring memory that preserves relevant experience and maintains continuity across interactions. Existing methods improve access to conversational history through long-context processing, selective retrieval, and structured memory organization. However, most systems treat memory access as retrieving relevant past information without first determining which prior interaction state the current turn resumes. This limitation becomes particularly important when conversations interleave multiple tasks, people, and plans that may be interrupted and later revisited. We introduce ArborMem, an online memory framework that represents a long-running conversation as a navigable forest of interaction states. Each branch preserves a locally coherent trajectory, while the forest maintains multiple trajectories that may later be resumed. For each new input, ArborMem localizes the relevant state, restores its branch-local context, and augments it with reusable evidence retrieved across branches, preserving interaction continuity without conflating semantically related but structurally distinct trajectories. Existing long-term memory benchmarks cover diverse memory and reasoning capabilities but do not explicitly isolate branch-structured challenges. We therefore introduce BranchMemEval, a controlled diagnostic benchmark for interleaved and resumable interaction trajectories. Experiments on LongMemEval, LoCoMo, BEAM 100K, and BranchMemEval show that ArborMem outperforms the strongest baselines by 3.36 to 10.31 percentage points on the three established benchmarks and by 5.0 points on BranchMemEval. Its advantage grows under constrained read budgets, while complete memory queries remain below half a second.

对话记忆长期记忆状态管理

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。