让大模型像人一样回忆:用双路径检索实现高效个性化。
Evoking User Memory: Personalizing LLM via Recollection-Familiarity Adaptive Retrieval
- 设计双路径检索:熟悉度高时直接选最匹配的,低时启动深度重构。
- 在三个基准上表现超越传统方法,在固定预算下仍更准确。
- 适合需要快速响应且个性化强的应用,如智能助手、聊天机器人。
个性化大语言模型依赖记忆检索来融入用户的历史、偏好与上下文。现有方法要么将所有历史记忆全量输入提示,成本高且不可扩展;要么仅做一次相似性搜索,仅捕捉表面匹配。认知科学表明,人类记忆通过双重机制运作:熟悉度带来快速但粗略识别,回忆则支持有意识的链式重构以恢复深层情景内容。当前系统既缺乏回忆式检索能力,也无动态切换双路径的机制,导致召回不足或引入噪声。为此,我们提出RF-Mem(Recollection-Familiarity Memory Retrieval),一种基于熟悉度不确定性的双路径记忆检索器。该方法通过均值得分与熵衡量熟悉度信号:高熟悉度触发直接的Top-K熟悉度检索路径,低熟悉度则激活回忆路径。在回忆路径中,系统对候选记忆进行聚类,并通过查询与候选的alpha混合在嵌入空间中迭代扩展证据,模拟有意识的情境重构。这一设计将人类双过程认知融入检索器,避免全上下文开销,实现可扩展的自适应个性化。在三个基准和不同语料规模上的实验表明,RF-Mem在固定预算与延迟约束下持续优于单次检索与全上下文推理。代码见复现说明。
原文摘要 · Abstract (English)
Personalized large language models (LLMs) rely on memory retrieval to incorporate user-specific histories, preferences, and contexts. Existing approaches either overload the LLM by feeding all the user's past memory into the prompt, which is costly and unscalable, or simplify retrieval into a one-shot similarity search, which captures only surface matches. Cognitive science, however, shows that human memory operates through a dual process: Familiarity, offering fast but coarse recognition, and Recollection, enabling deliberate, chain-like reconstruction for deeply recovering episodic content. Current systems lack both the ability to perform recollection retrieval and mechanisms to adaptively switch between the dual retrieval paths, leading to either insufficient recall or the inclusion of noise. To address this, we propose RF-Mem (Recollection-Familiarity Memory Retrieval), a familiarity uncertainty-guided dual-path memory retriever. RF-Mem measures the familiarity signal through the mean score and entropy. High familiarity leads to the direct top-K Familiarity retrieval path, while low familiarity activates the Recollection path. In the Recollection path, the system clusters candidate memories and applies alpha-mix with the query to iteratively expand evidence in embedding space, simulating deliberate contextual reconstruction. This design embeds human-like dual-process recognition into the retriever, avoiding full-context overhead and enabling scalable, adaptive personalization. Experiments across three benchmarks and corpus scales demonstrate that RF-Mem consistently outperforms both one-shot retrieval and full-context reasoning under fixed budget and latency constraints. Our code can be found in the Reproducibility Statement.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。