arXiv Machine Learning

Learning Personalized Memory Gating from Delayed One-Sided Feedback

The paper introduces a personalized memory gating approach for language‑model agents, addressing the challenge that a finite memory bank cannot store every fact. It proposes a retrieval‑based labeling strategy to identify which facts are later used, and formulates online memory gating as a contextual bandit problem with delayed one‑sided feedback. The authors present Warm‑Start UCB, combining offline learning with online adaptation, and provide a theoretical regret bound while experimentally showing superior performance over baselines across various memory budgets and history lengths.

arXiv AI
Sep 3

AdaMem: Learning What to Remember with Adaptive Memory Policies for Personalized Agents

AdaMem introduces adaptive memory policies that allow personalized agents to decide what information to write into long‑term memory based on user preferences for each interaction context. Each policy is updated from periodic feedback and controls subsequent memory writing, aiming to improve relevance and reduce unnecessary memory persistence. In experiments on AdaMem‑Bench, AdaMem raises QA accuracy from 80.0% to 84.35% while cutting persistent memory by 9.27%, though models still struggle to execute policies reliably.

By Xingyu Chen, Rui Wang, Zhaopeng Tu, Liefeng Bo
arXiv Computation and Language
Oct 23

Memory-Aware Reward Modeling: Learning Human Preferences for LLM Memory Use

The paper investigates whether using a language model’s memory to personalize responses aligns with user preferences. By collecting about 1,000 pairwise judgments from 87 participants on ChatGPT queries that included personal memories, the authors find that memory‑conditioned responses are not consistently preferred and that users sometimes strongly favor non‑memory responses. An automatic reward model trained on these judgments achieves 72.8% preference prediction accuracy and outperforms existing baselines, highlighting the need for evaluation and optimization objectives that better reflect user preferences for memory use.

By Yijiang River Dong, Zexue He, Cheng Yu, Tiancheng Hu, Michael J Ryan, Jan Batzner, Zheng Hui, Shaolong Wu, Orestis Papakyriakopoulos, Alex Pentland, Nigel Collier, Jiaxin Pei
arXiv AI
Jul 16

Memory as a Controlled Process: Learned Adaptive Memory Management for LLM Agents

arXiv:2607. 13591v1 Announce Type: cross Abstract: Large Language Model (LLM) agents increasingly rely on external memory systems to accumulate experience across tasks.

By Eric Hanchen Jiang, Zhi Zhang, Yuchen Wu, Levina Li, Dong Liu, Xiao Liang, Rui Sun, Yubei Li, Edward Sun, Haozheng Luo, Zhaolu Kang, Aylin Caliskan, Kai-Wei Chang, Ying Nian Wu
arXiv AI
2d ago

Route to Remember: Adaptive Memory Selection for LLM Agents

The paper introduces OPSD, a method that uses on‑policy self‑distillation to train a context‑free student model from a teacher conditioned on user memory, combined with a verify‑then‑regenerate router that directs queries to either weight or text memory. OPSD enables weight memory to compete with or surpass traditional text‑based memory systems on the HaluMem benchmark, reducing token usage per query. The study also explores how different training recipes influence weight memory performance and offers guidance for integrating it with retrieval in persistent, multi‑session agent deployments.

By Zeyu Fang, Jun Yin, Yongsheng Mei, Xu Han, Chaitali Joshi, Zhongkai Sun, Jie Hao, Bin Guo, Chengyuan Ma, Benjamin Z. Yao, Chenlei Guo
arXiv AI
Aug 20

rEDMRec: Distilling Large Language Model Reasoning into an Editable Experience Memory for Recommendation

The paper introduces rEDMRec, a method that compresses a large language model’s reasoning about user preferences and item comparisons into a compact, editable memory. This memory, organized into four channels—long‑term preference, short‑term context, item perception, and counterfactual hard‑negative comparisons—can be updated by an LLM controller and queried by a lightweight student LLM for ranking, eliminating the need to re‑run the expensive teacher model for each request. Experiments on ML‑1M, Amazon Beauty, and Steam datasets show that rEDMRec consistently outperforms zero‑shot, few‑shot, RAG, and GraphRAG baselines, achieving up to a 13.3% improvement in HR@1 on ML‑1M.

By Minh Hoang Nguyen, Tung Le, Huy Tien Nguyen