📚 Agent Memory Literature Review

2026-07-31 | Core paper: GAM (Hierarchical Graph Memory)

📖 Contents

Executive Overview

This report examines GAM: Hierarchical Graph-based Agentic Memory for LLM Agents(Wu et al., ACL 2026). The paper addresses the central tension in long-term LLM-agent memory—the trade-off between rapid adaptation and knowledge stability—with a hierarchical graph architecture. By explicitly separating memory encoding from memory consolidation, GAM avoids the noise contamination of streaming systems while retaining the reasoning advantages of structured memory. It substantially improves on strong baselines on LoCoMo and LongDialQA: +4.62% F1 over Mem0, with particularly strong gains in multi-hop reasoning (+2.5% F1) and temporal reasoning (+7.75% F1).

Key Innovations:
  • Two-stage separation: The Episodic Progress Graph (EPG) captures information in real time, while the Thematic Association Network (TAN) consolidates it on demand at semantic transitions
  • Semantically driven transitions: Changes in content automatically trigger consolidation, without relying on fixed time windows
  • Traceability by design: The concept layer can drill down into original events to support fine-grained reasoning

Part I: In-Depth Analysis of the Core Paper

1.1 Problem Definition and Motivation

Existing memory systems for LLM agents face a trade-off between two extremes:

Streaming Systems (MemGPT, Mem0, MemoryOS)

Discrete Structured Systems (GraphRAG, StructRAG, Early AriGraph)

✓ Assessment of the Argument: The experimental analysis reports 32.86% F1 for a purely streaming approach on LoCoMo multi-hop reasoning. Structured approaches are stable but have limited reasoning ability. The key gap is the missing decision about which information should enter persistent structures.

1.2 Methodology and Architecture

A Two-Stage Memory Lifecycle

⚙️ GAM's Two-Stage Design
Stage I: Episodic Buffering (EPG) Input: Real-time dialogue Processing: Event identification → temporal ordering Property: Local temporary storage Advantages: Flexibility and low latency Risk: Noise contamination Capacity: Sliding window (50 messages) Semantics Transition? Stage II: Semantic Consolidation (TAN) Input: Transition events Processing: Projection mapping → concept clustering Property: Global persistent storage Advantages: Stability and reasoning support Cost: Triggered only at transitions Capacity: Fixed limit (500 nodes)

Hierarchical Storage and Retrieval

Level Scope Granularity Update frequency Use
TAN (Thematic Association Network) Global, across conversations Concept level (abstract) Low (only at transitions) Reasoning and concept retrieval
EPG (Episodic Progress Graph) Local, current session Event level (concrete) High (every message) Episode reconstruction and temporal reasoning

1.3 Experimental Results

Main Performance Comparison

📊 LoCoMo Benchmark Comparison (F1 Scores)
0 10 20 30 40 Mem0 35.4 MemoryOS 37.2 AriGraph 37.9 GAM 40.0 F1 score Summary of gains vs Mem0: +4.62% vs MemoryOS: +2.82% vs AriGraph: +2.11%
Mem0
MemoryOS
AriGraph
GAM (this paper)

Ablation Study

Configuration F1 (LoCoMo) Δ vs Full Explanation
Full GAM 40.00 — Benchmark
w/o EPG 25.06 -14.94 Without episodic buffering: Complete reliance on TAN loses new information
w/o SSM 32.58 -7.42 Without semantic transition detection: Immediate consolidation of every event introduces noise
w/o TAN 35.07 -4.93 Without the global thematic network: Fragmented knowledge makes reasoning difficult
w/o MFR 35.94 -4.06 Semantic similarity only: Role, temporal, and confidence information is lost
✓ Key Observation: EPG has the largest effect (−14.94), confirming episodic isolation as the core innovation. SSM is secondary but important (−7.42), indicating that carefully designed transition detection does reduce noise.

1.4 Assessment of Value

Key Contributions

1.5 Critical Limitations

⚠️ Robustness: The semantic-transition threshold (0.65) is tuned on LoCoMo; cross-domain and cross-language generalization are unverified. Behavior under adversarial or noisy input is untested.
⚠️ Insufficient Ablation Analysis: No sensitivity analysis for the SSM threshold, no evaluation of EPG window size, and no cost–benefit comparison of delayed versus immediate consolidation.
⚠️ Limited Evaluation Coverage: LoCoMo and LongDialQA both concern dialogue, excluding code generation and long-form writing. Only Qwen 2.5-7B is tested, without larger models such as GPT-4 or Claude.
⚠️ Reproducibility: Code is not released, semantic-transition prompts and rules are undisclosed, and hyperparameter tuning is unexplained.

Part II: Related Work and Its Evolution

2.1 MemGPT: Foundations of Streaming Memory (Oct 2023)

Problem: Fixed LLM context windows limit continuous dialogue length; simple truncation loses history.

Approach: Treat the LLM as an operating system with virtual context management, letting it actively decide what remains in context.

Unresolved issues:

GAM's Response: Introduce a transition detector instead of having the LLM manipulate memory directly, separating encoding from consolidation to reduce noise while retaining flexibility.

2.2 Mem0: Token-Efficient Extraction and Updating (Apr 2025)

Problem: MemGPT's cost problem persists; production systems need more efficient memory management.

Approach: A two-stage loop (extract → update) uses an LLM to identify facts worth storing and decide ADD/UPDATE/DELETE/NOOP for each entry.

Unresolved issues:

GAM's Response: TAN supplies global organization, EPG explicitly maintains a timeline, and multifactor retrieval assigns weight to recency.

