Skip to content

Retain or Consolidate? Budget-Dependent Operator Selection for Language Agent Memory

Jul 2026 · arXiv.org · Vol abs/2607.17545 · 1 citation · 18 references
Computer Science

TL;DR

This work decomposes each operator's utility into a coverage effect on evidence omitted by retention and a signed replacement effect on raw evidence that already fits, which explains why the preferred action changes with relative budget pressure.

Abstract

Language agents depend on memory across interactions. However, the limited context windows of large language models (LLMs) and their inference costs constrain how much memory can be used at once. Existing systems mainly follow two strategies: memory retention and memory consolidation. Retention keeps raw records and preserves exact details, but relevant evidence may not fit under a tight budget; consolidation compresses and combines records, improving coverage per token but risking the loss of query-critical details. Neither strategy is universally preferable. This raises two central questions: when should consolidation replace retention, and which operator -- Merge, Abstract, or Rewrite -- should be selected? We formalize this decision by decomposing each operator's utility into a coverage effect on evidence omitted by retention and a signed replacement effect on raw evidence that already fits. Their balance explains why the preferred action changes with relative budget pressure. We implement this mechanism with Offline Abstraction-Safety (OAS), a lightweight learner that estimates action utilities from pre-generation features with held-out harm calibration. The public LongMemEval and LoCoMo benchmarks show the same budget-dependent pattern. On LongMemEval, consolidation improves absolute accuracy by up to 48% under tight budgets, whereas retention is preferable under loose budgets; LoCoMo replicates this crossover at a smaller budget, consistent with its shorter evidence. On both datasets, cross-note abstraction and merging generally outperform local rewriting when compression is necessary.

View source

Similar papers

Preprint Aug 2026

Stop When Memory Suffices: Evidence-Conditioned Progressive Execution for LLM Agents

This work introduces Router-Mem, an evidence-conditioned progressive execution framework for long-horizon agent memory that is trained with evidence-level supervision and rationale-conditioned representation distillation and achieves strong answer quality while maintaining low online latency.

Yidan Lin, Kai-Xiang Wang, Jiong Lou et al. · 0 citations
Preprint Aug 2026

Weighted Memory Tree: Remembering What Matters for Long-Horizon LLM Agents

The results suggest that effective long-horizon agent memory depends less on storing more information than on deciding which information should remain active, and that effective long-horizon agent memory depends less on storing more information than on deciding which information should remain active.

Q. Dao, Purvi Kathalkar, Kenneth Eaton · 0 citations
Preprint Aug 2026

LeanMem: Simple and Efficient Long-Term Memory for LLM Agents

LeanMem is proposed, a lightweight long-term memory framework that improves accuracy over the strongest memory-based baseline in every setting, at the lowest or near-lowest construction cost, inference tokens, and latency.

Yuxin Liao, Le Wu, Min Hou et al. · 0 citations
Preprint Aug 2026

Muscle Memory for Agents: Compile not Merely Retrieve

This paper argues that Muscle Memory - the practice of compiling recurring user intent into purpose-built specialist agents - is a distinct memory paradigm from retrieval, and argues that compilation is a better fit for the workloads where current assistants impose a multi-turn tax on their users.

Pouya Ghiasnezhad Omran, Soujanya Lanka, Qin Zhang et al. · 0 citations
Jul 2026

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

This work presents Memory as a Controlled Process (MemCon), a framework that models memory operations as a Markov Decision Process and learns an online policy that adaptively decides when, what, and how much to retrieve, when to inject a distilled plan, and when to consolidate or forget.

Eric Jiang, Zhi Zhang, Yuchen Wu et al. · 1 citation
Preprint Aug 2026

TARL: Transaction-Aware Reliable Ledgers for Executable Memory Management in Long-Term Agents

TARL is introduced, a memory state update framework that maps each statement to one of five executable actions and is trained by comparing the memory states produced by alternative update operations, encouraging the model to select the operation that leads to the correct result.

Han Xiao, Hongjun Xu, Xin Zhang et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.