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

Yanwei Yue, Guibin Zhang, Boci Peng, Xuanbo Fan, Jiaxin Guo +2 more
1/30/2026
cs.LGcs.CL

No official code found. Best implementation: yanweiyue/Mem-T (43 stars, Apache-2.0, last commit 2026-03-22).

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\%$, and (2) economical, operating on a favorable accuracy-efficiency Pareto frontier and reducing inference tokens per query by $\sim24.45\%$ relative to GAM without sacrificing performance.

View on arXivView PDF

Code Implementations(1)

yanweiyue/Mem-TCommunity62%
Apache-2.0

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

430Shell, PythonJan 30, 20267 months agoApache-2.0

Similar Papers

Cite this paper

@article{yue2026memt,
  title  = {Mem-T: Densifying Rewards for Long-Horizon Memory Agents},
  author = {Yanwei Yue and Guibin Zhang and Boci Peng and Xuanbo Fan and Jiaxin Guo and Qiankun Li and Yan Zhang},
  year   = {2026},
  eprint = {2601.23014},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2601.23014v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2601.23014.svg)](https://codeofpaper.com/paper/2601.23014)

Discussion