- Rating
- 1
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper proposes M-Plan, a closed-loop multi-agent framework for long-horizon LLM agents that integrates non-parametric long-term memory with a short-term planning and guidance mechanism. The short-term memory comprises a Planner (milestones), an Insighter (task-specific global insights), and a conditionally triggered Hinter (local hints which is activated only when the agent falls into loops or invalid actions), while an Optimizer refines completed trajectories and reorganizes milestones/insights before storing them back into a graph-structured long-term memory.
Experiments on ALFWorld, Webshop, and a PDDL-based benchmark show consistent gains in success rate, reward, step efficiency, and an introduced token-efficiency metric over representative memory-reuse and step-wise guidance baselines.
Critical strengths
M-plan introduces a well-structured combination of global (milestones + insights) and conditional local hints, avoiding expensive per-step hinting while still correcting common multi-turn pitfalls. A simple graph-based one-hop expansion on top of vector retrieval is a reasonable, low-cost way to diversify references for short-term guidance without heavy step-wise retrieval.
Evaluates across three standard multi-turn benchmarks with different characteristics (embodied text environment, web navigation, symbolic tasks), and with two backbone model sizes, showing robustness. The conditional triggering logic for the Hinter is described (loose vs strict regimes) and justified by environment characteristics. Overall the paper addresses the core challenge of token/latency costs in per-step MAS while retaining strong corrective power via conditional hinting.
Critical weaknesses
The Ft/Ct token-efficiency metric is ad-hoc. The analysis contains a mathematical misstatement (it claims Ft attains a maximum at SR=0.5 whereas Ft is monotonic in SR, and it is the first derivative that peaks around SR=0.5). Also conditional hinting rules are heuristic (similar other are - a) one-hop memory expansion policy; b) criteria for “polishing” milestones; and c) the profit/efficiency metric) and depend on environment feedback. Paper provide no analysis on false positives/negatives or sensitivity to trigger thresholds.
The reported token usage (At) appears surprisingly low given multi-agent prompting and environment interactions; token accounting methodology (input vs output, environment observation size, system prompts) is insufficiently specified. I also find that comparisons largely omit strong recent hybrid/planning baselines that couple LLMs with symbolic planners or programmatic policies, which are directly relevant to the PDDL-style setting and many other step-wise or retrieval agents (e.g., ReAct variants, step-wise thought retrieval etc.) are mentioned but not included as strong baselines in the main tables. Some references are provided here
[1] Yao, Shunyu, et al. "React: Synergizing reasoning and acting in language models." arXiv preprint arXiv:2210.03629 (2022). [2] Shinn, Noah, et al. "Reflexion: Language agents with verbal reinforcement learning." Advances in neural information processing systems 36 (2023): 8634-8652. [3] Verma, Nikhil, and Manasa Bharadwaj. "LEAP & LEAN: Look-ahead Planning and Agile Navigation for LLM Agents." Proceedings of the 63rd Annual Meeting of the Association for Computational Linguistics (Volume 6: Industry Track). 2025. [4] Liu, Yuxin, et al. "MAP: A Map-then-Act Paradigm for Long-Horizon Interactive Agent Reasoning." arXiv preprint arXiv:2605.13037 (2026).
Questions for authors
- How exactly are tokens counted for At? Do you include both input and output tokens, system prompts, environment observations, and all multi-agent calls? What tokenizer and accounting tooling are used?
- For the Optimizer, what concrete rules distinguish “redundant” milestones in practice, and how often does milestone polishing materially change subsequent performance? An ablation on Optimizer sub-components would help (polish-only, refine-only, sparsify-only).
- On PDDL tasks, could you include at least one hybrid symbolic baseline (e.x. TwoStep, PSALM, or a programmatic-planner baseline like LMP LAN/GenePlan) to contextualize M-Plan’s performance on symbolic reasoning tasks?