The paper introduces two inference‑time designs—factor‑compiled admission (FC) and permission‑semantic admission (PS)—to govern persistent memory in large language model agents without retraining. FC evaluates entire memory entries, while PS decomposes entries into typed units, both using deterministic policies to decide what recalled information enters the working context and how it is expressed. Experiments on a development suite and an external benchmark show that FC and PS reduce failure rates and cross‑domain leakage compared to verbatim injection, though they increase personalization failures and do not meet all preregistered criteria.
By Chang Liu, Deliang Ding
arXiv:2606.28876v4 Announce Type: replace-cross
Abstract: Memory-Mediated Learning Architecture (MMLA) separates slow base parameters theta, a bounded numerical policy carrier Phi, and a bounded auth...
By Junyi Zou, Avrova Donz
The paper introduces Causal Memory Policy (CMP), a framework that identifies the utility of memories in memory‑augmented language models by intervening on retrieval rather than on storage. CMP reserves fixed context slots for memories sampled with known propensities and estimates utility using self‑normalized inverse propensity weighting, providing unbiased estimates and exact variance. Experiments show that CMP improves discrimination between required and non‑required memories and reveals that identified utility alone is insufficient for retention decisions across unseen queries.
By Arman Behnam, Binghui Wang
arXiv:2609.25853v1 Announce Type: new
Abstract: Learned-memory methods store information in an explicit table and consume it through a separate reader, allowing addressing, storage, and reading to be...
By Mingyuan Li, Guangsheng Yu, Juyuan Zhang, Xu Wang, Zhibo Man, Haonan Zhang, Shaoxiong Ji
The paper presents a retrieval‑admissibility verification framework for long‑term memory agents, classifying each memory‑query pair as admissible, inadmissible, or unresolved. It evaluates the framework on public benchmarks (RHELM and MemOps), showing improved anchor recall and reduced exact similarity errors, while also revealing that existing verifiers miss certain inadmissible exposures. The study highlights the need for separate checks on candidate support, admissibility, prompt exposure, and answer disclosure to ensure safe memory retrieval.
By Zi Wang, Xingqiao Wang, Emmanuel Addai, Devika Ambekar, Xiaowei Xu
arXiv:2606. 26806v1 Announce Type: new Abstract: Long-running language agents need more than memory access.
By Haoliang Han