From Lossy to Verified: A Provenance-Aware Tiered Memory for Agents

• URL: http://arxiv.org/abs/2602.17913v1
• Date: Fri, 20 Feb 2026 00:21:37 GMT
• Title: From Lossy to Verified: A Provenance-Aware Tiered Memory for Agents
• Abstract summary: TierMem casts retrieval as an inference-time evidence allocation problem.<n>On LoCoMo, TierMem achieves 0.851 accuracy while reducing input tokens by 54.1% and latency by 60.7%.
• Score: 26.35084166166742
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Long-horizon agents often compress interaction histories into write-time summaries. This creates a fundamental write-before-query barrier: compression decisions are made before the system knows what a future query will hinge on. As a result, summaries can cause unverifiable omissions -- decisive constraints (e.g., allergies) may be dropped, leaving the agent unable to justify an answer with traceable evidence. Retaining raw logs restores an authoritative source of truth, but grounding on raw logs by default is expensive: many queries are answerable from summaries, yet raw grounding still requires processing far longer contexts, inflating token consumption and latency. We propose TierMem, a provenance-linked framework that casts retrieval as an inference-time evidence allocation problem. TierMem uses a two-tier memory hierarchy to answer with the cheapest sufficient evidence: it queries a fast summary index by default, and a runtime sufficiency router Escalates to an immutable raw-log store only when summary evidence is insufficient. TierMem then writes back verified findings as new summary units linked to their raw sources. On LoCoMo, TierMem achieves 0.851 accuracy (vs.0.873 raw-only) while reducing input tokens by 54.1\% and latency by 60.7%.

Related papers

• Stop When Memory Suffices: Evidence-Conditioned Progressive Execution for LLM Agents [5.4775608854724345]
  Existing memory systems either compress and structure histories for efficient access or perform deep research over broader trajectories.<n>This raises a key question: can a memory system achieve strong answer quality while maintaining low online latency?<n>We introduce Router-Mem, an evidence-conditioned progressive execution framework for long-horizon agent memory.
  arXiv  Detail & Related papers  (2026-08-02T14:49:24Z)
• DRNOISE: Benchmarking Deep Research Agents in Misleading Evidence Environments [51.049999642138]
  We introduce DRNOISE, a 100-task benchmark for answer recovery under misleading evidence.<n>Each task has a unique gold answer supported by two corroborating indirect record chains; the paired noisy condition adds one plausible document that states a conflicting answer directly.<n>Across agents with strong clean-task performance, this single intervention causes 66-88 percentage-point accuracy drops.
  arXiv  Detail & Related papers  (2026-07-19T15:20:40Z)
• Memory-Managed Long-Context Attention: A Preliminary Study of Editable Request-Local Memory [0.5371337604556311]
  We study memory-managed long-context attention, a research route that separates a fast recurrent or sparse backbone from explicit editable request-local memory slots.<n>Across structured synthetic tasks, token/chunk/sequence bridges, generated natural language, and local frozen-model diagnostics, pure fixed-state or pure sparse methods fail some overwrite, version, anti-pollution, or no-write-signal cases.
  arXiv  Detail & Related papers  (2026-06-27T11:38:43Z)
• Eywa: Provenance-Grounded Long-Term Memory for AI Agents [0.0]
  Existing memory systems collapse source evidence, extracted facts, retrieved context, and answer policy into one opaque prompt path.<n>We present Eywa, a provenance-grounded memory architecture built around evidence before belief.
  arXiv  Detail & Related papers  (2026-05-29T02:56:35Z)
• Mitigating Provenance-Role Collapse in Long-Term Agents via Typed Memory Representation [33.47493976010677]
  We propose MemIR, a typed Memory Intermediate Representation that operationalizes source monitoring as a structural constraint.<n>MemIR writes long-term memory into grounded atoms that separate raw evidence, retrieval cues, and truth-bearing claims.<n>Experiments on LoCoMo and BEAM-100K demonstrate that MemIR consistently outperforms existing memory baselines.
  arXiv  Detail & Related papers  (2026-05-25T13:56:31Z)
