mlsanityData to 14 Oct 2026

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

arXiv 2608.03699 ↗First posted 4 Aug 2026cs.AIcited by 1

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 27 of its 42 references that are in the map. First posted on arXiv 4 Aug 2026.

Builds on

27 of 42 references.

References · 27

  1. 2020Retrieval-Augmented Generation for Knowledge-Intensive NLP Taskscited by 9,297
  2. 2020Dense Passage Retrieval for Open-Domain Question Answeringcited by 3,824
  3. 2023Generative Agents: Interactive Simulacra of Human Behaviorcited by 3,568
  4. 2022Locating and Editing Factual Associations in GPTcited by 2,691
  5. 2020REALM: Retrieval-Augmented Language Model Pre-Trainingcited by 2,141
  6. 2023The Rise and Potential of Large Language Model Based Agents: A Surveycited by 1,439
  7. 2018FEVER: a large-scale dataset for Fact Extraction and VERificationcited by 1,375
  8. 2023FActScore: Fine-grained Atomic Evaluation of Factual Precision in Long Form Text Generationcited by 1,282
  9. 2020Leveraging Passage Retrieval with Generative Models for Open Domain Question Answeringcited by 1,210
  10. 2020ColBERT: Efficient and Effective Passage Search via Contextualized Late Interaction over BERTcited by 1,178
  11. 2025A-MEM: Agentic Memory for LLM Agentscited by 1,063
  12. 2022Mass-Editing Memory in a Transformercited by 1,001
15 more
  1. 2022Atlas: Few-shot Learning with Retrieval Augmented Language Modelscited by 952
  2. 2023ExpeL: LLM Agents Are Experiential Learnerscited by 876
  3. 2024LongMemEval: Benchmarking Chat Assistants on Long-Term Interactive Memorycited by 707
  4. 2024A Survey on the Memory Mechanism of Large Language Model based Agentscited by 634
  5. 2021Editing Factual Knowledge in Language Modelscited by 553
  6. 2022Memory-Based Model Editing at Scalecited by 447
  7. 2021Time-Aware Language Models as Temporal Knowledge Basescited by 296
  8. 2025MemAgent: Reshaping Long-Context LLM with Multi-Conv RL-based Memory Agentcited by 246
  9. 2017Know-Evolve: Deep Temporal Reasoning for Dynamic Knowledge Graphscited by 149
  10. 2024MemoRAG: Boosting Long Context Processing with Global Memory-Enhanced Retrieval Augmentationcited by 119
  11. 2020Tensor Decompositions for temporal knowledge base completioncited by 115
  12. 2019Diachronic Embedding for Temporal Knowledge Graph Completioncited by 104
  13. 2024Belief Revision: The Adaptability of Large Language Models Reasoningcited by 30
  14. 2026A Survey on Long-Term Memory Security in LLM Agents: Attacks, Defenses, and Governance Across the Memory Lifecyclecited by 27
  15. 2024Red Teaming Language Models for Processing Contradictory Dialoguescited by 3

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 1.

1 paper.