arXiv AI
Jul 31
A Graph-Native Bitemporal Memory Store for Conversational AI Agents
arXiv:2607. 26520v1 Announce Type: cross Abstract: Conversational AI agents commonly lack persistent memory across sessions.
Selective Forgetting: A Graph-Based Memory Framework for Long-Term LLM Agents
Related stories
arXiv Computation and Language
3d ago
Agent Zero Memory: Provenance-Aware Long-Term Memory for LLM Agents
Agent Zero Memory is a provenance‑aware long‑term memory system for large language model agents that distills user interactions into three parallel memory structures: an episodic timeline, an associative entity‑event knowledge graph, and a semantic, citation‑locked hierarchical documentary memory. Retrieval is performed via an intent gate, source router, and concurrent searches across the three systems, producing integrated, cited answers that exclude fabrication and require evidence the reader has opened. The system achieves state‑of‑the‑art performance on LongMemEval (95.60%) and LoCoMo (93.60%) while offering a favorable accuracy‑cost‑latency trade‑off across multiple backbone LLMs.
Hugging Face Trending Papers
Jul 29
A Graph-Native Bitemporal Memory Store for Conversational AI Agents
Conversational AI agents commonly lack persistent memory across sessions. The obvious fixes like injecting full chat histories into the context window, or delegating to a third-party memory service, either exhaust the model's context budget or send personal data through infrastructure the user does not control.
arXiv Computation and Language
4d ago
Entity-Memory Graph Retrieval Improves Evidence Coverage in Long-Conversation Question Answering
Entity-Memory graph retrieval preserves dialogue turns as verbatim memory nodes, links repeated mentions via shared entities, and connects adjacent memories with chronological edges. During retrieval, the system gates through entities, fuses semantics, and performs one‑hop chronological recovery before dense backfill, allowing it to keep neighboring memories that dense cosine ranking might miss. On 1,986 questions from ten LoCoMo conversations, this graph retrieval method increases official evidence recall at top‑k 25 from 79.7468 % to 84.4842 %, with the advantage extending from top‑k 5 to 50, though it does not improve overall final‑answer F1.
arXiv AI
Aug 11
SodaMem: Evidence-Grounded Temporal Graph Memory for LLM Agents
arXiv:2608. 08055v1 Announce Type: new Abstract: Large language model (LLM) agents that assist users over weeks of conversation must remember what is currently true, not merely what was once said.
arXiv AI
Jul 21
Accurate and Efficient Long-Term Memory for LLM Agents
arXiv:2607. 16211v1 Announce Type: new Abstract: LLM agents augmented with persistent memory can recall past interactions, but existing systems suffer from two limitations: flat, unstructured storage loses relational context needed for multi-hop and temporal reasoning, and reliance on expensive LLM-based classification makes them impractical for latency-sensitive deployment.
arXiv AI
Jun 10
Less Context, More Accuracy: A Bi-Temporal Memory Engine for LLM Agents Where a Lean Retrieved Context Beats the Full History
arXiv:2606. 09900v1 Announce Type: cross Abstract: Long-term memory is the missing layer for LLM agents: across sessions they forget, and the common workaround -- replaying the whole history into the prompt -- is expensive, slow, and, as distractors accumulate, less accurate.
arXiv AI
Jun 12
Learning What to Remember: A Cognitively Grounded Multi-Factor Value Model for Agentic Memory
arXiv:2606. 12945v1 Announce Type: new Abstract: Long-running LLM agents accumulate interaction histories far larger than any context window, forcing a standing decision: what to encode deeply, what to forget, and what to retrieve under a fixed memory budget.
arXiv Machine Learning
Aug 27
A Storage-Retrieval Gap in Parametric Knowledge Graph Memory
The paper investigates a parametric approach to knowledge graph memory by compiling each entity into a LoRA adapter, enabling zero‑cost query-time retrieval via weight injection. On the MetaQA dataset, these adapters encode context‑free factual knowledge, improving exact‑match scores by up to +0.243 over a base model and achieving an oracle gap of +0.283. However, the stored knowledge is not recoverable through similarity or embedding‑based methods, indicating that knowledge is stored locally and does not transfer across semantically neighboring entities.
arXiv AI
Jul 23
Profile-Graph Memory for LLM Agents: Implicit Cross-Entity Traversal through Narrative Profiles
arXiv:2607. 19359v1 Announce Type: new Abstract: Long-term memory is essential for LLM agents that interact across sessions, yet current memory benchmarks primarily evaluate single-hop recall, leaving multi-hop association largely unmeasured.
arXiv AI
Jun 15
Verbatim Chunks Beat Extracted Artifacts: A Controlled Ablation of Memory Representations for Long LLM Conversations
arXiv:2601. 00821v3 Announce Type: replace Abstract: A growing class of conversational-memory systems compresses dialogue history into structured artifacts -- extracted facts, decisions, or events -- on the premise that distilled structure retrieves better than raw text.
arXiv AI
Jun 26
Temporal Validity in Retrieval Memory: Eliminating Stale-Fact Errors for AI Agents over Evolving Knowledge
arXiv:2606. 26511v1 Announce Type: cross Abstract: Retrieval-augmented generation (RAG) gives agents access to accumulated knowledge, but has no model of time.