用边界触发机制构建可解释的长期记忆,提升对话系统效率与适应性。
HingeMem: Boundary Guided Long-Term Memory with Query Adaptive Retrieval for Scalable Dialogues

- 基于事件分割理论,以人物、时间、地点、主题变化触发记忆边界
- 在LOCOMO数据集上相对基线提升20%性能,问答耗token降低68%
- 适配多类查询需求,适合需高效可信长时交互的网页应用
长期记忆对支持持续、可持续且个性化的对话系统至关重要。现有方法依赖连续摘要或基于OpenIE的图结构构建,搭配固定Top-k检索,导致跨查询类别适应性差且计算开销高。本文提出HingeMem,一种边界引导的长期记忆机制,借鉴事件分割理论,通过人物、时间、地点、主题四要素变化触发边界,生成可解释的索引接口。当任一要素变更时,系统标记当前段落并写入记忆,减少冗余操作并保留关键上下文。为实现多样信息需求下的鲁棒高效检索,HingeMem引入查询自适应检索机制:(a) 决定检索内容——根据查询条件在元素索引记忆中路由;(b) 控制检索深度——依据查询类型估计所需层级。在从0.6B到生产级模型(如Qwen3-0.6B至Qwen-Flash)的多尺度实验中,于LOCOMO数据集上相较强基线提升约20%相对性能,同时问答耗token下降68%(对比HippoRAG2)。HingeMem不仅推进记忆建模,其自适应检索也使其适用于需要高效可信长时交互的网络应用。
原文摘要 · Abstract (English)
Long-term memory is critical for dialogue systems that support continuous, sustainable, and personalized interactions. However, existing methods rely on continuous summarization or OpenIE-based graph construction paired with fixed Top-\textit{k} retrieval, leading to limited adaptability across query categories and high computational overhead. In this paper, we propose HingeMem, a boundary-guided long-term memory that operationalizes event segmentation theory to build an interpretable indexing interface via boundary-triggered hyperedges over four elements: person, time, location, and topic. When any such element changes, HingeMem draws a boundary and writes the current segment, thereby reducing redundant operations and preserving salient context. To enable robust and efficient retrieval under diverse information needs, HingeMem introduces query-adaptive retrieval mechanisms that jointly decide (a) \textit{what to retrieve}: determine the query-conditioned routing over the element-indexed memory; (b) \textit{how much to retrieve}: control the retrieval depth based on the estimated query type. Extensive experiments across LLM scales (from 0.6B to production-tier models; \textit{e.g.}, Qwen3-0.6B to Qwen-Flash) on LOCOMO show that HingeMem achieves approximately $20\%$ relative improvement over strong baselines without query categories specification, while reducing computational cost (68\%$\downarrow$ question answering token cost compared to HippoRAG2). Beyond advancing memory modeling, HingeMem's adaptive retrieval makes it a strong fit for web applications requiring efficient and trustworthy memory over extended interactions.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。