Skip to content
Preprint

When Memory Updates but Behavior Does Not: Repairing Implicit Stale Dependencies in Personalized Agent Responses

Aug 2026 · 5 citations · ⚡ 1 influential · 34 references
Computer Science

TL;DR

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.

Abstract

Memory-augmented agents can know that a user's stored state is outdated and still plan around the old value. The STALE benchmark calls this the implicit policy adaptation (IPA) gap. We identify one structural contributor: draft-anchored verification checks what a response says, and in an open-ended response the stale dependency is usually unsaid. StateAuditor therefore audits in the opposite direction, from stored state to draft. An LLM proposes candidate old-to-new transitions from timestamped evidence; deterministic code pins each quotation to a single entry, checks that the new evidence really is newer, and lets only these verified transitions trigger repair. What is verified is provenance and chronology - not semantic supersession. On STALE's full protocol (400 scenarios, 50-session histories, one independent response per query), strict single-query VTA scores .736 against .686 for our locked predecessor under the same judge: a +5.0-point paired gain (95% CI [+2.9, +7.2]) coming almost entirely from IPA and premise resistance (PR). The benchmark's own judge, from a third model family, reproduces the gain (.738 vs. .680). On an independent cross-family preference-evolution benchmark (HorizonBench), the full draft-audit-repair pipeline over a gold-derived structured store raises current-preference accuracy (user-clustered p<.01), though a matched control shows most of this external gain is the draft-side audit itself; a harder authored lifecycle set gives no gain, bounding the claim while false invalidation stays controlled. On STALE, by contrast, a matched control (same evidence, adapter, and call budget) scores only .692 (+0.6 over the predecessor, n.s.), attributing the STALE gain to the transition machinery rather than added context or calls. We make no claim about general-purpose agent memory.

View source

Similar papers

Jul 2026

MemTxn: A Transaction Boundary for Source-Supported Updates and Complete-State Recovery in Agent Memory

MemTxn is a governance layer outside the answer model that verifies whether an update is supported by its source and restores the application-visible state after a fault, and achieves the highest average F1 across all twelve answer-model configurations.

Han-Shuai Cui, Zhiqing Tang, Z. Yao et al. · 2 citations
#artificial intelligence Preprint Sep 2026

Fresh Memory, Stale Plans: Dependency-Scoped Validation for Distributed LLM-Agent Memory

P LAN F ENCE is introduced, a dependency-scoped action-validation protocol for distributed LLM-agent teams that avoids repeated update-path coordination as churn grows and avoids validating unrelated state as the shared keyspace grows.

Evan Chen, Shi-Qiang Wang, Christopher G. Brinton · 1 citation
Preprint Aug 2026

Governed Persistent Memory: Source-Bound State Semantics and Fail-Closed Release for Long-Horizon Agents

GPM is introduced, an auditable bitemporal state-transition model with source-bound admission, derived lifecycle state, current public barriers, and fail-closed structured release with bounded contract and implementation results, not open-world model accuracy or evidence of world truth.

Guodong Xu · 0 citations
Preprint Aug 2026

TARL: Transaction-Aware Reliable Ledgers for Executable Memory Management in Long-Term Agents

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
#artificial intelligence Preprint Sep 2026

LSREP: A Longitudinal State-Replay Protocol for Evaluating Conversational Memory, with ICE v2 as an Audited Local-First Architecture

Conversational memory changes during use, so endpoint question answering alone cannot establish how a persistent state accumulates, ages, or incorporates revisions. We introduce LSREP, a Longitudinal State-Replay Evaluation Protocol combining ordered replay, explicit lifecycle schedules, repeated probes, evolving refer...

Deep K. Sonar · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.