Anatomy of Agentic Memory: Taxonomy and Empirical Analysis of Evaluation and System Limitations
Organizations: University of Texas at Dallas · University of California, Davis · Texas A&M University
Abstract
Agentic memory systems enable large language model (LLM) agents to maintain state across long interactions, supporting long-horizon reasoning and personalization beyond fixed context windows. Despite rapid architectural development, the empirical foundations of these systems remain fragile: existing benchmarks are often underscaled, evaluation metrics are misaligned with semantic utility, performance varies significantly across backbone models, and system-level costs are frequently overlooked. This survey presents a structured analysis of agentic memory from both architectural and system perspectives. We first introduce a concise taxonomy of MAG systems based on four memory structures. Then, we analyze key pain points limiting current systems, including benchmark saturation effects, metric validity and judge sensitivity, backbone-dependent accuracy, and the latency and throughput overhead introduced by memory maintenance. By connecting the memory structure to empirical limitations, this survey clarifies why current agentic memory systems often underperform their theoretical promise and outlines directions for more reliable evaluation and scalable system design.
Figures & tables
| Survey | Taxonomy Focus | Memory Mgmt. & Policy | Benchmark Saturation | Metric Validity | Backbone Sensitivity | System Cost & Latency |
|---|---|---|---|---|---|---|
| The AI Hippocampus Jia et al. (2026) | Brain-inspired: implicit, explicit, agentic | (✓) | × | × | × | × |
| Memory in the Age of AI Agents Hu et al. (2025) | Forms–functions–dynamics | (✓) | × | × | × | × |
| Toward Efficient Agents Yang et al. (2026b) | Efficiency-focused: memory, tool learning, planning | ✓ | × | × | × | ✓ |
| Rethinking Memory Mechanisms Huang et al. (2026) | Substrate–cognition–subject | ✓ | (✓) | × | × | × |
| From Storage to Experience Luo et al. (2026) | Evolutionary: storage–reflection–experience | (✓) | × | × | × | × |
| Graph-based Agent Memory Yang et al. (2026a) | Graph-oriented lifecycle | ✓ | (✓) | × | × | × |
| Benchmark | Scalability Dimensions | Theoretical Saturation Risk | ||
|---|---|---|---|---|
| Avg. Volume | Interaction Depth | Entity Diversity | ||
| HotpotQA Yang et al. (2018) | 1k Tokens | Single Turn | Low | High (Trivial for Context Window) |
| LoCoMo Maharana et al. (2024) | 20k Tokens | 35 Sessions | High | Moderate (Requires Reasoning) |
| LongMemEval-S Wu et al. (2024) | 103k Tokens | 5 Core Abilities | High | Moderate (Borderline) |
| LongMemEval-M Wu et al. (2024) | 1M Tokens | 5 Core Abilities | High | Low (Requires External Memory) |
| MemBench Tan et al. (2025a) | 100k Tokens | Fact/Reflection | Medium | High (Fits in 128k Window) |
| Method | Lexical Metric | Semantic Judge Score (Rank) | |||
|---|---|---|---|---|---|
| F1-Score | Rank | Prompt 1 (MAGMA) | Prompt 2 (Nemori) | Prompt 3 (SimpleMem) | |
| AMem Xu et al. (2025b) | 0.116 | 5 | 0.480 (4) | 0.512 (4) | 0.482 (4) |
| MemoryOS Kang et al. (2025a) | 0.413 | 3 | 0.553 (3) | 0.589 (3) | 0.552 (3) |
| Nemori Nan et al. (2025) | 0.502 | 1 | 0.602 (2) | 0.781 (1) | 0.649 (2) |
| MAGMA Jiang et al. (2026a) | 0.467 | 2 | 0.670 (1) | 0.741 (2) | 0.665 (1) |
| SimpleMEM Liu et al. (2026) | 0.268 | 4 | 0.294 (5) | 0.298 (5) | 0.289 (5) |
| Backbone | Method | Answer Score | Format Error |
|---|---|---|---|
| gpt-4o-mini | SimpleMem | 0.289 | 1.20% |
| Nemori | 0.781 | 17.91% | |
| Qwen-2.5-3B | SimpleMem | 0.102 | 4.82% |
| Nemori | 0.447 | 30.38% |
| Method | User-Facing Latency (per turn) | Construction Cost (Offline) | |||
| Retrieval ( ) | Generation ( ) | Total (s) | Time (h) | Tokens (k) | |
| Full Context | N/A | 1.726 | 1.726 | N/A | N/A |
| LOCOMO Maharana et al. (2024) | 0.415 | 0.368 | 0.783 | 0.86 | 1,623 |
| AMem Xu et al. (2025b) | 0.062 | 1.119 | 1.181 | 15.00 | 1,486 |
| MemoryOS Kang et al. (2025a) | 31.247 | 1.125 | 32.372 | 7.83 | 4,043 |
| Nemori Nan et al. (2025) | 0.254 | 0.875 | 1.129 | 3.25 | 7,044 |
Appendix figures & tables4 assets
Supplementary material from the paper’s appendix.
Appendix
| System | Build Strategy (Memory Construction) | Query Strategy | Answer Strategy (Synthesis) |
|---|---|---|---|
| MemoryOS | Profile-based (User profiling, Knowledge extraction) | N/A (Direct Semantic Search) | Role-playing & Profile-enriched |
| AMem | Flat/Turn-based (Content analysis) | LLM Keyword Extraction | Retrieved Memory Context |
| Nemori | Episodic (Boundary detection, Episode generation) | N/A (Direct Semantic Search) | Episode-based Retrieval |
| MAGMA | Graph-based (Event extraction, Multi-hop reasoning) | Multi-hop Entity Parsing | Graph Traversal Synthesis |
| SimpleMem | Minimalist/Turn-level | Keyword Generation | Context-based |
| Method | Embedding Model | LLM Temp. | Final Answer Top- | System-Specific Defaults (Max Tokens & Structure) |
|---|---|---|---|---|
| Full Context | N/A | 0.3 | N/A | Max Tokens: 128k ( gpt-4o-mini ) |
| LOCOMO | MiniLM-L6-v2 | 0.3 | 10 | Max Tokens: Default; Buffer Size: Default |
| AMem | MiniLM-L6-v2 | 0.3 | 10 | Max Tokens: Default; Keyword Extractor Temp: Default |
| MemoryOS | MiniLM-L6-v2 | 0.3 | 10 | Max Tokens: Default; Update Frequency: Default |
| Nemori | MiniLM-L6-v2 | 0.3 | 10 | Max Tokens: Default; Boundary Temp: 0.1 |
| MAGMA | MiniLM-L6-v2 | 0.3 | 10 | Max Tokens: Default; Consolidation Threshold: Default |
| Method | Memory Structure | Update Policy | Retrieval Scope |
|---|---|---|---|
| A-MEM | Linked Node Graph (Atomic Units + Tags) | Evolutionary: LLM-based node rewriting & dynamic linking | Dense Embedding Similarity (Top- ) |
| MemoryOS | Hierarchical Tiers (STM LTM) | Rule-based: Frequency/Recency-based promotion | Cascading Hierarchy Search |
| MAGMA | Multi-relational Graph + Vector Index | Asynchronous: Dual-stream consolidation (Long-term) | Intent-guided Subgraph Traversal |
| Nemori | Dual Memory (Episodic Tree + Semantic Graph) | Gradient-inspired: Contextual memory modification | Hybrid (Top- Episodes + Semantic Facts) |
| SimpleMem | Hybrid Index (Dense/Sparse) of Compressed Units | Synchronous: On-the-fly synthesis & deduplication | Planner-guided Multi-view Search |
| Query & Gold Truth | Model Answer | Failure Type | F1 | Judge | Analysis |
| Q: What is the duration of the event? Gold: 18 days | The total duration was 18 days. | Surface Variation | 0.50 | 1.00 | Additional phrasing lowers lexical precision despite identical meaning. |
| Q: What time does the event start? Gold: 14:00 | 2 PM | Semantic Equivalence Gap | 0.00 | 1.00 | Equivalent time representations yield zero token overlap. |
| Q: Describe the price level. Gold: cheap | inexpensive | Semantic Equivalence Gap | 0.00 | 1.00 | Synonym substitution is not captured by lexical matching. |
| Q: Is the software compatible with Mac? Gold: compatible with Mac | not compatible with Mac | Polarity Flip | 0.857 | 0.00 | Negation reverses meaning while preserving token overlap. |
| Q: Who completed the project? Gold: John completed the project | Sarah completed the project | Entity Drift | 0.75 | 0.00 | Incorrect entity maintains structure but changes semantics. |
| Q: How many items were included? Gold: three items | five items | Entity Drift | 0.50 | 0.00 | Numerical substitution is partially rewarded due to shared tokens. |