Memory consolidation outperforms retention under tight budgets, but retention wins when budgets are loose.

A formal utility decomposition explains when to merge, abstract, or rewrite memory for language agents.

PaperIndependentcs.AIarXiv:2607.17545v2
Qingcan Kang · Mingyang Liu · Shixiong Kai · Kaichao Liang · Zhentao Tang · Yuqi Cui · +2 more
Research Digest··2 min read
The authors formalize the trade-off between retaining raw memory and consolidating it via compression, showing that consolidation improves accuracy by up to 48% under tight context budgets, while retention is preferable when budgets are generous. They propose OAS, a lightweight learner that selects the optimal operator per query.

What they did

The authors define memory management for language agents as a budget-dependent operator selection problem. They decompose each consolidation operator's utility into a coverage effect (evidence omitted by retention) and a signed replacement effect (from replacing raw evidence that already fits), explaining why the preferred action changes with relative budget pressure. They implement OAS (Offline Abstraction-Safety), a lightweight learner that estimates action utilities from pre-generation features and uses held-out harm calibration. The system is evaluated on LongMemEval (long-term memory benchmark) and LoCoMo (long-context memory) under varying context budgets.

Key findings

  • On LongMemEval, consolidation improves absolute accuracy by up to 48% under tight budgets, while retention is preferable under loose budgets.
  • LoCoMo replicates the same crossover at a smaller budget, consistent with its shorter evidence.
  • Cross-note abstraction and merging generally outperform local rewriting when compression is necessary.
  • OAS selects the optimal operator per query, achieving the best of both retention and consolidation.

Why it matters

This provides a principled framework for memory management in language agents, moving beyond ad-hoc heuristics. It highlights that the optimal strategy depends on budget pressure, a crucial insight for designing scalable agent systems that must operate under context window limits and inference costs.

Caveats

The study is limited to specific benchmarks and three consolidation operators (Merge, Abstract, Rewrite). The OAS learner relies on held-out calibration data, which may not generalize to all domains or query types. Scalability to very large memories and dynamic, multi-turn interactions remains unexplored.

§

Analysis

This work bridges the gap between retention and consolidation by formalizing the decision problem as a utility trade-off. It opens questions about adaptive memory policies that consider query type, history length, and domain-specific costs, and suggests that future systems could dynamically allocate budget between raw and compressed memory.

newspaper

Research Digest

Articles published under the Zotpaper byline are synthesized from multiple source publications by our AI editor and reviewed by our editorial process. Each story combines reporting from credible outlets to give readers a balanced, comprehensive view.