- Rating
- 3
- Confidence
- 3
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
This paper proposes MLRMem, a memory system for LLM agents. It combines task-level and step-level memories and checks whether the selected strategy remains useful after each action. The memory stays fixed during evaluation. On ALFWorld, success increases from 68.5% with AdaMEM-low to 73.5%. On WebShop, the average task score increases from 19.6 to 36.6. The paper also tests different backbones and removes individual components to study their effects.
Critical strengths
1.Better results. MLRMem improves over both tested memory baselines on ALFWorld and WebShop. On ALFWorld, the methods use the same source trajectories, which makes the comparison more useful.
2.Useful feedback checks. Removing re-verification lowers ALFWorld success from 73.5% to 52.9%. This supports checking whether a strategy still applies instead of keeping it until completion or expiry.
Critical weaknesses
-
Unfair runtime comparison. Page 7 states that concurrency and timing settings differ across methods. Therefore, the reported runtime reduction does not establish that MLRMem itself is faster. The abstract also claims no extra inference time cost, while the conclusion acknowledges additional model calls. Matched runtime settings and model-call and token counts are needed to support this central claim. The innovation seems too simple.
-
Limited evidence for task-level memory. In Figure 6(b), removing task-level memory changes overall success only from 73.5% to 73.4%. Task-level memory helps unseen tasks but hurts seen tasks. This supports a narrower benefit than the main framing suggests. The paper does not clearly show when the extra memory level is worth its added complexity and cost.
-
The selected primary area is “foundation or frontier models, including LLMs,” but the main contribution is an agent memory system. The paper does not propose a new model or training method. An agents-focused area seems more suitable.
Questions for authors
-
Under the same hardware, concurrency, and timing settings, does MLRMem still run faster than AdaMEM-low? Please include all checking calls and report token use and model-call counts.
-
Is the unseen-task gain from task-level memory consistent across runs? How does its inference cost compare with the step-level-only version?
-
How exactly are the selection score, penalties, and repeated lack of progress computed? These details affect which strategies are selected and withdrawn.
4 comments
W3: Research positioning and area selection.
Thank you for the suggestion. We agree that MLRMem is primarily an agent-centric framework rather than a new foundation model or model-training method. More specifically, our work investigates test-time memory and strategy management for LLM-based agents, enabling them to reuse task- and step-level experiences and re-verify strategy applicability during execution without updating model parameters. We selected “Foundation or frontier models, including LLMs” to reflect the paper’s focus on LLM-based agents and their inference-time memory mechanisms. We will further clarify this positioning in the paper. If the area assignment can still be revised, we would be happy to adjust our selection to a more appropriate area in accordance with the chairs’ guidance.
Q3: Selection score, penalties, and progress criteria.
Thank you for requesting these details, now specified in Appendices B.2–B.3. Candidates that pass the applicability and citation checks are ranked by with unit weights and each component in . The positive terms represent local relevance, goal alignment, confirmed-condition coverage, and progress potential; Appendix B.2 gives their exact mappings and fallback values. The conflict penalty is binary; the default looping penalty is 1 when the last three actions are identical and the candidate recommends repeating that action; redundancy is , where is the retrieved candidate count and counts candidates sharing the same source lineage. For withdrawal, three accumulated checker reports of no progress terminate active guidance, and supported or uncertain feedback does not reset this counter; separately, when no guidance is active and the task remains incomplete, unchanged goal-state and exploration records across three observations can trigger reselection (Appendix B.3). These rules distinguish candidate ranking from feedback-driven withdrawal, allowing guidance to change without automatically invalidating the stored experience.
Beyond the points above, we have expanded evaluation to WebArena and LoCoMo, additional model families, and large API-accessed models (Table 1, Figure 3, and Appendix D.5). We have also added baseline diagnostics and re-verification integrations (Appendix D.3 and Figure 8), experiments on initial-memory scale and cross-domain memory reuse (Table 2 and Figure 6), and analyses of verification noise, checker reliability, and boundary conditions (Figure 5 and Appendices D.1–D.2). We hope this broader evidence helps clarify the framework’s scope and practical value, and appreciate your time in considering the revised work.
Thank you for the thorough rebuttal and additional analyses. I appreciate the authors' efforts in revising the manuscript and will update my score accordingly.
Thank you for carefully considering our rebuttal and additional analyses, and for your willingness to update your assessment. Your feedback helped us clarify MLRMem’s contribution and strengthen the experimental evidence!
Our central contribution is to combine task-level guidance and step-level strategies with feedback-driven re-verification, enabling agents to reuse applicable experience and revise their guidance as execution conditions change.
If these clarifications and additional results have addressed your concerns, we would be grateful if you would consider revising your score upward. Thank you again for your time and effort in helping us make MLRMem better!
Thank you for your careful review and thoughtful suggestions, and for recognizing the value of execution-feedback checks and our comparisons using shared source trajectories. Your comments helped us focus the revision on the evidence needed to understand MLRMem’s contribution: when task-level memory is useful, what inference costs it incurs, and how strategy selection and withdrawal operate. We have revisited these issues through additional analyses and implementation refinements, and respond to each point below.
W1 & Q1: Runtime comparison, inference costs, and methodological contribution.
Thank you for pointing out this inconsistency. We revisited the timing records to answer your question directly: the available runs do not establish that MLRMem is faster under the same hardware, concurrency, and timing settings. On 70 tasks matched by game identity, MLRMem-Efficient records 952.8 versus 744.1 seconds of cumulative inference time per task for AdaMEM-low, with different serving loads and timing boundaries. We will therefore remove the abstract’s “no extra inference time cost” statement and replace the runtime-reduction claim with a comparison of success rates and inference costs, explicitly accounting for the additional model calls.
We report model-call counts and input/output token use across all 274 ALFWorld tasks with Qwen3.5-4B, including failed tasks (Appendices E.2–E.3, Tables 7–8). The MLRMem totals include action generation, all candidate-checking and re-verification calls, fact extraction, and retries and fallbacks; embedding requests are excluded from these LLM totals.
To reduce the checking overhead, MLRMem-Efficient shares context across candidate checks and combines fact extraction with feedback verification while retaining the original validators (Appendices E.1 and E.4). Relative to original MLRMem, this reduces calls by 41.3% and total tokens by 43.7%, with success changing from 73.5% to 73.0%. Compared with AdaMEM-low, it uses 11.6% fewer total tokens and achieves 4.5 percentage points higher success, while requiring 21.7% more calls. These results support a better success–token trade-off; they do not establish lower runtime.
Regarding the methodological contribution, MLRMem addresses how retrieved experience should continue to guide execution as the task state changes. It combines task-level guidance with step-level strategies, then uses subsequent feedback to reassess their applicability and withdraw guidance that no longer applies. In Figure 6(a), removing multi-level memory while retaining re-verification reduces success from 73.5% to 65.9%; disabling re-verification reduces it to 52.9%. These controls support the contribution of integrating memory selection with feedback-driven revision during execution.
W2 & Q2: Contribution and cost of task-level memory.
Thank you for highlighting the need to clarify when task-level memory is beneficial. Our diagnosis identified overly restrictive matching of source-task objects and destinations, together with incomplete delivery of task advice to the action prompt. We therefore introduced role-conditioned advice and an independent advice section while keeping the memory library unchanged (Appendix D.4). With the same executor, step-level memory, and re-verification retained, the two-seed pooled comparison improves seen and unseen success by 2.86 and 2.99 percentage points, respectively, raising overall success from 72.63% to 75.55% (Figure 10). Task advice is incorporated into existing model prompts without a separate advice-generation call; its direct overhead consists of retrieval and additional context, controlled through advice expiry and the context budget. These results indicate that task-level memory provides useful procedural guidance when retrieved experience is adapted to the current goal and made available during execution.