From Lossy to Verified: A Provenance-Aware Tiered Memory for Agents
Qiming Zhu, Shunian Chen, Rui Yu, Zhehao Wu, Benyou Wang

TL;DR
This paper introduces TierMem, a provenance-aware tiered memory system for long-horizon agents that balances the use of summaries and raw logs to improve verifiability, reduce latency, and lower token consumption.
Contribution
TierMem is a novel framework that dynamically retrieves evidence from summaries or raw logs, ensuring verifiable answers while optimizing performance.
Findings
Achieves 0.851 accuracy on LoCoMo, close to raw-only 0.873
Reduces input tokens by 54.1%
Lowers latency by 60.7%
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsScientific Computing and Data Management · Machine Learning in Materials Science · Distributed and Parallel Computing Systems
