- Rating
- 1
- Confidence
- 4
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
This work introduces STRATA, an agent-centric memory architecture tailored to tracking user preferences over extended horizons. The authors reframe long-term personalization from traditional information retrieval into a latent state inference problem. To operationalize this, they build a three-tiered memory graph consisting of Spatial, Temporal, and Spatiotemporal tiers, capturing cross-session preference shifts through evolution chains, cross-layer connectivity, and policy-driven graph exploration.
Critical strengths
-
Recasting long-term personalization as dynamic state estimation rather than static passage lookup is a well-motivated and meaningful perspective, particularly for settings where user intents shift over time. The spatiotemporal graph design is conceptually consistent with this framing.
-
The pipeline is thoroughly structured, covering raw memory extraction, consolidation, multi-layered graph construction, inter-layer linking, and search traversal. The accompanying ablation studies demonstrate a complete and well-executed engineering effort.
-
The selected evaluation suites—namely the Track Evolution, Revisit Reasons, and Aligned Recommendation tasks in PersonaMem—serve as direct tests for temporal and spatiotemporal representations. Performance degradation in ablation experiments demonstrates the functional utility of individual modules on these specific benchmarks.
Critical weaknesses
-
The framework largely reads as an assemblage of established building blocks. Modules such as entity alignment, temporal sequencing, memory graphs, evolution trajectories, LLM-based memory consolidation, and autonomous graph walking are already well-trodden in the literature. While the authors organize these into a three-layer taxonomy, they do not articulate what genuinely novel algorithmic mechanism arises from this synthesis. Specifically, the boundary between evolution chains / spatiotemporal tiers and existing temporal knowledge graphs or event-centric memory systems remains nebulous.
-
The manuscript lacks an exhaustive taxonomy-level comparison against prior memory paradigms. Because the primary contribution relies on reorganizing existing components, establishing rigorous and substantive distinctions from prior work is critical. Without a comprehensive related-work discussion, validating the claimed novelty is challenging.
-
Graph synthesis relies on numerous hand-crafted rules (e.g., embedding similarity thresholds, heuristic entity matching, causal event criteria, and co-move linkages). The paper provides no systematic sensitivity analysis on these parameters, leaving it ambiguous whether performance stems from the proposed spatiotemporal formalism or simply from heavy trial-and-error hyperparameter tuning.
Questions for authors
Could you explicitly define the fundamental algorithmic innovation of STRATA? Beyond simply listing the architectural blocks, what sets STRATA apart from existing methods in temporal memory, graph retrieval, and personalization? Could the proposed evolution chains and agentic traversals be replicated by straightforward combinations of existing off-the-shelf tools?
Overall, I believe the main concerns of this paper are insufficient methodological novelty and the lack of convincing experimental evidence that STRATA provides substantial advantages over existing agentic memory methods. Several core components of the proposed framework are closely related to existing work on memory graphs, temporal memory, agentic retrieval, and personalization, yet the paper does not sufficiently explain what new algorithmic insight arises from their combination. Moreover, the improvement on PersonaMem is relatively small, while STRATA incurs substantially higher inference costs, making it difficult to justify the additional complexity based on the current empirical results.
2 comments
Thank you for the response and additional experiments. I appreciate the matched-backbone evaluations, same-agent no-graph control, expanded discussion of prior work, and reduced computational cost. These additions address some of my original concerns and strengthen the evidence that STRATA’s structured memory pipeline is useful, particularly for temporal reasoning.
However, my central concerns remain. The response clarifies the architectural choices, but I remain unconvinced that it establishes a sufficiently distinct methodological contribution. The additional controls do not fully isolate the benefit of the proposed three-tier organization, and the improvements on the main preference-tracking benchmark remain modest relative to the added complexity and cost. The rebuttal therefore does not sufficiently resolve my concerns about novelty and empirical justification. I maintain my rating.
Response to Reviewer s1FC
Thank you for the expert and candid review. We apologize that this response arrives so close to the deadline and leaves you little time to consider it.
W1 / Q: The algorithmic innovation of STRATA. STRATA's novelty comes from three specific design decisions which, to our knowledge, have not been combined or tested before:
(1) Memory is partitioned by temporal behaviour, not by level of abstraction. Prior graph memories either use a single node type (A-Mem's notes, HippoRAG's phrases) or stack layers of increasing abstraction over the same content (Zep's episode / entity / community subgraphs, Mnemis's base and hierarchical graphs). STRATA instead separates records by how they change over time: persistent entities and facts (Spatial), dated events (Temporal), and preferences with their own history (Spatiotemporal), linked across tiers by shared evidence. To our knowledge, this is the first memory graph organized along the temporal axis with spatial "encoding" as well (hence the spatial/temporal naming).
(2) Reasoning happens at read time, over typed structure. Instead of a fixed retrieve-and-rerank procedure, a lightweight agent anchors in each tier and chooses which typed node to open, receiving it with its one-hop neighbors in the other tiers. This routing is unique to STRATA and largely emergent. With minimal routing rules in the prompt, the same gpt-4o-mini agent issues 60% of node opens on PersonaMem to the preference tier, against 16% on LongMemEval, where half go to events. To our knowledge, STRATA is the first system in which an agent chooses to navigate across tiers of a single memory graph.
(3) Append-only state with provenance. Preference (and fact) values are appended to chains instead of being overwritten, in contrast with overwrite-style memories (Mem0, LangMem, A-Mem's note rewriting). No other memory system uses temporally aligned chains as the main unit.
Q: Could this be replicated by combining off-the-shelf tools? We tested this via a no-graph control. The natural off-the-shelf assembly is a ReAct agent with dense retrieval over raw turns. We ran it with the same model, prompt, dense seed and per-item tool budget as STRATA:
We are not aware of a prior memory-system paper that reports a budget-matched no-graph agent control; it isolates the architecture from the agent. The gain also concentrates where temporal organization should matter. On temporal-reasoning questions (n=133) STRATA scores 75.4 against 64.7 without the graph, and removing the event tier alone drops it to 61.7. On preference questions (n=30), removing the preference tier or the cross-layer edges drops accuracy from 67.8 to 46.7, and removing evolution chains or causal edges lowers it to 60.0. No ablation condition beats the full system on either benchmark.
W2: Taxonomy-level comparison. We added a table to Related Work comparing STRATA with fourteen other systems (including Zep, A-Mem, Mem0, MemGPT and Mnemis) on six axes, including how a changed value is handled, where the LLM reasons, and how memory is read. It makes the boundary with temporal knowledge graphs explicit: Zep attaches validity intervals to relation edges inside an abstraction hierarchy and reads with search plus reranking, while STRATA makes temporal behavior the organizing principle of the graph itself and reads with an agent.
W3: Sensitivity to hand-set rules. We added a table of hand-set values with their measured sensitivity: (a) causal-link threshold: accuracy on LongMemEval-S is 75.6 / 74.0 / 75.2 at cosine = 0.15 / 0.30 / 0.50, so the result is not a product of tuning it; (b) neighbours per relation (4) and the agent call limit (30) are non-binding; (c) cross-layer edges on vs off: 75.6 vs 71.8 on LongMemEval-S; (d) RAG baseline depth: flat from k=4 to k=32 (57.4–59.1), so it was not disadvantaged. The seed size and preference-merge threshold are not swept; we list this as a limitation.
Empirical advantage and cost. We re-ran every experiment with a gpt-4o-mini backbone, the same as every baseline, under a fixed inference budget (3,100-token answer input), on the full benchmarks (three runs). STRATA scores 62.59 on PersonaMem-32K (A-Mem 60.44, RAG 58.40) and 75.6 on LongMemEval-S, against 60.2 for the best system in All-Mem's table (arXiv 2603.19595), which uses the same backbone and embedder. STRATA now costs 0.027 per item on PersonaMem (0.023 one-time construction, 0.005 at query time), about 4 times A-Mem instead of 46x with Opus. We attribute the larger margin on LongMemEval to per-item context length; PersonaMem-32K items are one conversation of at most 32k tokens, while LongMemEval-S items span about 48 sessions and 104k tokens.
Thank you again for the thoughtful review. We appreciate your time and commitment.