- Rating
- 3(+1)
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes MemDream, a framework for self-probing memory evolution that aims to automatically improve an LLM-based agent's memory by testing it, identifying weaknesses, and repairing them in the background before real queries fail. MemDream runs offline dream cycles with three agents: (1) a Dreamer that probes the memory graph with forward-looking queries, (2) an Analyst that diagnoses retrieval failures, and (3) a Consolidator that repairs the memory graph. The agents share a Llama-3.1-8B backbone with separate LoRA adapters, which are first trained with supervised fine-tuning on GPT-4.1 outputs, then individually optimized with Group Relative Policy Optimization (GRPO). Subsequently, Dreamer and Consolidator are jointly fine-tuned with GRPO while Analyst remains frozen. The framework also incorporates a soft-decay mechanism that provides reversible forgetting by reducing the retrieval priority of less relevant memory nodes rather than deleting them outright. MemDream is evaluated on LoCoMo and MemoryAgentBench (MAB) using GPT-4.1 and Llama-3.1-8B as reader models.
Critical strengths
The paper is well motivated, and its central idea is interesting. Following the key insight that a memory system should test itself, MemDream uses self-generated probing queries to find memory that is stored but cannot be retrieved, and repairs it before a real query fails. These probes are well grounded (Appendix H). Each expected answer is copied verbatim from the stored memory, so repairs cannot chase hallucinated targets, and the probes are shown not to overlap with the evaluation questions. The soft decay mechanism is simple, and the ablation confirms its importance.
Critical weaknesses
The paper lacks an experimental comparison with the closest methods. Auto-Dreamer, TrustMem, and RecMem are discussed only qualitatively (Appendix M). Could the authors provide a direct comparison under matched settings?
The ablation in Table 6 suggests that the gains may come mostly from the retrieval pipeline rather than the dream cycle. The "w/o Dreamer" variant performs no dream-guided maintenance, yet it still outperforms every baseline (52.09 vs. 51.16 average F1 for FluxMem). The dream cycle adds only about 3 points on top of this. The paper presents the dream cycle as the main source of improvement, but the main comparison does not isolate its contribution.
The rule-based probes outperform the LLM Dreamer in discriminative power and alignment (Figure 3d and Table 10), which weakens the contribution of the trained Dreamer. What empirical evidence justifies selecting the LLM Dreamer as the primary query generator?
Questions for authors
-
The paper states that queries arriving during a dream cycle are answered with the existing memory and recent context. However, such queries may still suffer from the retrieval failures the cycle is meant to fix. Could the authors discuss this limitation and clarify whether any mechanism ensures response reliability during an ongoing dream cycle?
-
The paper states that edges connect nodes sharing entities, but the entity extraction procedure is not specified. Since missing edges are precisely what the dream cycle is designed to detect and repair, this step is central to the method. Could the authors specify how entities are identified and matched across nodes?
-
The values of , , in Eq. 3, and the selection threshold are not reported. Could the authors provide these values and explain how they were chosen? The construction of the local probe query set is unclear. Bridge partners are selected by co-retrieval frequency across these queries, yet the Dreamer generates its probe only after the pair is selected. How is constructed, including its size and initialization, and how does the method handle cases with few or no local queries?
-
The authors state that pruning never loses information because decayed nodes remain accessible. However, a node with a very low weight may become effectively unretrievable, especially if it is pruned again in later cycles (e.g., 0.2, then 0.04). Since weight restoration in Eq. 6 depends on the success count, a node that is never retrieved may never be restored. Can an already pruned node be pruned again, and how can such nodes be recovered when they become relevant?
-
Per-agent reward weights are said to be reported in the appendix, but they are missing. Fixing weights in advance reduces benchmark-specific tuning, but it does not guarantee that the reward design is unbiased or effective. Could the authors provide these values and explain how they were chosen?
-
The paper does not explain why the Analyst is frozen during joint fine-tuning. Could the authors justify this choice and compare it with jointly fine-tuning all three agents or keeping all agents independently trained?
Minor comment: The abstract, introduction, and contributions describe GRPO as training a single repair policy, whereas Section 3.3 trains all three agents with GRPO. These sections should be revised to describe the training procedure accurately.
The authors have adequately addressed my concerns. I will raise my score and recommend acceptance.