Mnemis: Dual-Route Retrieval on Hierarchical Graphs for Long-Term LLM Memory
This addresses memory retrieval limitations in LLMs for applications requiring comprehensive historical context, though it appears incremental over existing graph-based methods.
The paper tackles the problem of limited global reasoning in AI memory retrieval for LLMs by proposing Mnemis, a dual-route framework combining similarity search with hierarchical graph traversal, achieving state-of-the-art scores of 93.9 on LoCoMo and 91.6 on LongMemEval-S.
AI Memory, specifically how models organizes and retrieves historical messages, becomes increasingly valuable to Large Language Models (LLMs), yet existing methods (RAG and Graph-RAG) primarily retrieve memory through similarity-based mechanisms. While efficient, such System-1-style retrieval struggles with scenarios that require global reasoning or comprehensive coverage of all relevant information. In this work, We propose Mnemis, a novel memory framework that integrates System-1 similarity search with a complementary System-2 mechanism, termed Global Selection. Mnemis organizes memory into a base graph for similarity retrieval and a hierarchical graph that enables top-down, deliberate traversal over semantic hierarchies. By combining the complementary strength from both retrieval routes, Mnemis retrieves memory items that are both semantically and structurally relevant. Mnemis achieves state-of-the-art performance across all compared methods on long-term memory benchmarks, scoring 93.9 on LoCoMo and 91.6 on LongMemEval-S using GPT-4.1-mini.