Skip to content
Preprint

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

Aug 2026 · 0 citations · 32 references
Computer Science

TL;DR

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.

Abstract

The continued development of LLMs toward persistent and adaptive intelligence increasingly requires long-term memory mechanisms that preserve and reuse information across interactions. Existing memory systems either compress and structure histories for efficient access or perform deep research over broader trajectories. The former lowers online cost but may omit temporal, causal, or cross-step dependencies, while the latter improves evidence coverage at substantial latency and inference cost. This raises a key question: can a memory system achieve strong answer quality while maintaining low online latency? We introduce Router-Mem, an evidence-conditioned progressive execution framework for long-horizon agent memory. Router-Mem first applies a shared low-cost retrieval prefix to obtain evidence. A lightweight sufficiency router then predicts whether the context supports early termination, which enable a single-token decision at inference time. It is trained with evidence-level supervision and rationale-conditioned representation distillation. When evidence is insufficient, Router-Mem reuses retrieval hits to expand memory blocks and perform deeper analysis and aggregation. Experiments on AMA-Bench and BEAM show that Router-Mem achieves 55.17\% and 38.77\% score while reducing average inference time by 27.3\% and 25.5\% compared with full memory execution.

View source

Similar papers

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
Jul 2026

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

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.

Qingcan Kang, Mingyang Liu, Shixiong Kai et al. · 1 citation
Preprint Aug 2026

MemPrism: Task-Conditioned Relational Memory Views for Long-Horizon Agents

Experiments on long-horizon embodied and web-agent benchmarks show that MemPrism consistently improves the task performance, especially as trajectories become longer, while reducing memory token consumption.

Zhi-Sheng Chen, Bingfan Zeng, Bangde Cao 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

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

ERSkill: Evolving for Skill-Guided Adaptive Memory Retrieval

Experiments across multiple agent memory benchmarks demonstrate that ERSkill substantially outperforms strong non-evolving and self-evolving baselines.

Haolong Chen, Liangyin Zhang, Zhuodan Li 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.