Aug 2026· 5 citations· ⚡ 1 influential· 30 references
Computer Science
TL;DR
StateMem is presented, a state-first memory method that explicitly tracks supersession and relational dependencies, and it is shown it improves current-state accuracy over the strongest same-backbone baseline and over the strongest memory system, while remaining competitive with the long-context baselines.
Abstract
As LLM-based agents are deployed for longer and higher-stakes tasks, their memory systems continue to have crucial gaps. While existing memory benchmarks focus largely on recall-shaped tasks, we argue an effective memory system must track the evolving state of the world; as facts, constraints, and decisions are revised over a long interaction, answers must reflect the current state and not a superseded one. We define this capability as state tracking and instantiate it in StateMemBench, a benchmark of 234 multi-session scenarios spanning two conversation-length regimes. Its closed-pool grading scores whether an answer reflects the current state, the superseded state, or fails otherwise, separating state-tracking failures from other errors by construction. Our analysis shows that this task is challenging for existing memory systems, retrieval-augmented baselines, and long-context baselines. We then present StateMem, a state-first memory method that explicitly tracks supersession and relational dependencies, and show it improves current-state accuracy over the strongest same-backbone baseline by 1.8x (0.205 ->0.363) on DeepSeek-V4-Flash and over the strongest memory system by 1.6x (0.149 ->0.233) on Qwen-3.5-9B, while remaining competitive with the long-context baselines. Finally, we show the same state approach can be applied as a lightweight single-call wrapper over existing memory systems, lifting current-state accuracy by +32 to +67 points on StateMemBench across six memory and retrieval backends. A length- and cost-matched control attributes +15 to +32 of those points to state structure rather than added context.
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
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
This work identifies one structural contributor: draft-anchored verification checks what a response says, and in an open-ended response the stale dependency is usually unsaid, so StateAuditor audits in the opposite direction, from stored state to draft.
LLM agents increasingly take on long-running tasks whose history grows far beyond a single model context window. Existing approaches compress earlier interactions or extract selected information into fixed memory representations, committing to what to preserve before future needs are known. We present Scroll, a context...
Persistent Computational State (PCS), the minimal non-recomputable state that must survive across requests, is defined, show it can be discovered by measurement, and build a session-centric runtime over it.
Pro-LONG, a minimal context management framework built around programmatic memory for LLM agents in long-horizon, exploratory settings, is proposed, which addresses the tradeoff of preserving more information makes retrieving relevant details less tractable.
A. Fox, Jun-Lin Wang, P. Rosu et al.· arXiv.org· 2 citations· ⚡1
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.