Aug 2026· 2026 12th International Conference on Big Data and Information Analytics (BigDIA)· pp. 211-218· 0 citations· 25 references
Abstract
As language agents persist and collaborate over long horizons, a stored fact is no longer disposable context: once recalled, it steers tool calls, planning, and cross-agent agreement. We argue that memory reliability breaks down into two distinct failure modes: staleness (the world changed after a fact was stored) and false consensus (agents copied a wrong value until it looked agreed). Better retrieval fixes neither. VAIL is a governed-memory architecture with one rule: retrieval authorizes inspection, not use. Two independent gates enforce it. An executable time-to-live gate re-runs a stored check against the live environment instead of trusting an age threshold; a private append-only ledger keeps conflicting observations visible and settles trust from outcomes rather than from how often a value was repeated. On a controlled multi-agent benchmark with thirty paired seeds and real model calls, each gate clears its own failure metric while leaving the other untouched, and only the combination collapses task failure, by about 84 percent, with every comparison surviving Bonferroni correction. VAIL outperforms faithful A-MEM and Mem0 ports under a uniform memory-injection budget, stays neutral on trap-free public benchmarks, degrades gracefully as trap pressure rises, and replicates under a second controller model. Two studies built from real GitHub release histories validate each gate in the wild: re-running stored checks repairs real environment migrations, and outcome settlement overturns wrong majorities produced by real version skew.
TRACE is presented, a training-free layer that treats re-entry as an eligibility decision rather than a storage or retrieval operation, reconciling a departure checkpoint against absence-period updates, resolving explicit and implicit invalidation, and releasing a bounded Return View only when it covers the returning r...
Wen-Jun Xiong, Shengtao Zhang, Shangding Gu et al.· 0 citations
Persistent memory allows an LLM agent to carry experience across conversations, but it also turns a local reasoning mistake into a durable one. During deliberation, an agent may consider a plan, simulate a tool result, report another speaker's belief, and then reject all of them. If memory retains only the resulting se...
This work introduces ERRAND, which treats revalidation as a priced errand, which clears every non-oracle policy on the preregistered calibers, primary in every setting and conditional at every binding budget, leading eager revalidation by 10.0pp at the base cap.
Decomposing long-context inference across cooperating agents bounds the active KV cache per call rather than total evidence, which matters when KV-cache memory binds. Many such systems add a persistent tier storing and recalling reasoning traces, usually validated by an ablation reporting an accuracy gain. We measure b...
Ho-Chan Son, Kyungdoe Han, Jaehan Koh et al.· 0 citations
The result identifies a tested region of non-interference: a procedural memory can be mismatched without becoming behaviorally disruptive, and the remaining question is which additional conditions turn applicability mismatch into observable, memory-caused error.
Large language model agents that persist across sessions, tools, users, and changing environments do more than answer isolated prompts; they accumulate state. When new evidence arrives, the central question is where that change should live: transient context, external memory, tool or workflow definitions, activation st...
Gabriel Chavira-Juárez, Eder Jahir Gonzalez Bravo, G. Rivera-García et al.· Frontiers in Big Data· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.