arXiv AI
Selective Forgetting: A Graph-Based Memory Framework for Long-Term LLM Agents
Read the original on arXiv AI →The Flow has not summarised this story yet — read it at arXiv AI.
Related stories
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.
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.