• QUARK: Robust Retrieval under Non-Faithful Queries via Query-Anchored Aggregation [2.505352949111876]
  QUARK is a training-free framework for robust retrieval under non-faithful queries.<n>The design enables QUARK to improve recall and ranking quality without sacrificing robustness.
  arXiv  Detail & Related papers  (2026-01-28T21:14:49Z)
• Your Dense Retriever is Secretly an Expeditious Reasoner [12.123445960145693]
  We propose Adaptive Query Reasoning (AdaQR), a hybrid query rewriting framework.<n>AdaQR reduces reasoning cost by 28% while preserving-or even improving-retrieval performance by 7%.
  arXiv  Detail & Related papers  (2025-09-27T16:50:03Z)
• ImpliRet: Benchmarking the Implicit Fact Retrieval Challenge [50.93758649363798]
  Impliret is a benchmark that shifts the reasoning challenge to document-side processing.<n>We evaluate a range of sparse and dense retrievers, all of which struggle in this setting.
  arXiv  Detail & Related papers  (2025-06-17T11:08:29Z)
• ReasonIR: Training Retrievers for Reasoning Tasks [139.54343970560103]
  ReasonIR-8B is the first retriever specifically trained for general reasoning tasks.<n>It achieves a new state-of-the-art of 29.9 nDCG@10 without reranker and 36.9 nDCG@10 with reranker on BRIGHT, a widely-used information retrieval benchmark.
  arXiv  Detail & Related papers  (2025-04-29T09:49:28Z)
• Collapse of Dense Retrievers: Short, Early, and Literal Biases Outranking Factual Evidence [56.09494651178128]
  Retrieval models are commonly used in Information Retrieval (IR) applications, such as Retrieval-Augmented Generation (RAG)<n>We quantify the impact of biases, such as a preference for shorter documents, on retrievers like Dragon+ and Contriever.<n>We uncover major vulnerabilities, showing retrievers favor shorter documents, early positions, repeated entities, and literal matches, all while ignoring the answer's presence!
  arXiv  Detail & Related papers  (2025-03-06T23:23:13Z)
• Evidence Contextualization and Counterfactual Attribution for Conversational QA over Heterogeneous Data with RAG Systems [4.143039012104666]
  Retrieval Augmented Generation (RAG) works as a backbone for interacting with an enterprise's own data via Conversational Question Answering (ConvQA)<n>In this work, we demonstrate RAGONITE, a RAG system that remedies the above concerns by: (i) contextualizing evidence with source metadata and surrounding text; and (ii) computing counterfactual attribution.
  arXiv  Detail & Related papers  (2024-12-13T21:28:17Z)
• FIRE: Fact-checking with Iterative Retrieval and Verification [63.67320352038525]
  FIRE is a novel framework that integrates evidence retrieval and claim verification in an iterative manner.<n>It achieves slightly better performance while reducing large language model (LLM) costs by an average of 7.6 times and search costs by 16.5 times.<n>These results indicate that FIRE holds promise for application in large-scale fact-checking operations.
  arXiv  Detail & Related papers  (2024-10-17T06:44:18Z)
• Fact Checking Beyond Training Set [64.88575826304024]
  We show that the retriever-reader suffers from performance deterioration when it is trained on labeled data from one domain and used in another domain. We propose an adversarial algorithm to make the retriever component robust against distribution shift. We then construct eight fact checking scenarios from these datasets, and compare our model to a set of strong baseline models.
  arXiv  Detail & Related papers  (2024-03-27T15:15:14Z)
• Phrase Retrieval for Open-Domain Conversational Question Answering with Conversational Dependency Modeling via Contrastive Learning [54.55643652781891]
  Open-Domain Conversational Question Answering (ODConvQA) aims at answering questions through a multi-turn conversation. We propose a method to directly predict answers with a phrase retrieval scheme for a sequence of words.
  arXiv  Detail & Related papers  (2023-06-07T09:46:38Z)

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.