mlsanityData to 7 Oct 2026

To Know is to Construct: Schema-Constrained Generation for Agent Memory

arXiv 2604.20117 ↗First posted 22 Apr 2026cs.CLcited by 1

On the map: LLM agents and tool use → Agent memory systems

Abstract (arXiv)

Constructivist epistemology argues that knowledge is actively constructed rather than passively copied. Despite the generative nature of Large Language Models (LLMs), most existing agent memory systems are still based on dense retrieval. However, dense retrieval heavily relies on semantic overlap or entity matching within sentences. Consequently, embeddings often fail to distinguish instances that are semantically similar but contextually distinct, introducing substantial noise by retrieving context-mismatched entries. Conversely, directly employing open-ended generation for memory access risks "Structural Hallucination" where the model generates memory keys that do not exist in the memory, leading to lookup failures. Inspired by this epistemology, we posit that memory is fundamentally organized by cognitive schemas, and valid recall must be a generative process performed within these schematic structures. To realize this, we propose SCG-MEM, a schema-constrained generative memory architecture. SCG-MEM reformulates memory access as Schema-Constrained Generation. By maintaining a dynamic Cognitive Schema, we strictly constrain LLM decoding to generate only valid memory entry keys, providing a formal guarantee against structural hallucinations. To support long-term adaptation, we model memory updates via assimilation (grounding inputs into existing schemas) and accommodation (expanding schemas with novel concepts). Furthermore, we construct an Associative Graph to enable multi-hop reasoning through activation propagation. Experiments on the LoCoMo benchmark show that SCG-MEM substantially improves performance across all categories over retrieval-based baselines.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Placed in Agent memory systems, one of 16 directions in LLM agents and tool use. Builds on 21 of its 23 references that are in the map. First posted on arXiv 22 Apr 2026.

Builds on

21 of 23 references.

Closest ancestors · 4

Same direction, newest first

  1. 2025CAM: A Constructivist View of Agentic Memory for LLM-Based Reading Comprehension7 Oct
  2. 2025A-MEM: Agentic Memory for LLM Agents17 Feb
  3. 2024Evaluating Very Long-Term Conversational Memory of LLM Agents27 Feb
  4. 2024A Human-Inspired Reading Agent with Gist Memory of Very Long Contexts15 Feb

Other references · 17

  1. 2024The Llama 3 Herd of Modelscited by 14,192
  2. 2023A Survey on Hallucination in Large Language Models: Principles, Taxonomy, Challenges, and Open Questionscited by 1,582
  3. 2024From Local to Global: A Graph RAG Approach to Query-Focused Summarizationcited by 1,411
  4. 2023MemGPT: Towards LLMs as Operating Systemscited by 1,295
  5. 2024Qwen2.5-Coder Technical Reportcited by 1,151
  6. 2024M3-Embedding: Multi-Linguality, Multi-Functionality, Multi-Granularity Text Embeddings Through Self-Knowledge Distillationcited by 1,050
  7. 2023MemoryBank: Enhancing Large Language Models with Long-Term Memorycited by 539
  8. 2024RAPTOR: Recursive Abstractive Processing for Tree-Organized Retrievalcited by 519
  9. 2021PICARD: Parsing Incrementally for Constrained Auto-Regressive Decoding from Language Modelscited by 402
  10. 2017Lexically Constrained Decoding for Sequence Generation Using Grid Beam Searchcited by 234
  11. 2018Fast Lexically Constrained Decoding with Dynamic Beam Allocation for Neural Machine Translationcited by 181
  12. 2022Synchromesh: Reliable code generation from pre-trained language modelscited by 156
5 more
  1. 2024From Isolated Conversations to Hierarchical Schemas: Dynamic Tree Memory Representation for LLMscited by 77
  2. 2024Graph-constrained Reasoning: Faithful Reasoning on Knowledge Graphs with Large Language Modelscited by 47
  3. 2024Decoding on Graphs: Faithful and Sound Reasoning on Knowledge Graphs through Generation of Well-Formed Chainscited by 20
  4. 2024RetroLLM: Empowering Large Language Models to Retrieve Fine-grained Evidence within Generationcited by 20
  5. 2025Dense Retrievers Can Fail on Simple Queries: Revealing The Granularity Dilemma of Embeddingscited by 2

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 1.

1 paper.

Similar, not cited

Close in wording, no citation either way

  1. 2025MemGen: Weaving Generative Latent Memory for Self-Evolving Agents
  2. 2026ByteRover: Agent-Native Memory Through LLM-Curated Hierarchical Context
  3. 2026Continuum Memory Architectures for Long-Horizon LLM Agents
  4. 2025Hindsight is 20/20: Building Agent Memory that Retains, Recalls, and Reflects
  5. 2026Evaluating Memory Structure in LLM Agents
  6. 2026MemGuard: Preventing Memory Contamination in Long-Term Memory-Augmented Large Language Models
  7. 2026Memory for Autonomous LLM Agents:Mechanisms, Evaluation, and Emerging Frontiers
  8. 2026Temporal Validity in Retrieval Memory: Eliminating Stale-Fact Errors for AI Agents over Evolving Knowledge