arXiv:2603.18631cs.AI2026-03被引 2

为大模型智能体设计双轨记忆系统,兼顾效率与精准推理。

D-Mem: A Dual-Process Memory System for LLM Agents

  • 采用双重机制:快速向量检索+高精度深度思考模块
  • 动态筛选策略使性能接近全量分析,成本更低
  • 在多个基准上显著超越传统记忆方法,适合长时推理场景

随着持续自适应自主智能体的发展,为长期推理任务提供高保真记忆访问已成为关键需求。然而,现有基于检索的记忆框架多采用增量处理模式,将对话记忆不断提取并更新至向量数据库,查询时依赖语义检索。该方法虽快,但依赖有损抽象,常遗漏关键上下文信息,难以应对细粒度理解类问题。为此,我们提出D-Mem双过程记忆系统:保留轻量级向量检索应对常规查询,同时建立全面深度思考模块作为高保真备选。为兼顾认知经济性与准确性,D-Mem引入多维质量门控策略,动态协调两阶段流程。在LoCoMo和RealTalk基准上使用GPT-4o-mini与Qwen3-235B-Instruct的实验表明,该方法有效。特别地,多维质量门控在LoCoMo上以GPT-4o-mini获得53.5的F1分数,优于静态检索基线Mem0*(51.2),恢复了96.7%的全量思考性能(55.3),且计算开销显著降低。

原文摘要 · Abstract (English)

Driven by the development of persistent, self-adapting autonomous agents, equipping these systems with high-fidelity memory access for long-horizon reasoning has emerged as a critical requirement. However, prevalent retrieval-based memory frameworks often follow an incremental processing paradigm that continuously extracts and updates conversational memories into vector databases, relying on semantic retrieval when queried. While this approach is fast, it inherently relies on lossy abstraction, frequently missing contextually critical information and struggling to resolve queries that rely on fine-grained contextual understanding. To address this, we introduce D-Mem, a dual-process memory system. It retains lightweight vector retrieval for routine queries while establishing an exhaustive Full Deliberation module as a high-fidelity fallback. To achieve cognitive economy without sacrificing accuracy, D-Mem employs a Multi-dimensional Quality Gating policy to dynamically bridge these two processes. Experiments on the LoCoMo and RealTalk benchmarks using GPT-4o-mini and Qwen3-235B-Instruct demonstrate the efficacy of our approach. Notably, our Multi-dimensional Quality Gating policy achieves an F1 score of 53.5 on LoCoMo with GPT-4o-mini. This outperforms our static retrieval baseline, Mem0$^\ast$ (51.2), and recovers 96.7\% of the Full Deliberation's performance (55.3), while incurring significantly lower computational costs.

大模型记忆系统推理优化

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