Challenge: Existing methods for making decisions in grounded environments require costly gradient computation or lengthy in-context demonstrations.
Approach: They propose an approach to guide LLM-based agents to accomplish interactive decision-making tasks by using an LLM prompt and a task-solving plan.
Outcome: The proposed approach outperforms human-written demonstrations on ALFWorld and HotpotQA by 8%.

Similar Papers

AgentGym: Evaluating and Training Large Language Model-based Agents across Diverse Environments (2025.acl-long)

Copied to clipboard

Challenge: Large language models (LLMs) are promising foundations to build generally-capable agents . however, the community lacks a unified interactive framework that covers diverse environments for comprehensive evaluation of agents.
Approach: They propose a framework that features 7 real-world scenarios, 14 environments, and 89 tasks for unified, real-time, and concurrent agent interaction.
Outcome: The proposed framework features 7 real-world scenarios, 14 environments, and 89 tasks for unified, real-time, and concurrent agent interaction.
Efficient Sequential Decision Making with Large Language Models (2024.emnlp-main)

Copied to clipboard

Challenge: Existing approaches to retrain or finetune large language models (LLMs) for decision making suffer from computational burden of gradient updates.
Approach: They propose a model selection algorithm that leverages online model selection algorithms to efficiently incorporate LLMs agents into sequential decision making.
Outcome: The proposed approach outperforms both traditional decision making algorithms and vanilla LLM agents on a large-scale Amazon dataset.
AutoPRM: Automating Procedural Supervision for Multi-Step Reasoning via Controllable Question Decomposition (2024.naacl-long)

Copied to clipboard

Challenge: Recent advances in large language models (LLMs) have shown promise in multi-step reasoning tasks, yet relying on extensive manual labeling to provide procedural feedback remains a significant impediment.
Approach: They propose a self-supervised framework that decomposes complex problems into manageable subquestions with a controllable granularity switch and sequentially applies reinforcement learning to iteratively improve the subquest solver.
Outcome: The proposed framework improves performance on mathematical and commonsense reasoning tasks over SOTA.
AIPOM: Agent-aware Interactive Planning for Multi-Agent Systems (2025.emnlp-demos)

Copied to clipboard

Challenge: Large language models (LLMs) are being used for planning in orchestrated multi-agent systems . existing LLMs fall short of human expectations and lack effective mechanisms for users to inspect, understand, and control their behaviors.
Approach: They propose a system supporting human-in-the-loop planning through conversational and graph-based interfaces.
Outcome: AIPOM enables users to transparently inspect, refine, and collaboratively guide LLM-generated plans, significantly enhancing user control and trust in multi-agent workflows.
Interactive and Expressive Code-Augmented Planning with Large Language Models (2025.acl-long)

Copied to clipboard

Challenge: Large Language Models (LLMs) have strong abilities in common-sense reasoning and interactive decision-making, but struggle with complex, long-horizon planning tasks.
Approach: They propose a code-based LLM planning approach that is code-expressive while also dynamically adapting from errors.
Outcome: The proposed approach can be error-prone and insufficient for handling ambiguous or unstructured data.
Reasoning with Language Model is Planning with World Model (2023.emnlp-main)

Copied to clipboard

Challenge: Large language models (LLMs) have shown remarkable reasoning capabilities, particularly with Chain-of-Thought-style prompts.
Approach: They propose a framework that repurposes the LLM as both a world model and a reasoning agent and incorporates a principled planning algorithm (based on Monte Carlo Tree Search)
Outcome: The proposed framework repurposes the LLM as both a world model and a reasoning agent and incorporates a principled planning algorithm (based on Monte Carlo Tree Search) it achieves optimum balance between exploration and exploitation, while achieving high-reward reasoning paths efficiently.
LLM-A*: Large Language Model Enhanced Incremental Heuristic Search on Path Planning (2024.findings-emnlp)

Copied to clipboard

Challenge: Existing path planning algorithms suffer from significant computational and memory inefficiencies as the state space grows . large language models excel in environmental analysis but fall short in detailed spatial and temporal reasoning .
Approach: They propose a new path planning method that synergistically combines A* and LLMs to improve pathfinding efficiency.
Outcome: The proposed method improves pathfinding efficiency while maintaining integrity of path validity in large-scale scenarios.
AgentPro: Enhancing LLM Agents with Automated Process Supervision (2025.emnlp-main)

Copied to clipboard

Challenge: Existing frameworks lack explicit supervision during the reasoning process, which may lead to error propagation across reasoning chains.
Approach: They propose a framework which automates process supervision for large language model agents by automatically generating step-level annotations and developing a process reward model based on these annotations.
Outcome: The proposed framework outperforms existing agent-based methods on four datasets and achieves a 6.32% increase in accuracy.
ADaPT: As-Needed Decomposition and Planning with Language Models (2024.findings-naacl)

Copied to clipboard

Challenge: Large Language Models (LLMs) are increasingly being used for interactive decision-making tasks requiring planning and adapting to the environment.
Approach: They propose an approach that explicitly plans and decomposes complex sub-tasks when the LLM is unable to execute them.
Outcome: The proposed approach significantly outperforms established strong baselines, achieving success rates up to 28.3% higher in ALFWorld, 27% in WebShop, and 33% in TextCraft.
From Coarse to Fine: Self-Adaptive Hierarchical Planning for LLM Agents (2026.findings-acl)

Copied to clipboard

Challenge: Existing plans for large language model-based agents are limited by their granularity and lack flexibility.
Approach: They propose a self-adaptive hierarchical planning mechanism that mimics human planning strategies and generates self-adapted hierarchic plans tailored to the varying difficulty levels of different tasks.
Outcome: The proposed method significantly improves task execution success rates while mitigating overthinking at the planning level, providing a flexible and efficient solution for multi-step complex decision-making tasks.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations