Tag
KV-LTM 提出将每个会话的原始文本与 KV 缓存持久化为个人助理的长期记忆层,通过恢复缓存会话并追加问题来回答,从而避免写入或读取时的信息损失,并给出存储开销的解析估算与评估协议。
A preprint tests five agent memory systems (Graphiti, Zep, mem0, langmem, cognee) for policy revocation, finding no system reliably prevents agents from retrieving and acting on superseded harmful policies, with revoked records sometimes ranked first and unsafe actions taken in over 40% of trials.
FAIR at Meta 提出 Routed Continual Learning:将过往轨迹按簇划分、每个簇搭配固定记忆库中的一种记忆系统,并由 LLM 路由器决定复用或新建簇,在交错任务流上相对全局 ICL 历史提升 15–30% 归一化奖励并降低 65–72% API 成本。
The paper introduces a framework of 'memory benefit' and 'memory tax' to measure the net value of dedicated agent memory systems over naive RAG, finding that many memory systems underperform direct retrieval across benchmarks. It analyzes how memory processes can remove or obscure evidence and calls for evaluating the net value of memory rather than standalone performance.
该论文提出"错误复现"(error reproduction)机制,指出在LLM智能体外部记忆中持久化抽象规则会循环放大错误,并提出Anti-Persistence记忆设计:仅累积轨迹与结果、按需临时合成指导,从而在多个基准上取得更高成功率与更低LLM调用成本。
A 17-day development update on Astraea, an experimental cognitive architecture, covering a deep architectural audit of 233 Python files and fixes to its affective timing, shared-boundary concurrency, AISS event system, and memory/continuity handling.
该论文提出了一个面向多模态智能体记忆的双轴分析框架:轴一关注多模态信息的形成与表示方式,轴二将记忆管理划分为静态记忆、动态记忆和自进化记忆三个层级,并总结了相关设计模式与未来研究方向。
A new Meta paper finds that agent memory systems work better by applying a stricter confidence cutoff only to user value and belief claims, rather than using a single global threshold. A targeted bar on values reduced unsupported saved facts from 6.2% to 4.0% while retaining about 13 points more of the source's key facts.
该论文研究了LLM智能体中的'记忆过度依赖'现象——即使记忆是良性的、正确存储且被恰当检索,部分证据迁移仍会误导推理。作者提出MemTrim框架,在写入时索引记忆证据、在读取时控制复用,无需重训即可减少过度依赖。
This paper introduces GraphMemory, a lightweight graph-based memory system that decouples stored knowledge from context, retrieving only relevant subgraphs per query to enable token-efficient test-time continual learning while using 81–85% fewer memory-construction tokens than baselines.
提出Analytical Memory Unit (AMU)方案,通过为AI代理共享记忆附加完整数据派生血缘图并按列级权限门控检索,实现隐私保护的企业级记忆治理,消除18.8-25.5%的跨部门数据泄露,同时保持81.5-82.6%的记忆复用率。
Garry Tan announced that GBrain now supports Jev, improving its remembering/dream cycle while keeping retrieval behavior unchanged.
Mnemon is a memory agent that keeps conversations as raw dated records and divides memory work into System 1 fast judgments by a small decision model (Jev) and System 2 planning by an LLM, achieving state-of-the-art LoCoMo (91.7%) and LongMemEval-S (94.4%) scores at low token cost.
MemLife introduces a multimodal memory system for long-term egocentric videos that builds entity-grounded text episodes and retrieves them with a time-indexed agentic reader, improving over training-free baselines by 4.6-12.0% on long-horizon benchmarks. A reinforcement learning framework called MemOpt further optimizes the memory writer for faithfulness and retrievability, yielding consistent 2.7-5.0% gains.
The blog post introduces a multi-part series on techniques for efficient continuous learning in AI, exploring alternatives to reinforcement learning and using KV cache memory at Ramp Labs.
This paper introduces Memory of Memory (MoM), a framework for LLM agent memory that commits current values on arrival while retaining displaced values as provenance, improving accuracy and reducing stale answers.
This paper measures how AI agents contaminate stores they write to, identifying a threshold for error propagation and validating findings with synthetic and real-world Wikidata data.
This article explains the concept of world models in AI agents, highlighting their role in tracking evolving states and transitions, distinct from context or memory, with examples like narrative world models for long-form fiction.
El artículo explora la investigación en Proyecto Chatty sobre la construcción de agentes de IA con continuidad, enfocándose en el sistema alrededor del modelo, incluyendo contexto, memoria, herramientas y permisos.
This paper proposes a hierarchical architecture for long-horizon AI agents, incorporating levels, ticks, and cascaded intelligence to enable continual operation without forgetting, demonstrated over a ten-day campaign.