Swapping LLM calls for a lightweight classifier in memory pipelines cuts latency by an order of magnitude without losing answer quality, a design pattern applicable to any RAG or agent system that overuses the LLM for trivial choices. Builders working on chat memory, retrieval routing or stopping criteria can replicate this by scoring candidates in batches and reserving the LLM for final generation. The numbers also set a concrete benchmark point against LoCoMo baselines.
#LoCoMo
解决智能体长期记忆检索结果零散难用的老问题,把散落的记忆片段编译成能直接作答的上下文,LoCoMo 跑出 80.52%,做 Agent 记忆的可以看看。
The design signals a shift in agent memory architecture: offload retrieval and triage to a fast, cheap classifier and reserve the LLM for final synthesis, rather than letting the model read everything. Developers building long-running assistants can study the two-tier split and the open-source code on GitHub as a template for cutting both cost and latency. Against named baselines like existing mainstream memory solutions, the 0.93-second average response and 6.6x faster memory writes are the concrete differentiators.
The design insight is that most memory overhead comes from calling the LLM during storage and retrieval, which a rule-based controller can replace without losing accuracy. Developers building retrieval-heavy agents can adopt the controller pattern to cut latency and memory-construction costs on their own stacks.
多人对话里模型总记不清谁说了什么,这篇给出双轨记忆方案,在 EverMemBench 榜单拿了最好成绩,做记忆系统的可以看看。
这篇新论文把智能体常栽跟头的上下文问题拆成五个可操作的原语,还给出了验证方案,在LongMemEval和LoCoMo上分别跑了92%和93.2%。
这篇论文把AI代理失效的真正原因讲透了——不是推理不行,而是管不住上下文。还给了个参考实现,LongMemEval和LoCoMo成绩都90%以上。