Challenge: Flow-adhering planning algorithm for task oriented dialogs (TODs) is a task-oriented dialog (TO) that can be used for task planning and API usage.
Approach: They propose a Flow-Adhering Planning algorithm that follows predefined flows and preserves API dependencies in task oriented dialogs.
Outcome: The proposed algorithm outperforms other decoding and prompting-based baselines in task oriented dialogs.

Similar Papers

FlowBench: Revisiting and Benchmarking Workflow-Guided Planning for LLM-based Agents (2024.findings-emnlp)

Copied to clipboard

Challenge: LLM-based agents are susceptible to undesired planning hallucinations when lacking specific knowledge for expertise-intensive tasks.
Approach: They propose a benchmark to evaluate the efficacy of workflow-guided agent planning by formalizing different formats of workflow knowledge.
Outcome: The proposed benchmark aims to improve the planning reliability of LLM-based agents by incorporating external workflow-related knowledge.
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.
AdaptFlow: Adaptive Workflow Optimization via Meta-Learning (2025.findings-emnlp)

Copied to clipboard

Challenge: Existing approaches to large language models rely on static templates or manual workflows.
Approach: AdaptFlow is a language-based meta-learning framework inspired by model-agnostic meta- learning.
Outcome: AdaptFlow outperforms manual and automated workflows on question answering, code generation and mathematical reasoning benchmarks.
Programming over Thinking: Efficient and Robust Multi-Constraint Planning (2026.acl-long)

Copied to clipboard

Challenge: Existing large language model approaches lack flexibility in multi-constraint planning . SCOPE achieves state-of-the-art performance while lowering cost and latency .
Approach: They propose a framework that disentangles query-specific problem reasoning from generic code execution.
Outcome: The Scalable Code Planning Engine achieves state-of-the-art performance while lowering cost and latency.
Guideline Compliance in Task-Oriented Dialogue: The Chained Prior Approach (2025.findings-naacl)

Copied to clipboard

Challenge: Existing solutions based on large language models cannot achieve strict guideline compliance . a novel TOD system is being developed to improve guideline adherence .
Approach: They propose a task-oriented dialogue system that explicitly considers domain-specific guidelines by integrating a policy module.
Outcome: The proposed system achieves 20% better guideline compliance than state-of-the-art solutions.
Iterative Formalization and Planning in Partially Observable Environments (2026.findings-acl)

Copied to clipboard

Challenge: Existing methods to formalize an environment into the Planning Domain Definition Language (PDDL) have been shown to improve performance and control.
Approach: They propose a framework to iteratively formalize, plan, grow, and refine PDDL representations by decomposing the environment and the goal into fully observable episodes.
Outcome: The proposed framework improves planning success and exhibits robustness against problem complexity compared to end-to-end approaches.
Unlocking the Future: Exploring Look-Ahead Planning Mechanistic Interpretability in Large Language Models (2024.emnlp-main)

Copied to clipboard

Challenge: Recent studies have shown that large language models may possess preliminary planning capabilities.
Approach: They examine the look-ahead planning mechanism in large language models from the perspectives of information flow and internal representations.
Outcome: The proposed model can decode the decision from the output of MHSA in the middle layers at the last token.
Planning with Multi-Constraints via Collaborative Language Agents (2025.coling-main)

Copied to clipboard

Challenge: Recent advances in neural language models have sparked a new surge of intelligent agent research.
Approach: They propose a method for collaborative LLM-based multi-agent systems that simplifies complex task planning with constraints by decomposing it into a hierarchy of subordinate tasks.
Outcome: The proposed method achieves an average success rate of 42.68% on two constraint-intensive benchmarks, TravelPlanner and API-Bank.
A Drop-In Solution for On-the-Fly Adaptation of Speculative Decoding in Large Language Models (2025.acl-long)

Copied to clipboard

Challenge: Large Language Models (LLMs) are highly memory-intensive when performing real-time inference.
Approach: They propose a technique that allows for speculative decoding to be run on the fly to maximize the efficiency of LLM inferences.
Outcome: The proposed solution can lead to 3.55-16.48% speed improvement over the standard speculative decoding, and 1.2-3.4 over the default LLMs.
PlanGenLLMs: A Modern Survey of LLM Planning Capabilities (2025.acl-long)

Copied to clipboard

Challenge: Existing studies have focused on developing LLMs to automate complex planning tasks.
Approach: They propose to provide a comprehensive overview of current LLM planners to fill this gap . they examine performance criteria including completeness, executability, optimality, representation, generalization, and efficiency .
Outcome: The proposed survey examines performance criteria for LLM planners and highlights their strengths and weaknesses.

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