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

• URL: http://arxiv.org/abs/2608.03699v2
• Date: Tue, 11 Aug 2026 12:23:39 GMT
• Title: TARL: Transaction-Aware Reliable Ledgers for Executable Memory Management in Long-Term Agents
• Abstract summary: We introduce TARL, a memory state update framework that maps each statement to one of five executable actions.<n> TARL identifies the affected memory, resolves its temporal scope, compares source reliability, and updates accepted, pending, and rejected ledgers.<n>We also introduce TARL-Mem, a benchmark with fine-grained action labels and next-state targets.
• Score: 20.123133746969398
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Persistent memory helps long-term agents retain knowledge, yet a single update error can repeatedly distort future retrieval and reasoning. Most existing systems reduce memory updating to a binary Write/Hold decision, which cannot distinguish whether new information should be added, ignored, used to revise an outdated belief, rejected as unreliable, or deferred for verification. These choices may share the same binary label while producing fundamentally different memory states. We introduce TARL, a memory state update framework that maps each statement to one of five executable actions. TARL identifies the affected memory, resolves its temporal scope, compares source reliability, and updates accepted, pending, and rejected ledgers. It is further trained by comparing the memory states produced by alternative update operations, encouraging the model to select the operation that leads to the correct result. We also introduce TARL-Mem, a benchmark with fine-grained action labels and next-state targets. Across in-domain, cross-source, temporal, counterfactual, and sequential evaluations, TARL improves action prediction and state recovery, reduces memory pollution, preserves conflicting evidence, and limits cumulative corruption.

Related papers

• EvoGraph-Mem: Failure-Aware Editable Graph Memory for Long-Term Language Agents [4.265255679736993]
  Existing memory-augmented agents mainly focus on storing and retrieving past experience.<n>Previously distilled insights can become outdated, over-generalized, or harmful under new task contexts.<n>We propose a failure-aware memory maintenance framework based on an editable insight graph.
  arXiv  Detail & Related papers  (2026-08-03T12:35:44Z)
• MemOps: Benchmarking Lifecycle Memory Operations in Long-Horizon Conversations [50.24315431387575]
  We introduce MemOps, a benchmark that reformulates conversational memory as a sequence of lifecycle operations.<n>MemOps represents each memory event with a structured trace specifying its trigger, target, scope, state transition, and supporting evidence.<n>Across long-context, retrieval-based, parametric and managed-memory systems, MemOps disentangles failure modes that final-answer accuracy alone conceals.
  arXiv  Detail & Related papers  (2026-07-14T15:33:44Z)
• The Past Is Prologue: A Plug-in Controller for Selective Updates in Sequentially Evolving LLM Memory [53.50071717647285]
  We propose Janus, a plug-in memory controller that decides whether to accept a candidate memory update or retain the previous memory.<n>Janus uses a Memory Momentum Trigger to identify suspicious deviations in the memory-update trajectory.<n>Janus improves average accuracy by +2.7 to +4.6 points over the corresponding base updaters.
  arXiv  Detail & Related papers  (2026-06-30T04:33:18Z)
• TRUSTMEM: Learning Trustworthy Memory Consolidation for LLM Agents with Long-Term Memory [11.528637007309937]
  Large language model (LLM) agents rely on long-term memory to support extended interactions and personalized assistance beyond finite context windows.<n>Existing memory agents actively update external memory through generated write, revise, and delete operations.<n>These updates may omit important information, corrupt existing memory, or introduce unsupported hallucinated content.<n>We propose TrustMem, a framework designed to improve the trustworthiness of memory consolidation.
  arXiv  Detail & Related papers  (2026-06-23T20:49:28Z)
• MEMPROBE: Probing Long-Term Agent Memory via Hidden User-State Recovery [58.64329475683699]
  We argue that long-term memory should be evaluated as an auditable post-interaction artifact.<n>We instantiate this view in MEMPROBE, a benchmark in which a memory-equipped agent assists simulated users.<n>We find that successful assistance and recoverable memory behave as distinct capabilities.
  arXiv  Detail & Related papers  (2026-06-23T13:52:46Z)
• HiMPO: Hindsight-Informed Memory Policy Optimization for Less-Entangled Credit in Long-Horizon Agents [10.128343847630552]
  HiMPO is a Hindsight-Informed Memory Policy Optimization framework for assigning less-entangled credit to memory-writing actions.<n>We show that HiMPO reduces blame leakage from tool-induced errors and improves attribution fidelity of memory updates.
  arXiv  Detail & Related papers  (2026-06-15T06:49:18Z)
• REAL: A Reasoning-Enhanced Graph Framework for Long-Term Memory Management of LLMs [17.526686616588794]
  Large Language Models (LLMs) are increasingly expected to interact with users over long time horizons.<n>LLMs cannot retain all past interactions, making long-term memory management essential for storing, updating, and retrieving historical information.<n> REAL constructs long-term conversational memory as a temporal and confidence-aware directed property graph.
  arXiv  Detail & Related papers  (2026-06-09T10:53:10Z)
• WorldMemArena: Evaluating Multimodal Agent Memory Through Action-World Interaction [72.1620416874118]
  Multimodal large language models are increasingly deployed as long-horizon agents.<n>Existing benchmarks measure recall over static dialogue, collapse memory into a single end-of-task accuracy, and reduce visual observations to captions.<n>We formulate multimodal agent memory as an Action-World Interaction Loop with an observable four-stage lifecycle.
  arXiv  Detail & Related papers  (2026-05-28T04:27:20Z)
• MemGuard: Preventing Memory Contamination in Long-Term Memory-Augmented Large Language Models [56.31411457917676]
  We introduce MemGuard, a type-aware memory framework that preserves functional memory boundaries during memory construction and retrieval.<n>Across hallucination and long-horizon conversation benchmarks, MemGuard improves memory reliability by up to 28.27% while retrieving up to 5.8x fewer memory tokens than prior methods.
  arXiv  Detail & Related papers  (2026-05-27T06:04:19Z)
• Is Agent Memory a Database? Rethinking Data Foundations for Long-Term AI Agent Memory [3.263386002412657]
  Long-running AI agents need persistent memory.<n>Current agent memory systems and database paradigms treat memory as storage.<n>In our vision, long-term agent memory is a new data-management workload.
  arXiv  Detail & Related papers  (2026-05-25T18:22:42Z)
• Is One Score Enough? Rethinking the Evaluation of Sequentially Evolving LLM Memory [50.857546269660276]
  We introduce SeqMem-Eval, a diagnostic evaluation framework for sequentially evolving large language models (LLMs) memory.<n>Rather than focusing only on final performance, SeqMem-Eval evaluates how memory states evolve, generalize, consolidate experience, and retain useful information during sequential inference.
  arXiv  Detail & Related papers  (2026-05-14T20:15:22Z)
• MemoryArena: Benchmarking Agent Memory in Interdependent Multi-Session Agentic Tasks [55.145729491377374]
  Existing evaluations of agents with memory typically assess memorization and action in isolation.<n>We introduce MemoryArena, a unified evaluation gym for benchmarking agent memory in multi-session Memory-Agent-Environment loops.<n> MemoryArena supports evaluation across web navigation, preference-constrained planning, progressive information search, and sequential formal reasoning.
  arXiv  Detail & Related papers  (2026-02-18T09:49:14Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.