MemForest: Efficient Agent Memory Management via EventTree Partitioning and Progressive Merging

• URL: http://arxiv.org/abs/2609.08273v1
• Date: Tue, 08 Sep 2026 05:30:30 GMT
• Title: MemForest: Efficient Agent Memory Management via EventTree Partitioning and Progressive Merging
• Abstract summary: We propose textbfMemForest, a general memory compression framework for agent memory systems.<n>MemForest partitions historical memory into event-centric units by leveraging global semantic similarity and local temporal continuity.<n>Under the multimodal M3-Agent framework, it preserves textbf99.7% of the original performance with a textbf50% compression ratio.
• Score: 23.836080891576135
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Agent memory systems have demonstrated significant potential in long-term dialogue, personalized assistants, and video understanding. However, continuously accumulated memory introduces substantial storage and retrieval costs during inference. To address this issue, we propose \textbf{MemForest}, a general memory compression framework adaptable to various agent memory systems. Specifically, MemForest partitions historical memory into event-centric units by leveraging global semantic similarity and local temporal continuity. For each unit, it constructs a maximum spanning tree, termed an EventTree, and progressively merges redundant memory nodes by selecting high-weight edges, reducing storage overhead. Furthermore, we introduce an anchor-guided propagation retrieval mechanism that retrieves relevant memory nodes from the temporal neighborhoods of key nodes, improving retrieval accuracy. Extensive experiments demonstrate the effectiveness of MemForest. Under the unimodal Mem0 framework, MemForest retains \textbf{97.1%} of the original performance while compressing \textbf{50%} of historical memory across three benchmarks (LoCoMo, LongMemEval, and PersonaMem), achieving a \textbf{1.89x} retrieval speedup. Under the multimodal M3-Agent framework, it preserves \textbf{99.7%} of the original performance with a \textbf{50%} compression ratio across two benchmarks (M3-Bench-robot and M3-Bench-web), achieving a \textbf{2.24x} retrieval speedup. \textcolor{RoyalBlue}{\textit{Our code is available at [https://github.com/Celina-love-sweet/MemForest.}}](https://github.com/Celina-love-sweet/MemForest.}})

Related papers

• CreaMem: A Scene-Aware Memory Architecture for Personalized Agents [10.59532182467324]
  We propose the CreaMem architecture, which enables scene-aware memory organization by partitioning memory into several Life Scene Memories.<n>CreaMem improves QA accuracy across all evaluation metrics, with particularly large gains on multi-hop reasoning performance.<n>To enhance, we release our code in a public GitHub repository.
  arXiv  Detail & Related papers  (2026-09-08T10:33:05Z)
• ArborMem: Navigating Interaction States with Memory Forests [9.724913528017408]
  Large language models increasingly serve as persistent conversational assistants.<n>We introduce ArborMem, an online memory framework that represents a long-running conversation as a navigable forest of interaction states.<n>For each new input, ArborMem localizes the relevant state, restores its branch-local context, and augments it with reusable evidence retrieved across branches.
  arXiv  Detail & Related papers  (2026-08-18T08:54:55Z)
• RippleMem: From Isolated Retrieval to Associative Recollection for Long-Term Agent Memory [13.519130680921565]
  We introduce RippleMem, a long-term memory system that replaces one-shot retrieval with adaptive associative recollection.<n>LoCoMo and LongMemEval-S show that RippleMem achieves the best overall performance across evaluated settings.
  arXiv  Detail & Related papers  (2026-08-13T15:05:01Z)
• Memory as a Controlled Process: Learned Adaptive Memory Management for LLM Agents [72.3752981234916]
  Large Language Model (LLM) agents increasingly rely on external memory systems to accumulate experience across tasks.<n>We present Memory as a Controlled Process (MemCon), a framework that models memory operations as a Markov Decision Process.<n>MemCon consistently outperforms multiple memory baselines by up to 15.2 points in task success while reducing token consumption by 5-20%.
  arXiv  Detail & Related papers  (2026-07-15T08:32:40Z)
• AdaMem: Learning What to Remember for Personalized Long-Horizon LLM Agents [79.03892269184145]
  We argue that what is worth remembering is role-dependent, and propose textbfAdaMem (Adaptive Memory)<n>AdaMem improves QA accuracy by up to textbf+9.0% over the uniform Mem0 baseline while shrinking memory volume by textbf9%.
  arXiv  Detail & Related papers  (2026-06-19T06:35:52Z)
• FlashMemory-DeepSeek-V4: Lightning Index Ultra-Long Context via Lookahead Sparse Attention [77.12062766962815]
  Lookahead Sparse Attention (LSA) is powered by a Neural Memory Indexer built upon the DeepSeek-V4 architecture.<n>We instantiate this architecture via a backbone-free decoupled training strategy.<n>We show that FM-DS-V4 compresses the average physical KV cache footprint down to merely 13.5% of the full-context baseline.
  arXiv  Detail & Related papers  (2026-06-08T06:25:54Z)
• Enhancing Software Engineering Through Closed-Loop Memory Optimization [50.418699819003486]
  We introduce ours, a closed-loop framework for memory augmentation in software engineering (SE) agents.<n>ours grounds memory utility in textitvalidated downstream impact, establishing utility as a task-agnostic textbf benchmark and an annotation-free textbfoptimization signal.<n>Results demonstrate that ours consistently improves SE agents across settings, achieving absolute gains of up to $uparrow5.25%$ in success rate and $uparrow4.63%$ in resolve efficiency.
  arXiv  Detail & Related papers  (2026-06-04T03:17:21Z)
• MemGym: a Long-Horizon Memory Environment for LLM Agents [69.79226770543049]
  We present MemGym, a benchmark for agentic memory that unifies existing agent gyms and in-house memory-grounded pipelines.<n>MemGym reports memory-isolated scores that decouple memory performance from reasoning, retrieval, and tool-use ability.<n>Our synthetic pipelines for MEMGYM-CODEQA and MEMGYM-DR are length-controllable, ablation-verified at every stage, and tightly aligned with downstream scenarios.
  arXiv  Detail & Related papers  (2026-05-20T07:25:33Z)
• MemForest: An Efficient Agent Memory System with Hierarchical Temporal Indexing [33.94614583313314]
  We present MemForest, a memory framework that reformulates agent memory as a write-efficient temporal data management problem.<n>MemForest breaks the sequential bottleneck via parallel chunk extraction, decoupling memory construction into concurrent, independent operations.<n>We evaluate MemForest on two long-context memory benchmarks, LongMemEval-S and LoCoMo.
  arXiv  Detail & Related papers  (2026-05-16T13:11:47Z)
• DimMem: Dimensional Structuring for Efficient Long-Term Agent Memory [9.059024668312434]
  DimMem represents each memory as an atomic, typed, and self-contained unit with explicit fields such as time, location, reason, purpose, and keywords.<n>Across LoCoMo-10 and LongMemEval-S, DimMem achieves textbf81.43% and textbf78.20% overall accuracy, respectively.
  arXiv  Detail & Related papers  (2026-05-15T09:20:31Z)
• AdaMem: Adaptive User-Centric Memory for Long-Horizon Dialogue Agents [49.63422082885992]
  We propose AdaMem, an adaptive user-centric memory framework for long-horizon dialogue agents.<n>AdaMem organizes dialogue history into working, episodic, persona, and graph memories.<n>We evaluate AdaMem on the LoCoMo and PERSONAMEM benchmarks for long-horizon reasoning and user modeling.
  arXiv  Detail & Related papers  (2026-03-17T13:22:54Z)
• Remember Me, Refine Me: A Dynamic Procedural Memory Framework for Experience-Driven Agent Evolution [52.76038908826961]
  We propose $textbfReMe$ ($textitRemember Me, Refine Me$) to bridge the gap between static storage and dynamic reasoning.<n>ReMe innovates across the memory lifecycle via three mechanisms: $textitmulti-faceted distillation$, which extracts fine-grained experiences.<n>Experiments on BFCL-V3 and AppWorld demonstrate that ReMe establishes a new state-of-the-art in agent memory system.
  arXiv  Detail & Related papers  (2025-12-11T14:40:01Z)
• LightMem: Lightweight and Efficient Memory-Augmented Generation [72.21680105265824]
  We introduce a new memory system called LightMem, which strikes a balance between the performance and efficiency of memory systems.<n>Inspired by the Atkinson-Shiffrin model of human memory, LightMem organizes memory into three complementary stages.<n>Experiments on LongMemEval with GPT and Qwen backbones show that LightMem outperforms strong baselines in accuracy (up to 10.9% gains) while reducing token usage by up to 117x.
  arXiv  Detail & Related papers  (2025-10-21T17:58:17Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.