Pith. sign in

REVIEW 15 cited by

Hierarchical Memory for High-Efficiency Long-Term Reasoning in LLM Agents

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2507.22925 v1 pith:V5T2IRJM submitted 2025-07-23 cs.CL cs.AI

Hierarchical Memory for High-Efficiency Long-Term Reasoning in LLM Agents

classification cs.CL cs.AI
keywords memoryagentslong-termreasoningretrievalefficientencodingfive
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original abstract

Long-term memory is one of the key factors influencing the reasoning capabilities of Large Language Model Agents (LLM Agents). Incorporating a memory mechanism that effectively integrates past interactions can significantly enhance decision-making and contextual coherence of LLM Agents. While recent works have made progress in memory storage and retrieval, such as encoding memory into dense vectors for similarity-based search or organizing knowledge in the form of graph, these approaches often fall short in structured memory organization and efficient retrieval. To address these limitations, we propose a Hierarchical Memory (H-MEM) architecture for LLM Agents that organizes and updates memory in a multi-level fashion based on the degree of semantic abstraction. Each memory vector is embedded with a positional index encoding pointing to its semantically related sub-memories in the next layer. During the reasoning phase, an index-based routing mechanism enables efficient, layer-by-layer retrieval without performing exhaustive similarity computations. We evaluate our method on five task settings from the LoCoMo dataset. Experimental results show that our approach consistently outperforms five baseline methods, demonstrating its effectiveness in long-term dialogue scenarios.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 15 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Learning How and What to Memorize: Cognition-Inspired Two-Stage Optimization for Evolving Memory

    cs.CL 2026-05 unverdicted novelty 7.0

    MemCoE learns memory organization guidelines via contrastive feedback and then trains a guideline-aligned RL policy for memory updates, yielding consistent gains on personalization benchmarks.

  2. Four-Axis Decision Alignment for Long-Horizon Enterprise AI Agents

    cs.AI 2026-04 unverdicted novelty 7.0

    Long-horizon enterprise AI agents' decisions decompose into four measurable axes, with benchmark experiments on six memory architectures revealing distinct weaknesses and reversing a pre-registered prediction on summa...

  3. What Memory Do GUI Agents Really Need? From Passive Records to Active Task-Driving States

    cs.CV 2026-06 unverdicted novelty 6.0

    Introduces Active Task Driving Memory (ATMem) and STR-GRPO to move GUI agents from passive record storage to actively maintained task states, tested on a new mobile benchmark with progress and scope-aware metrics.

  4. MetaPS: Adaptive Programmatic Strategy Selection for Market Agents

    cs.AI 2026-06 unverdicted novelty 6.0

    MetaPS trains models via simulation rollouts to select from programmatic strategy libraries for market agents, yielding better performance than fixed or direct LLM baselines across model sizes.

  5. Simulating Human Memory with Language Models

    cs.CL 2026-05 unverdicted novelty 6.0

    Language models show superior memory to humans on psych experiments but can be adjusted via prompting and compaction to forget more human-like, yielding better user simulators.

  6. Stateless Decision Memory for Enterprise AI Agents

    cs.AI 2026-04 unverdicted novelty 6.0

    Deterministic Projection Memory (DPM) delivers stateless, deterministic decision memory for enterprise AI agents that matches or exceeds summarization-based approaches at tight memory budgets while improving speed, de...

  7. HiGMem: A Hierarchical and LLM-Guided Memory System for Long-Term Conversational Agents

    cs.CL 2026-04 unverdicted novelty 6.0

    HiGMem combines hierarchical event-turn memory with LLM-guided selection to retrieve concise relevant evidence from long dialogues, improving F1 scores and cutting retrieved turns by an order of magnitude on the LoCoM...

  8. MemSifter: Offloading LLM Memory Retrieval via Outcome-Driven Proxy Reasoning

    cs.IR 2026-03 conditional novelty 6.0

    MemSifter trains a 4B proxy with an outcome-driven, rank-sensitive RL reward to sift LLM memory, and on eight benchmarks it matches or beats embedding, graph, and long-context baselines.

  9. HERMES: KV Cache as Hierarchical Memory for Efficient Streaming Video Understanding

    cs.CV 2026-01 unverdicted novelty 6.0

    HERMES organizes the KV cache into a hierarchical memory to enable real-time streaming video understanding in MLLMs, achieving 10x faster TTFT and up to 11.4% accuracy gains on streaming benchmarks with 68% fewer tokens.

  10. What Memory Do GUI Agents Really Need? From Passive Records to Active Task-Driving States

    cs.CV 2026-06 unverdicted novelty 5.0

    Proposes ATMem as active task-driving state memory and STR-GRPO RL to improve GUI agent reliability on long-horizon mobile tasks over passive record storage.

  11. Retention Consequence in Lifecycle Memory Control

    cs.CL 2026-04 conditional novelty 5.0

    TRP allocates long/short portfolios by propagating signed signals through a rooted MST or SPY/sector-anchored tree with a continuous non-conservation parameter α.

  12. Retention Consequence in Lifecycle Memory Control

    cs.CL 2026-04 unverdicted novelty 5.0

    StageMem introduces a three-stage lifecycle framework for memory in language models that uses confidence and strength metrics to separate initial admission from long-term commitment.

  13. R$^2$-Searcher: Calibrating Retrieval and Reasoning Boundaries for Agentic Search

    cs.IR 2026-06 unverdicted novelty 4.0

    R²-Searcher introduces fine-grained evidence modeling, retrieval reflection, and R²PO RL to calibrate retrieval-reasoning boundaries and improve multi-hop QA performance.

  14. Back to Basics: Let Conversational Agents Remember with Just Retrieval and Generation

    cs.CL 2026-04 unverdicted novelty 4.0

    A minimalist retrieval-and-generation framework using turn isolation and query-driven pruning outperforms complex memory systems by directly addressing signal sparsity and dual-level redundancy in dialogues.

  15. Toward Efficient Agents: Memory, Tool learning, and Planning

    cs.AI 2026-01 conditional novelty 3.0

    A survey that organizes efficiency techniques for LLM agents into memory, tool learning, and planning, and consolidates benchmarks and metrics for measuring cost-performance trade-offs.