Experiments on long-term conversational memory show that mixed observed-and-estimated reranking improves answer accuracy over semantic retrieval by up to 6.62% and remains effective when only 17.5% of candidates receive direct LLM relevance scores, thereby substantially reducing the inference overhead of LLM reranking.
Abstract
Long-term language-model agents accumulate memories across interactions, but their retrievers typically do not accumulate retrieval experience. Semantic retrieval is efficient, but embedding similarity does not always reflect whether a memory contains evidence relevant to the current query. Large language model (LLM) rerankers provide stronger query-conditioned relevance scores, yet stateless reranking repeatedly scores a large candidate pool and discards these scores after each query. We introduce EARM, an experience-amortized reranking framework that treats previously acquired LLM relevance scores as reusable retrieval experience. EARM stores sparse query--memory relevance scores in an online matrix, learns their shared structure through causal matrix completion, and combines a small set of newly observed scores with estimated scores to rerank the remaining candidates. The scoring budget decreases as experience accumulates, changing LLM reranking from a repeated per-query expense into a retrieval capability learned over an agent's lifetime. Experiments on long-term conversational memory show that mixed observed-and-estimated reranking improves answer accuracy over semantic retrieval by up to 6.62% and remains effective when only 17.5% of candidates receive direct LLM relevance scores, thereby substantially reducing the inference overhead of LLM reranking. These results motivate a broader view of agent memory: a long-lived agent should remember not only past content, but also how that content has proved useful for retrieval.
LazyMem is introduced, which resolves this tension by deferring all memory construction to query time and generalizes to LoCoMo without target-domain training and reduces mean latency relative to the prior query-time baseline.
RippleMem is a long-term memory system that replaces one-shot retrieval with adaptive associative recollection, Inspired by cue-dependent episodic retrieval and associative completion, that stores interaction history as cue-rich episodic memory units and organizes them in an event-centric memory graph.
Jingbo Ji, Lingyi Li, Xi-Long Cheng et al.· 2 citations
CoEvo-Mem alternates between updating the router with the memory bank fixed and evolving the memory bank with the retrieval policy fixed, demonstrating the importance of retrieval-memory coevolution.
Bowen Ye, Yongchao Xu, Zhijian Li et al.· 0 citations
The results suggest that the accuracy--cost trade-off of long-term agent memory depends not only on what information is retained, but also on the granularity at which it is consolidated, and that the accuracy--cost trade-off of long-term agent memory depends not only on what information is retained, but also on the gra...
Dongfang Li, Zi-Xuan Liu, Junmai Wang et al.· 3 citations
CoVeMem (Collaborative Vector Memory) is proposed, which vectorizes the collaborative core of the agent's memory and takes gradients: the full interaction history, out of reach for text, becomes available as training data for what the agent remembers and for how it reads what it remembers.
Hanting Chen, Xing Tang, Ling-Jie Li et al.· 0 citations
Learn how Google DeepMind and GovTech Singapore uses lightweight on-device Gemma models to intercept conversational scams in private chats with zero cloud data egress.
Microsoft Research Blog· microsoft.comOct 12, 2026
StudentSim is a research system for evaluating and improving AI tutoring tools before they are tested with learners. It models how individuals may engage with tutors, giving feedback to improve tutor performance across subjects like chess, writing, and mathematics. The post Simulating student learning for better AI tutoring appeared first on Microsoft Research.