Hierarchical Three-Level Memory System

Updated 15 April 2026

Hierarchical three-level memory systems organize information into atomic, episodic, and semantic layers to efficiently encode, consolidate, and retrieve data.
They aggregate raw data into structured concept trees and schemas using operators like extraction, coarsening, and traversal for scalable performance.
Empirical findings reveal enhanced retrieval accuracy, reduced latency, and improved reasoning efficiency in applications such as cognitive modeling and multi-agent systems.

A hierarchical three-level memory system is a memory architecture that organizes information across three strata of abstraction, supporting optimized encoding, retrieval, and consolidation while reflecting both cognitive principles and engineering constraints. Such systems have demonstrated substantial gains in reasoning efficiency, retrieval accuracy, scalability, and robustness in domains spanning cognitive modeling, language agents, multi-agent frameworks, and persistent personalization. The following sections synthesize foundational mathematics, implementations, algorithms, and theoretical frameworks from primary literature, notably (Greer, 2020, Lerma-Torres, 30 Mar 2026, Talebirad et al., 23 Mar 2026, Sun et al., 23 Jul 2025, Hu et al., 25 Feb 2026, Rezazadeh et al., 2024, Liu et al., 2 Apr 2026), and related works.

1. Structural Principles and Canonical Layering

Hierarchical three-level memory systems partition storage and computation into discrete abstraction layers, each with distinct data representations and operations.

Level 1 (Lowest, High-Fidelity/Atomic):
- Often called “Ensemble,” “Episode,” or “Working Memory.” Stores raw events, fine-grained chunks, or immediate tokens. Patterns are maintained as individual “instances” or “leaves” (Greer, 2020, Rezazadeh et al., 2024).
Level 2 (Middle, Aggregation/Episodic):
- “Concept Trees,” “Category,” or “Episodic Memory.” Aggregates repeat fragments under shared types or schema; nodes represent merged entities with event-link sets for fast type-instance correspondence (Greer, 2020, Sun et al., 23 Jul 2025).
Level 3 (Top, Schema/Procedural/Semantic/Global):
- “Cognitive Layer,” “High-level Memory,” or “Semantic Memory.” Encodes procedural scripts, retrieval structures, generalized tasks, belief hierarchies, or cross-session schemas; supports scheduling and logical composition (Greer, 2020, Lerma-Torres, 30 Mar 2026, Tan et al., 7 Mar 2026, Liu et al., 2 Apr 2026).

Abstraction increases up the hierarchy: lower levels record high-resolution episodic detail, while upper levels store heavily compressed, context-spanning summaries or scripts (Greer, 2020, Rezazadeh et al., 2024).

2. Formal Models and Algorithmic Realization

The underlying computational workflow is often described using three operators—extraction $\alpha$ , coarsening $C=(\pi,\rho)$ , and traversal $\tau$ —that together compose hierarchical memory graphs (Talebirad et al., 23 Mar 2026):

Operator	Notation	Role
Extraction	$\alpha$	Map raw data $\mathcal{D}$ to atoms $G_0$
Coarsening	$C=(\pi, \rho)$	Partition atoms into groups, build a representative summary per group
Traversal	$\tau$	Given query $q$ , select atoms under a budget via hierarchy traversal

The self-sufficiency of each level’s representative function,

$SS(\rho_\ell, G_{\ell,j}) = 1 - \frac{H(G_{\ell,j}|\rho_\ell(G_{\ell,j}))}{H(G_{\ell,j})}$

determines whether traversal strategies prefer “collapsed search” (for high-SS, richly informative summaries) or require “top-down refinement” (for low-SS, referential pointers) (Talebirad et al., 23 Mar 2026, Sun et al., 23 Jul 2025).

Concrete system instantiations include:

H-MEM: Nodes at each level are vectors $C=(\pi,\rho)$ 0 containing semantic embedding, position index, and child pointers; retrieval proceeds by index-based routing layer-wise, limiting similarity computations to feasible candidate sets (Sun et al., 23 Jul 2025).
Tree-based Schemas: In MemTree, insertion proceeds by traversing from root; a new item is attached or aggregated depending on semantic similarity exceeding an adaptive threshold $C=(\pi,\rho)$ 1 at depth $C=(\pi,\rho)$ 2 (Rezazadeh et al., 2024). Restructuring via split/merge maintains coherence as memory grows.
Procedural and Cognitive Networks: Top-level CPL networks maintain object-effector-source triples, sequenced by a scheduler that computes shortest cycles and propagates activations downwards (Greer, 2020).

