- Rating
- 3
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper proposes Goal-structured Procedural Memory, a procedural memory framework for LLM agents. The method reconstructs a goal tree from completed React trajectories and uses it for memory extraction, verification, and reuse at different granularities. Through goal scoped verification, GPM verifies memory cards against goal relevant execution evidence before storing them for reuse in future tasks. Experiments on AppWorld with two different LLM backbones show that GPM improves task completion rates by 3.8 and 7.4 pp, respectively. Ablation studies further demonstrate the effectiveness of goal scoped verification and multi-granularity memory design.
Critical strengths
-
The unified goal tree design supports multi-granularity memory extraction and verification. The authors reconstruct a goal tree from completed ReAct trajectories and uses it for memory extraction, admission, and reuse. This design allows the agent to extract and reuse procedures at different granularities while using goal-related execution records to verify the extracted memories. The goal tree is constructed after execution, so the method does not require additional model training or hierarchical planning during runtime. This makes the framework relatively simple and practical.
-
Goal-scoped verification improves memory reliability. The authors conduct a controlled ablation study to evaluate goal-scoped verification. By restricting the verification evidence from the full trajectory to the corresponding goal tree region, invalid admission decreases from 39.5% to 31.9%, while valid retention only slightly decreases from 92.9% to 91.7%. These results provide direct evidence that goal-scoped verification can reduce invalid memories without significantly affecting the retention of valid ones, which is important for maintaining reliable long-term procedural memory.
Critical weaknesses
-
Lack of direct comparisons with existing procedural memory methods. The paper mainly compares GPM with ReAct and ReAct + TODO, without direct comparisons with existing procedural memory methods such as MetaFlowLLM and MemP. These methods also investigate hierarchical experience organization and multi-granularity memory reuse. Therefore, the current experiments do not sufficiently demonstrate the advantages of GPM over existing approaches.
-
Lack of validation of goal tree reconstruction reliability. Memory extraction, admission, and reuse in GPM all depend on the reconstructed goal tree. Errors in the goal hierarchy or the assignment of action-observation records may directly affect memory quality and downstream task performance. The paper does not directly evaluate the accuracy of goal tree reconstruction or analyze how reconstruction errors affect memory admission and task success rates.
Questions for authors
-
Given the similarities with existing procedural memory methods discussed above, could the authors provide direct comparisons with existing procedural memory methods such as MetaFlowLLM and MemP to better demonstrate the advantages of GPM?
-
The reliability of goal tree reconstruction remains a concern. Could the authors evaluate the accuracy of goal tree reconstruction and analyze how reconstruction errors affect memory admission and downstream task performance?
2 comments
Thank you for your thoughtful review and for taking the time to follow up. We're glad to hear that the revised manuscript addressed the concerns you raised. Your suggestions on the baseline comparisons and the evaluation of Goal Tree reconstruction helped us strengthen the paper. We appreciate the care you took in reviewing our work and the opportunity to improve it.
The response from author addressed my concern. I will keep my score unchanged.