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

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 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 97.1% of the original performance while compressing 50% of historical memory across three benchmarks (LoCoMo, LongMemEval, and PersonaMem), achieving a 1.89x retrieval speedup. Under the multimodal M3-Agent framework, it preserves 99.7% of the original performance with a 50% compression ratio across two benchmarks (M3-Bench-robot and M3-Bench-web), achieving a 2.24x retrieval speedup. textcolorRoyalBluetextitOur code is available at [https://github.com/Celina-love-sweet/MemForest.](https://github.com/Celina-love-sweet/MemForest.)