Textualized Agent-Style Reasoning for Complex Tasks by Multiple Round LLM Generation
Chen Liang, Zhifan Feng, Zihe Liu, Wenbin Jiang, Jinan Xu, Yufeng Chen, Yong Wang
TL;DR
AgentCOT introduces a textualized agent-style reasoning framework that uses multiple rounds of LLM generation to solve complex tasks, addressing hallucination, interpretability, and uncontrollable generation in chain-of-thought prompting. It structures reasoning into iterative states $S^i$ containing $a^i$, $a_{des}^i$, $E_{inter}^{i}$, and $R_{inter}^{i}$, and it integrates state indices to form an implicit state graph for richer inference. The approach adds enhanced self-consistency and state-level ensemble to enable divergent reasoning paths and per-step quality checks. Experimental results across six benchmarks spanning arithmetic, commonsense, and multi-hop QA show competitive gains over strong COT-based baselines and PAL, with pronounced improvements on multi-hop and arithmetic tasks. These findings demonstrate that an agent-based reasoning paradigm can improve reliability, traceability, and controllability of LLM-driven problem solving in complex tasks.
Abstract
Chain-of-thought prompting significantly boosts the reasoning ability of large language models but still faces three issues: hallucination problem, restricted interpretability, and uncontrollable generation. To address these challenges, we present AgentCOT, a llm-based autonomous agent framework, which can solve complex problems in an agent-style manner by multiple round LLM generation. At each step, AgentCOT selects an action and executes it to yield an intermediate result with supporting evidence. In addition, we integrate the step's index into the reasoning process to form a graph structure for complex inference logic. We introduce two new strategies to enhance the performance of AgentCOT.We conduct extensive experiments to verify the effectiveness of our method on six common benchmarks. Results exhibit that our method brings in substantial improvements over current competitive approaches.
