Overall, LightMem offers a context-efficiency trade-off rather than a general advantage over Naive RAG, whose value depends on the retriever and available token budget, motivating future work on retrieval, reranking, query formulation, and their interaction with raw and constructed memory representations.
Abstract
Long-term conversational agents require access to information from earlier interactions, such as a user's preferences, past requests, or previously mentioned facts. Repeatedly providing the full dialogue history can be expensive as conversations grow, so many memory approaches instead transform past interactions into compact entries that can be retrieved when needed. LightMem is a recent lightweight memory-management approach that reports strong effectiveness while maintaining relatively low construction cost. However, it still relies on a separate constructed memory representation and is evaluated with only one retriever, leaving unclear how sensitive its results are to retriever choice and whether memory construction discards answer-relevant information. In this study, we reproduce LightMem and compare it with Naive RAG, which retrieves directly from raw user turns. We recover LightMem's main configuration trend, but find that retriever choice is a major source of performance variation: changing only the retriever over a fixed LightMem store shifts answer accuracy from 58.1% to 75.5%. Constructed memories also do not consistently outperform raw-turn retrieval. Naive RAG generally performs better at matched retrieval depths, whereas LightMem performs better mainly under tight answering-token budgets. Oracle evaluation further shows that memory construction removes some answer-relevant information. Overall, LightMem offers a context-efficiency trade-off rather than a general advantage over Naive RAG. Its value depends on the retriever and available token budget, motivating future work on retrieval, reranking, query formulation, and their interaction with raw and constructed memory representations.
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.
LeanMem is proposed, a lightweight long-term memory framework that improves accuracy over the strongest memory-based baseline in every setting, at the lowest or near-lowest construction cost, inference tokens, and latency.
These results show that long-context memory can be organized along the layer axis, not only the token axis, and expose both the benefits of bounded retrieval and its in-window compression tax.
Han-Lin Liu, Xuan Qi, Chunyu Liu et al.· arXiv.org· 0 citations
This work decomposes each operator's utility into a coverage effect on evidence omitted by retention and a signed replacement effect on raw evidence that already fits, which explains why the preferred action changes with relative budget pressure.
Qingcan Kang, Mingyang Liu, Shixiong Kai et al.· arXiv.org· 1 citation
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, Xilong Cheng et al.· 0 citations
A structured memory framework for query-conditioned user-state inference for long-term personalization that achieves state-of-the-art performance on both PersonaMem and KnowU-Bench, demonstrating the effectiveness of query-conditioned user-state inference for long-term personalization.
Heng Wang, Yifei Li, Lingling Zhang et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.