2.3 MemoryOS: A Three-Level Hierarchy (EMNLP 2025, Jun 2025)

Problem: A single flat memory cannot distinguish a minor event today from an important event a month ago.

Approach: An operating-system-inspired short-/mid-/long-term hierarchy automatically assigns information using time windows.

Unresolved issues:

GAM's Improvements: Semantically driven transitions replace fixed time windows; cross-level associations are preserved, with TAN nodes recording their source EPG fragments.

2.4 AriGraph: A Knowledge-Graph World Model and Episodic Memory (IJCAI 2025, Jul 2024)

Problem: Streaming-only approaches reason poorly, while graph-only approaches adapt slowly; a balance is needed.

Approach: Build a dynamic knowledge graph (world model) plus timestamped event logs (episodic memory), supporting both concept- and event-level reasoning.

Unresolved issues:

Comparison with GAM: GAM's explicit two-stage design is clearer than AriGraph's continuous updates; temporal performance improves (+11% F1), and consolidation is lighter.

2.5 Summary of the Evolution

MemGPT (Oct 2023)  Starting point for streaming memory
    ↓ Problems: Noise and high cost
    |
Mem0 (Apr 2025)    Token-efficient extraction
    ↓ Problems: Missing structure, weak temporal information
    |
    ├─→ MemoryOS (Jun 2025)    Three-level hierarchy
    |       ↓ Heuristic transitions, still weak reasoning
    |
    └─→ AriGraph (IJCAI 2025)  Dynamic knowledge graph
            ↓ Implicit transitions, high cost

            ↓ Integration and improvement ↓

GAM (ACL 2026)     [THIS REPORT'S CORE PAPER]
    ✓ Explicit encoding–consolidation separation
    ✓ Semantic transitions (versus temporal heuristics)
    ✓ Cross-level traceability (versus implicit connections)
    ✓ Temporal awareness and lightweight consolidation
            

Part III: Technical Evolution

3.1 Evolution of the Design Space

Dimension Early (2023) Transition (2024–2025) Current (2026)
Information organization Streaming list Hybrid structure Explicit hierarchical graph
Decision maker LLM itself Extraction function Transition detector
Temporal handling Implicit ordering Fixed windows Native timeline + multiple factors

3.2 Three Tensions Driving the Evolution

Tension 1: Responsiveness vs Stability

MemGPT favors responsiveness (frequent saving → noise); purely structured approaches favor stability (difficult updates → delays).
GAM's Solution: Two-stage separation achieves both: EPG captures information immediately, while TAN stabilizes it on demand.

Tension 2: Cost vs Reasoning Ability

Mem0 lowers cost but loses structure; AriGraph strengthens reasoning but increases cost.
GAM's Compromise: Build graphs on demand, investing at transitions while remaining lightweight otherwise.

Tension 3: Generality vs Specificity

Fixed hierarchies are general but inflexible; fully learned approaches are general but expensive.
GAM's Innovation: A semantically driven, parameter-free design, with content-triggered transitions instead of hyperparameter-defined tiers.

Part IV: Open Challenges and Research Opportunities

4.1 Robustness and Interpretability of Transition Detection

Key question: How does the semantic-transition threshold (0.65) generalize across domains, languages, and tasks?

4.2 Forgetting and Capacity Management

Key question: Is TAN's fixed limit of 500 nodes sufficient? How can it degrade gracefully beyond that limit?

4.3 Shared Memory Across Agents

Key question: Conflicts and isolation when multiple agents share a GAM instance.

4.4 Subjectivity and Values in Memory

Key question: What information deserves to enter TAN? Does this involve value judgments?

4.5 Integration with Parametric Memory

Key question: Can an agent maintain both external memory and fine-tuned parametric memory?

4.6 Improving Evaluation Benchmarks

Missing dimensions: Multiple languages, domains, roles, and stress tests.

Part V: Other Recent Work Worth Following

  1. MemSyco-Bench: Benchmarking Sycophancy in Agent Memory [arXiv:2607.01071, Jul 2026]
    Examines memory-system safety, particularly whether memory amplifies sycophancy
  2. Are We Ready For An Agent-Native Memory System? [arXiv:2606.24775, Jun 2026]
    A position paper asking whether current technology is truly agent-native or merely an LLM with external storage
  3. MemGraphRAG: Memory-based Multi-Agent System for GraphRAG [arXiv:2606.00610]
    A shared-memory mechanism combining multiple agents with GraphRAG
  4. MAGMA: Multi-Graph based Agentic Memory Architecture [arXiv:2601.03236, Jan 2026]
    A multidimensional graph-fusion framework emphasizing collaboration among graphs more than GAM does
  5. Hindsight: Structured Agent Memory that Retains, Recalls, and Reflects [ACL 2026 Demo]
    The first systematic treatment of memory metacognition: remembering and reflecting on memory itself
  6. From Storage to Experience: A Survey on the Evolution of LLM Agent Memory Mechanisms [ACL 2026 Findings]
    A high-quality survey for quickly understanding the field

Overall Assessment and Outlook

GAM's Position

GAM represents solid engineering progress in agent memory, rather than a revolutionary breakthrough:

Predicted Next Directions

Over the next 6–12 months, the following directions may become prominent:

  1. Memory security and alignment ← Inspired by MemSyco-Bench
  2. Multi-agent memory collaboration ← Extending MemGraphRAG
  3. Memory metacognition and adaptation ← Evolving Hindsight
  4. A unified framework for parametric and external memory ← Driven by practitioner demand