3. Encoding, Consolidation, and Retrieval Mechanisms

Insertion, update, and read routines are tailored to the abstraction level (Greer, 2020, Rezazadeh et al., 2024, Sun et al., 23 Jul 2025):

Level-specific Procedures

Level 1 (Ensemble/Episode):

On event $C=(\pi,\rho)$ 3, for fragment $C=(\pi,\rho)$ 4, check containment and overlap for deduplication; create or merge nodes to preserve all variants (Greer, 2020).
In H-MEM, episodic memory stores the full content; episode embeddings populate the leaf nodes (Sun et al., 23 Jul 2025).

Level 2 (Concept Trees/Episodic):

Collapse occurrences of the same concept at fixed positions into one node. Maintain set of event keys and apply counting rule “parent count ≥ child count” for consistency (Greer, 2020).
In MemTree, aggregate child embeddings by LayerNorm-weighted sum, updating parent representation recursively (Rezazadeh et al., 2024).

Level 3 (Cognitive/Semantic/Procedural):

Encode scripts as CPL triples, shared concept nodes, and links; procedural structure integrates with a “light scheduler” to manage task order (Greer, 2020).
In MemTree and H-MEM, upper nodes serve as schema indices or procedural anchors for efficient query routing and top-down planning.

Retrieval

Given query $C=(\pi,\rho)$ 5, hierarchical systems employ either direct-embedding or procedural search at top-level, propagate through indices/links or semantic similarity at mid-level, and reconstruct full instances by tracing down to low-level leaves (Sun et al., 23 Jul 2025, Rezazadeh et al., 2024).
Retrieval time bounds are $C=(\pi,\rho)$ 6 for three-level trees, where $C=(\pi,\rho)$ 7 is mid-level depth and $C=(\pi,\rho)$ 8 is top-layer cycle length (Greer, 2020).

Update and Consolidation

Periodic consolidation enforces parental count rules and rebalances tree as necessary.
In systems with dynamic scoring (e.g., HMO), adaptive relevance $C=(\pi,\rho)$ 9 is recomputed based on frequency, recency, importance, and persona-match, followed by tier redistribution (Liu et al., 2 Apr 2026).

4. Cross-Domain Architectures and Applications

Hierarchical three-level memory underpins systems in diverse contexts:

Cognitive Brain Modeling: The ensemble–hierarchy–CPL structure explicitly models chunking, abstraction, and procedural sequencing, mirroring properties of human cortical and mnemonic function (Greer, 2020).
LLM Agents (H-MEM, Pancake): Index-based, sublinear hierarchical retrieval achieves sustained efficiency and semantic preservation as conversation/context history grows—crucial for long-form dialogue and lifelong agents (Sun et al., 23 Jul 2025, Hu et al., 25 Feb 2026).
Knowledge Representation: Multi-level dialog memory separates queries, results, and key-value pairs, outperforming flat triple-memories on dialog datasets (Reddy et al., 2018).
Personalized Agents: Systems like HMO couple recent context, pivotal segments, and a global archive, using persona alignment and adaptive scoring to retain relevant user-facing experience and support fluid personalization (Liu et al., 2 Apr 2026).
Tree-structured Schemas: MemTree’s dynamic, depth-adaptive trees aggregate context (working memory), episodic, and semantic content, boosting retrieval quality and human-alignment across dialogue and multi-hop QA benchmarks (Rezazadeh et al., 2024).
Web Agents: Hierarchical abstraction of intent, subgoal, and action pattern enables robust transfer and execution across domains, outperforming flat memory in cross-website settings (Tan et al., 7 Mar 2026).
Multi-Agent Orchestration: G-Memory’s insight–query–interaction triple graph supports bi-directional retrieval—distilling cross-trial procedural insights (Level 3), connecting query/topology (Level 2), and reusing fine-grained collaborative traces (Level 1) (Zhang et al., 9 Jun 2025).

5. Theoretical Tradeoffs, Abstractions, and Performance

Key theoretical properties and trade-offs of three-level hierarchies include:

Capacity: Overall storage is dominated by the number of ensemble/episode nodes and the degree of event-to-type crosslinking; mid-level and top-level abstractions reduce redundancy and permit compaction (Greer, 2020, Sun et al., 23 Jul 2025).
Retrieval/Update Complexity: Hierarchical address locality allows $\tau$ 0 or $\tau$ 1 (per tier—number of candidates vs. total memory bank size) versus $\tau$ 2 in flat memory, with significant latency savings under growth (Sun et al., 23 Jul 2025, Hu et al., 25 Feb 2026).
Self-Sufficiency Spectrum: The expressiveness of each level’s summary (from pure label to abstractive summary) mandates different traversal strategies and impacts token budget efficiency (Talebirad et al., 23 Mar 2026).
Dynamic Adaptation: Adaptive scoring (e.g., HMO combining recency, importance, persona similarity, recall count) and persona-driven redistribution ensure high-precision recall and alignment despite evolving user state (Liu et al., 2 Apr 2026).

