- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper proposes H-MEM, a long-term memory system for LLM agents that combines a temporal-semantic tree with an entity-centric knowledge graph. The tree progressively consolidates fine-grained events into longer-term memories over different temporal granularities, while the graph captures relations between entities across memory fragments. At retrieval time, an LLM-based planner decomposes queries, selects memory scope and coverage, traverses the graph and tree, and optionally issues a second retrieval query when information is missing.
H-MEM is evaluated on LoCoMo, LongMemEval-S, and REALTALK against several existing memory systems. The reported results show strong improvements in downstream QA accuracy and F1, together with ablations and indexing/retrieval cost analyses.
Critical strengths
-
The system is fairly complete and practically motivated. The temporal-semantic tree and entity graph provide complementary views of the memory, and the provenance-preserving design is useful for maintaining access to the original evidence.
-
The empirical evaluation is reasonably broad. H-MEM is tested on three long-term memory benchmarks, includes both simulated and human conversational data, and reports not only QA quality but also indexing/retrieval cost and component ablations. The improvements over the evaluated baselines are substantial on several settings.
Critical weaknesses
- The novelty and empirical positioning are not sufficiently convincing relative to the rapidly evolving agent-memory literature.
The current comparison includes Mem0, MemTree, MemoryOS, MemOS, Zep, and EverMemOS, but omits several recent methods that are highly relevant to the paper's central claims. In particular, recent work such as Memory-R1, MAGMA, APEX-MEM, and Agentic Memory already studies learned memory management, temporal/evolving memory, graph-based memory, or agentic retrieval, with several of them evaluated on LoCoMo and LongMemEval.
This matters because the paper claims state-of-the-art performance and presents temporal evolution, structured memory, and agentic retrieval as its main contributions. By 2026, these ingredients are no longer individually new, and the paper needs a much clearer comparison against contemporary methods to establish what the hybrid tree–graph design contributes beyond recent alternatives.
- The central claim of modeling memory evolution is only evaluated indirectly through downstream QA.
H-MEM explicitly claims to model the evolution from short-term to long-term memory, including stable, evolving, and conflicting information. However, the evaluation mainly measures final QA F1 and LLM-Judge Accuracy. These results show that the full retrieval system answers questions well, but they do not directly establish that the proposed consolidation process models memory evolution correctly.
For example, I did not find direct evaluation of whether evolving preferences are updated correctly, whether conflicts are preserved faithfully, whether consolidated memories remain supported by their source events, or how much information is lost at higher levels of the tree. This distinction is important because the full system also introduces query decomposition, memory-scope prediction, graph expansion, reranking, entity profiles, and second-pass retrieval. Thus, improved QA performance could partly come from a stronger retrieval pipeline rather than better modeling of memory evolution itself.
Questions for authors
-
Could the authors clarify why recent methods such as Memory-R1, MAGMA, APEX-MEM, and Agentic Memory are not included in the comparison? Several of these methods are evaluated on LoCoMo and/or LongMemEval and appear directly relevant to H-MEM's claims about evolving, structured, and agentic memory.
-
Do the authors have any direct evaluation of the memory-evolution mechanism itself, beyond downstream QA? For example, accuracy of preference/status updates, conflict preservation, consolidation faithfulness, or retrieval of outdated versus current information would materially affect my assessment of the central claim.
-
In the "w/o tree" and "w/o graph" ablations, are the query planner, embedding/reranking stack, retrieval budget, and second-pass retrieval kept identical? I would like to understand whether these results cleanly isolate the contribution of the index structure.
-
The paper states that fragment timestamps correspond to ingestion time rather than the time of the event described in the conversation. How are cases handled where event time and ingestion time differ substantially, and which notion of time is used for tree placement and temporal relevance scoring?