ADaPT: As-Needed Decomposition and Planning with Language Models
This addresses the challenge of task complexity for LLM-based agents in interactive environments, representing a novel method rather than an incremental improvement.
The paper tackles the problem of LLMs struggling with complex interactive decision-making tasks by introducing ADaPT, an approach that recursively decomposes sub-tasks as-needed, resulting in success rates up to 28.3% higher in ALFWorld, 27% in WebShop, and 33% in TextCraft compared to baselines.
Large Language Models (LLMs) are increasingly being used for interactive decision-making tasks requiring planning and adapting to the environment. Recent works employ LLMs-as-agents in broadly two ways: iteratively determining the next action (iterative executors) or generating plans and executing sub-tasks using LLMs (plan-and-execute). However, these methods struggle with task complexity, as the inability to execute any sub-task may lead to task failure. To address these shortcomings, we introduce As-Needed Decomposition and Planning for complex Tasks (ADaPT), an approach that explicitly plans and decomposes complex sub-tasks as-needed, i.e., when the LLM is unable to execute them. ADaPT recursively decomposes sub-tasks to adapt to both task complexity and LLM capability. Our results demonstrate that ADaPT substantially outperforms established strong baselines, achieving success rates up to 28.3% higher in ALFWorld, 27% in WebShop, and 33% in TextCraft -- a novel compositional dataset that we introduce. Through extensive analysis, we illustrate the importance of multilevel decomposition and establish that ADaPT dynamically adjusts to the capabilities of the executor LLM as well as to task complexity.