Zero-Mem: Zero-Token Memory Operations for LLM Agents

Skip to main content Search Submit Donate Log in Search arXiv Press Enter to search · Advanced search Computer Science > Computation and Language arXiv:2607.29377 (cs) [Submitted on 31 Jul 2026] Title:Zero-Mem: Zero-Token Memory Operations for LLM Agents Authors:Yilin Xiao, Zhehan Zhu, Yujing Zhang, Jin Chen, Zijin Hong, Luyao Zhuang, Qinggang Zhang, Shengyuan Chen, Xiaocao Ouyang, Lingfei Ren, Xiao Huang View a PDF of the paper titled Zero-Mem: Zero-Token Memory Operations for LLM Agents, by Yilin Xiao and 10 other authors View PDF HTML (experimental) Abstract:LLM agents need memory to act consistently over long interactions, yet many systems use additional LLM calls to operate that memory. Generating intermediate records and mediating their retrieval adds recurring token and time costs, while omitted or merged details can obscure the original evidence. We ask whether structured memory access requires generation at all. Zero-Mem introduces \emph{zero-token memory operations}: no step outside final question answering invokes an LLM or consumes LLM input or output tokens; encoder computation is accounted for separately. Zero-Mem preserves original interaction traces as its source of record. It organizes the traces in two complementary ways. An entity--context graph exposes connections across interactions, while a temporal hierarchy preserves conversational locality and session state. For each query, Zero-Mem weighs the two views, retrieves from both, and follows their structure to recover supporting relations or surrounding context. Deterministic calibration first discards conflicting evidence and then keeps the reader's answer grounded in the retrieved traces. Only the final-QA reader invokes an LLM. Across long-memory and long-context question-answering benchmarks, Zero-Mem achieves competitive performance while eliminating LLM calls and LLM-token consumption from memory operations. With the same final-QA reader and context budget, it reduces memory-operation time cost by 57.6\% relative to the fastest compared baseline. Ablations support the contribution of the two views and their query-dependent coordination. Overall, the results show that structured agent memory need not generate an intermediate representation of the past. After peer review, the code and implementation details will be available at \textcolor{blue}{this https URL}. Subjects: Computation and Language (cs.CL) Cite as: arXiv:2607.29377 [cs.CL]   (or arXiv:2607.29377v1 [cs.CL] for this version)   https://doi.org/10.48550/arXiv.2607.29377 Focus to learn more arXiv-issued DOI via DataCite (pending registration) Submission history From: Yilin Xiao [view email] [v1] Fri, 31 Jul 2026 13:01:06 UTC (414 KB) Full-text links: Access Paper: View a PDF of the paper titled Zero-Mem: Zero-Token Memory Operations for LLM Agents, by Yilin Xiao and 10 other authorsView PDFHTML (experimental)TeX Source view license Current browse context: cs.CL < prev   |   next > new | recent | 2026-07 Change to browse by: cs References & Citations NASA ADSGoogle Scholar Sem