The paper investigates how deleting portions of a software engineering agent’s past trajectory affects performance and cost. Across 9,400 runs with two state‑of‑the‑art agents, it finds that large deletions (even up to 100% of reasoning text) can maintain overall effectiveness if applied with a delay, but immediate deletion harms performance. The study also shows that cost savings depend on the pricing model: a flat model yields savings in 26 of 42 cases, while a caching‑aware model actually increases costs because it breaks a low‑rate cached prefix.
arXiv:2609. 04875v1 Announce Type: cross Abstract: Long-running LLM agents are stateful: beyond the transcript they accrete compressed summaries, plaintext memory, pending tool plans, and, under every serving API, a KV cache.
Agent-Controlled Forgetting for Tool-Using Agents: Reversible Context Curation in Practice explores a method where an agent selectively replaces detailed tool results with concise notes while archiving the originals for recovery. Using a Python harness, the approach reduces prompt tokens from 912,492 to 231,951 and cuts cumulative input tokens by 50%, yielding significant API cost savings. However, the method increases request count, slightly slows execution, and its effectiveness varies across different workloads.
The paper introduces REM (Reusable Experience Memory), a framework that manages the lifecycle of experience for large language model agents performing long-horizon coding tasks. REM consolidates completed trajectories into compact, phase-structured documents, injects them at task start, and evicts them after a single exposure, making the memory system responsive to the agent’s needs. Experiments on repository-level bug fixing show REM outperforms state‑of‑the‑art memory systems in retrieval accuracy and task resolution while reducing cost.
arXiv:2610.18052v1 Announce Type: new Abstract: Long-term memory has become a core component of large language model (LLM) agents. As agents accumulate personal information over long-term use, users...
arXiv:2608. 12847v1 Announce Type: new Abstract: Retrieval can identify a past trajectory that may matter, yet it does not specify how an acting agent should use that trajectory after users, entities, constraints, or environment state have changed.
arXiv:2610.15093v1 Announce Type: cross Abstract: AI coding agents operate in iterative loops: they modify code, run tools, inspect the results, and decide what to do next. We call the design of this...
arXiv:2606. 10062v1 Announce Type: new Abstract: Foundation-model agents are increasingly long-lived systems that remember users across interactions, making memorization an explicit deployment-time function rather than solely a property of model weights.
The paper introduces MERIT, a benchmark that evaluates the marginal benefit of long‑term memory for tool‑using large language model agents while explicitly accounting for cost. MERIT provides episodic tool‑use tasks across three domains, verifies dependence on earlier‑episode facts, and measures memory operations in tokens and dollars. Experiments on GPT‑4.1‑mini, Claude Haiku 4.5, and Claude Sonnet 5 show that memory can significantly improve task success, but its utility varies widely across models and memory implementations, and full replay is rarely cost‑effective.
arXiv:2607. 10608v1 Announce Type: new Abstract: Memory is becoming a core component of long-horizon AI agents, allowing agents to reuse past experience when operating web browsers, software tools, and other interactive environments.
arXiv:2608. 07855v1 Announce Type: new Abstract: Multi-turn Reasoning-and-Acting (ReAct) agents accumulate growing trajectories of reasoning, tool calls, and observations.
arXiv:2610.17659v1 Announce Type: new Abstract: Large language model (LLM) agents have shown strong capabilities in interactive problem solving, tool use, and long-horizon task execution. However, th...
The paper introduces the Weighted Memory Tree (WMT), a hierarchical memory system for large language model agents that organizes execution histories into tasks, subtasks, and actions while assigning each memory a dynamic retention score. Event-based updates and selection-based decay allow WMT to preserve useful information, fold completed trajectories, suppress low-utility content, and retain access to folded context. Experiments on GAIA-Text with Qwen3-8B, Gemma 4 E4B, and Llama-3.1-8B show that WMT improves accuracy by an average of 9.97 percentage points and reduces prompt-token usage by 32.8%, while also limiting the persistence of unreliable information.