arXiv Computation and Language

MEMENTO: Learning Context Management for Long Context Processing Agents

MEMENTO is a long‑context agent built on Qwen3‑8B that learns to manage its fixed‑size context window through compaction, replacing its history with self‑generated notes. The model is first fine‑tuned on synthetic trajectories with hindsight notes and then reinforced with a reward combining answer correctness, note quality, and confidence calibration. At test time, MEMENTO can also fold context and backtrack based on confidence, achieving a 67.8% accuracy on book‑level QA (up to 2.5 M tokens) while never holding more than 20 K tokens, outperforming GPT‑5.5 and GLM‑5.3 agents at significantly lower cost.

arXiv Computation and Language
Aug 31

ContextPilot: Teaching Agents for Proactive Context Management via Fine-grained RL

ContextPilot is a proactive context‑management framework designed to improve long‑horizon agentic reasoning with large language models. It expands the toolset to include planning, long‑term memory, and soft context offloading, and introduces a reinforcement‑learning strategy that focuses on critical editing decisions and assigns action‑level advantages. Experiments on long‑context QA and deep search tasks demonstrate that ContextPilot achieves stronger performance with a more compact working context, outperforming existing baselines across various base models and benchmarks.

By Zhuoshi Pan, Qizhi Pei, Junru Lu, Honglin Lin, H. Vicky Zhao, Di Yin, Xing Sun
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
Sep 2

Learning to Remember: End-to-End Training of Memory Agents for Long-Context Reasoning

The paper introduces the Unified Memory Agent (UMA), a system that builds a query‑agnostic external memory from a data stream and reuses it across multiple question‑answering sessions. UMA employs a single policy to manage a structured Memory Bank via CRUD operations and uses Task‑Stratified GRPO to supervise memory maintenance based on QA trajectory rewards. The authors also present Ledger‑QA, a benchmark for long‑horizon state tracking, and demonstrate that UMA outperforms other methods on test‑time learning and accurate‑retrieval tasks, with UMA‑Specialist further improving performance after task adaptation.

By Kehao Zhang, Shangtong Gui, Sheng Yang, Wei Chen, Yang Feng
arXiv AI
Oct 27

CTXAgent - Self-Controlled Context Management of LLM Agents

The paper introduces CTXAgent, a self‑controlled context management system for large language model agents that compacts conversation history when a token threshold is reached. It evaluates seven frontier models, comparing their ability to manage context with and without dedicated tools, and benchmarks performance across coding, scientific, and software engineering tasks. Results show that well‑managed models keep live context below 100k tokens, maintain high benchmark scores, and achieve significant cost reductions, with Claude Opus 5.5 outperforming its explicit configuration by 34% lower cost.

By Matthias Busch, Marius Tacke, Roland C. Aydin, Christian Feiler, Christian J. Cyron
arXiv AI
Oct 28

HiMA-Ecom: A Long-Horizon Memory Benchmark for Hierarchical Multi-Agent E-commerce Assistants

The paper introduces HiMA-Ecom, a hierarchical multi‑agent e‑commerce benchmark with 22.8K instances, where 17.7K include memory entries. It explores training, evaluation, and management of accumulated context in long‑horizon agentic systems, and proposes HiMA‑R1, a policy optimization method that controls trajectory context budgets and uses reward‑driven memory to accelerate convergence. Experiments show that agents built on 3B and 7B open‑source models outperform DeepSeek‑V3 by an average of 6.0 points, while reward‑driven memory cuts convergence steps by about 55%.

By Junxing Hu, Ai Han, Haolan Zhan, Pu Wei, Zhiqian Zhang, Yuhang Guo, Jiawei Lu, Zhen Chen, Haoran Li, Zicheng Zhang, Ling Li