Representative empirical findings:

H-MEM achieves average F1 gains up to +14.98 on LoCoMo tasks; retrieval latency increases only minimally under sustained memory growth (Sun et al., 23 Jul 2025).
Pancake system achieves up to 4.29× throughput over baselines in multi-agent scenarios, demonstrating theoretical and practical efficiency from tiered clustering and early termination (Hu et al., 25 Feb 2026).
G-Memory delivers up to +20.89% success on ALFWorld embodied agents and +10.12% on HotpotQA versus flat memory (Zhang et al., 9 Jun 2025).
In personalized agents, HMO reduces end-to-end reasoning latency by 77% with comparable or higher recall and accuracy relative to flat or global search approaches (Liu et al., 2 Apr 2026).

6. Comparative Analysis, Empirical Gains, and Limitations

Comparisons to flat and two-level schemes consistently show:

Compactness: Hierarchy reduces the size of working-set memory and supports chunked/episodic abstraction, which lowers inference costs and retrieval noise (Greer, 2020, Rezazadeh et al., 2024, Liu et al., 2 Apr 2026).
Query Locality and Scalability: Tiered index and tree traversal mitigate the context explosion and maintain performance as history scales (Sun et al., 23 Jul 2025, Hu et al., 25 Feb 2026).
Role-specific/Procedural Access: Multi-agent and procedural systems benefit from vertical filtering (insight to action), direct trajectory distillation, and enable agent-specific role filtering and cross-trial transfer (Zhang et al., 9 Jun 2025, Tan et al., 7 Mar 2026).
Personalization and Dynamic Adaptation: Systems with top-down scoring and persona alignment surface pivotal and context-sensitive memory, adapting to user drift in real time (Liu et al., 2 Apr 2026).

Limitations observed include:

Lossy Abstraction: Aggressive compression (low-SS summaries or excessive pruning) can degrade fidelity for fine-detail queries.
Complexity of Sync and Update: Maintaining consistent indices, thresholds, and dynamic restructuring in distributed or multi-agent deployments increases engineering overhead.
Scheduler Expressivity: Procedural networks (e.g., CPL) may require task-specific engineering to encode general cognitive scripts; adaption to novel domains can necessitate manual intervention (Greer, 2020).

7. Psychological and Neurocognitive Analogues

Cognitive and neuro-inspired formulations ground the three-level hierarchy in models of chunking, procedural abstraction, dual-process retrieval, and self-organizing schema (Greer, 2020, Lerma-Torres, 30 Mar 2026):

Chunking and Concept Trees: The middle level’s function mirrors psychological “chunking” (grouping 2–6 items) to optimize recall and reduce cognitive load (Miller’s “7±2”).
Belief and Episodic Hierarchies: Weight-based emergent hierarchies in knowledge graphs correspond to core beliefs, intermediate beliefs, and unreified “automatic thoughts,” paralleling schemas in cognitive therapy frameworks (Lerma-Torres, 30 Mar 2026).
Dual-Process Retrieval: System 1 and System 2 layers implement rapid, parallel spreading activation (default) and deliberate, controlled search (escalation); this architectural duality supports monotonic convergence to expert-like behavior with experience (Lerma-Torres, 30 Mar 2026).
Procedural/Scheduler Networks: Analogous to cognitive scripts, the top-layer scheduler sequences steps via shortest-cycle activation and inhibitory clocks, facilitating human-like task structure (Greer, 2020).

Such mappings reinforce the architectural plausibility and motivate the continued cross-fertilization between computational engineering and cognitive science.

Hierarchical three-level memory systems provide a formalized, empirically validated, and neurocognitively motivated paradigm for scalable, robust, and context-sensitive memory in artificial agents and cognitive modeling. Their operational patterns, theoretical underpinnings, and empirical successes position them as foundational infrastructures for both research and practical deployment in long-horizon, high-volume reasoning domains (Greer, 2020, Sun et al., 23 Jul 2025, Talebirad et al., 23 Mar 2026, Rezazadeh et al., 2024, Liu et al., 2 Apr 2026, Zhang et al., 9 Jun 2025).