Summary
This paper proposes SOP-Agent, a framework that enables an LLM-based agent to leverage domain-specific knowledge by representing SOPs as decision graphs and conveying them to the LLM in a pseudo-code text format. The authors validate SOP-Agent across various benchmarks and introduce a new benchmark specifically designed for customer service scenarios.
Strengths
- The concept of using SOPs to enable an LLM-based agent to effectively utilize domain-specific knowledge is well-founded.
- The authors validate the SOP-Agent across diverse benchmarks.
- The introduction of a Grounded Customer Service Benchmark targets a practical application area and could be valuable for further research into LLM-based customer service solutions.
Weaknesses
- The primary limitation of SOP-Agent is that, while the paper critiques existing domain-specific agents for relying on hardcoded, human-designed workflows, SOP-Agent itself is subject to the same limitation. SOP-Agent still requires human expertise to design the decision graph, which can become large and challenging in complex domains.
- The explanation of SOP-Agent is insufficient. For example, the interaction between the decision graph and the LLM agent lacks clarity, including how SOP-Agent determines which node to execute, how it evaluates condition satisfaction after each action, what input is provided to the LLM agent at each step, and how the model handles the generation of actions not included in the decision graph.
- The fixed decision graph approach appears similar to behavior tree methods, such as MOSAIC [1]. To highlight the novelty of SOP-Agent, it would be helpful to explain how it differs from these existing methods.
- The use of a predefined decision graph limits adaptability, making it difficult for SOP-Agent to handle unexpected situations.
- There is a concern that the Data Cleaning experiment could not be appropriate for evaluating LLM agent performance.
- The performance gap between SOP-Agent and ReAct is minimal in the ALFWorld and HotpotQA experiments, and in the code generation task, SOP-Agent performs worse than some other algorithms. Justification for SOP-Agent’s advantages over these methods is needed.
- Although the motivation behind the proposed Grounded Customer Service Benchmark is sound, the benchmark’s difficulty appears relatively low. With a maximum depth of 4.52 and an average of 1.94 child nodes per node, as evidenced by SOP-Agent’s high performance (99.8%).
- *(Minor)* The citation format should be improved.
- *(Minor)* Using mathematical notation for performance metrics would enhance readability.
[1] Wang, Huaxiaoyue, et al. "MOSAIC: A Modular System for Assistive and Interactive Cooking." *arXiv preprint arXiv:2402.18796* (2024).
Questions
- What are the advantages of SOP-Agent’s decision graph design compared to MetaGPT’s multi-agent SOP setup? (In other words, what benefits does designing SOPs as a decision graph offer over the multi-agent approach used by MetaGPT?)
- How does the decision graph approach differ from behavior trees, such as those used in MOSAIC [1]?
- Can the input token counts for SOP-Agent, ReAct, Auto-GPT, and MetaGPT be compared to assess efficiency?
- In the code generation experiments, could more detail be provided about the use of long-term memory? Additionally, since it is unclear whether the observed performance is due to memory or SOP-Agent itself, could ablation study results be shared?
- Do the authors believe the Grounded Customer Service Benchmark is sufficiently challenging? Additionally, how would ReAct perform in a few-shot setting, and are SOP-Agent’s results based on a zero-shot setup?