MemTrial is a portfolio‑management agent that learns when to trust its memory of past experiences. It evaluates each experience by drafting decisions with and without that experience, using a fractional factorial design to compute a Banzhaf‑value credit that isolates the experience’s true impact. By pooling noisy credits across dates with a hierarchical Bayesian model and only acting when predictions are reliable, MemTrial outperforms other experience‑learning agents and remains conservative when uncertain, achieving up to 21.2% higher utility and outperforming all LLM baselines on InvestorBench.
arXiv:2605.08374v4 Announce Type: replace Abstract: Episodic memory allows LLM agents to accumulate and retrieve experience, but current methods treat each memory independently, i.e., evaluating retr...
arXiv:2609.24259v1 Announce Type: new Abstract: The effectiveness of agent memory ultimately depends on whether the underlying LLM gives each memory in context an appropriate degree of influence over...
arXiv:2606. 29914v1 Announce Type: cross Abstract: Agent memory systems are increasingly evaluated against RAG and full-context baselines, but reported gains often mix changes in the memory method with changes in the language model, embedding model, or retrieval pipeline, making it unclear what is actually being measured.
arXiv:2610.29823v1 Announce Type: new Abstract: Agent memory systems such as Mem0 and Zep decide what to keep before any question arrives; coding agents keep the raw history and let the model search...
The paper investigates how large language model agents can over-rely on agentic memory, a phenomenon where retrieved memories distort inference even when they are correctly stored and retrieved. It shows that memory is helpful when past experience fully transfers to the current task but becomes misleading under partial query-memory overlap, a pattern confirmed by controlled experiments. To address this, the authors propose MEMTRIM, a plug‑and‑play framework that indexes memory evidence at write time and limits its reuse at read time, thereby reducing over-reliance without retraining and preserving useful memory benefits across models and memory architectures.
arXiv:2608.22533v1 Announce Type: new Abstract: Autonomous computer-use agents are increasingly applied to long-horizon tasks requiring coordinated application calls, persistent state tracking, and v...
arXiv:2609.36435v1 Announce Type: new Abstract: An assistant that serves the same user over a long horizon has to answer from what that user has revealed: which preferences still hold, which were rev...
arXiv:2608.21867v1 Announce Type: new Abstract: LLM agents are moving from single-prompt use to long task streams in which reusable memory becomes a core capability for terminal, software-engineering...
The paper introduces Just-in-Time Memory (JitMem), a system that defers memory curation until a task is read, allowing a curator to synthesize task‑specific memory payloads based on the current query. Unlike traditional write‑time curation, JitMem retains raw trajectories and trains the curator using immediate task success, avoiding long‑horizon credit‑assignment issues. Experiments on ALFWorld, WebShop, and τ²‑bench show JitMem consistently outperforms both no‑memory agents and existing write‑time memory methods, with improvements of up to 16.3 absolute success‑rate points. whyItMatters":"By curating memory at read time, JitMem enables more effective, task‑adaptive recall that directly improves agent performance across diverse benchmarks."
arXiv:2608. 13883v1 Announce Type: new Abstract: Most agent-memory benchmarks test post-hoc recall, whereas MemoryArena evaluates whether memory supports interdependent, multi-session task completion.
arXiv:2606.24595v2 Announce Type: replace Abstract: Long-term memory promises LLM agents that grow more capable across sessions, maintaining an accurate, evolving understanding of the user that inter...
LLM agents that persist across sessions accumulate stored memories whose validity varies enormously by content type, yet existing memory architectures treat all memories as equally persistent and systematically contaminate retrieved context with outdated facts. We show that per-memory, type-conditioned temporal decay, a property of western scrub jay episodic memory, can be operationalized as an auto-classified coefficient $π_i$ in an external LLM-agent memory store, yielding ScrubJay-MEM: each memory is encoded as a jointly-bound What--Where--When tuple with an estimated perishability $π_i$ and utility horizon $τ_i$, retrieved by query-adaptive scoring, and revised retroactively at $O(1)$ LLM calls per update.