English

Mem-T: Densifying Rewards for Long-Horizon Memory Agents

Machine Learning 2026-03-10 v2 Computation and Language

Abstract

Memory agents, which depart from predefined memory-processing pipelines by endogenously managing the processing, storage, and retrieval of memories, have garnered increasing attention for their autonomy and adaptability. However, existing training paradigms remain constrained: agents often traverse long-horizon sequences of memory operations before receiving sparse and delayed rewards, which hinders truly end-to-end optimization of memory management policies. To address this limitation, we introduce Mem-T, an autonomous memory agent that interfaces with a lightweight hierarchical memory database to perform dynamic updates and multi-turn retrieval over streaming inputs. To effectively train long-horizon memory management capabilities, we further propose MoT-GRPO, a tree-guided reinforcement learning framework that transforms sparse terminal feedback into dense, step-wise supervision via memory operation tree backpropagation and hindsight credit assignment, thereby enabling the joint optimization of memory construction and retrieval. Extensive experiments demonstrate that Mem-T is (1) high-performing, surpassing frameworks such as A-Mem and Mem0 by up to 14.92%14.92\%, and (2) economical, operating on a favorable accuracy-efficiency Pareto frontier and reducing inference tokens per query by 24.45%\sim24.45\% relative to GAM without sacrificing performance.

Keywords

Cite

@article{arxiv.2601.23014,
  title  = {Mem-T: Densifying Rewards for Long-Horizon Memory Agents},
  author = {Yanwei Yue and Boci Peng and Xuanbo Fan and Jiaxin Guo and Qiankun Li and Yan Zhang},
  journal= {arXiv preprint arXiv:2601.23014},
  year   = {2026}
}
R2 v1 2026-07-01T09:27:50.469Z