arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2502.05078cs.AIcs.CL

自适应思维图:统一链、树与图结构的测试时自适应推理

Adaptive Graph of Thoughts: Test-Time Adaptive Reasoning Unifying Chain, Tree, and Graph Structures

Agnostiq Inc.(阿格诺斯蒂克公司)

Tushar Pandey, Ara Ghukasyan, Oktay Goktas, Santosh Kumar Radha

AI总结:

本文提出自适应思维图(AGoT),在测试时将复杂查询递归分解为动态有向无环图,按需扩展子问题,统一链、树、图推理优势,在科学推理等基准上实现最高46.2%的提升,以低成本替代训练后修改。

摘要:

大型语言模型(LLMs)已展现出令人印象深刻的推理能力,但其性能高度依赖于提示策略和模型规模。虽然强化学习和微调已被用于提升推理能力,但这些方法会带来大量的计算和数据开销。在本工作中,我们提出了自适应思维图(Adaptive Graph of Thoughts,AGoT),这是一种动态的、基于图的推理框架,仅在测试时增强LLM的推理能力。AGoT不依赖思维链(Chain of Thought,CoT)或思维树(Tree of Thoughts,ToT)等固定步骤方法,而是将复杂查询递归分解为结构化的子问题,形成一个由相互依赖的推理步骤组成的动态有向无环图(DAG)。通过选择性地仅扩展那些需要进一步分析的子问题,AGoT将链、树和图范式的优势统一到一个连贯的框架中,将计算分配到最需要的地方。我们在涵盖多跳检索、科学推理和数学问题求解的多个基准上验证了我们的方法,在科学推理任务(GPQA)上实现了高达46.2%的提升——与通过计算密集型强化学习方法获得的增益相当,并优于最先进的迭代方法。这些结果表明,动态分解和结构化递归为训练后修改提供了一种可扩展、成本效益高的替代方案,为LLMs中更稳健、通用的推理铺平了道路。

英文摘要:

Large Language Models (LLMs) have demonstrated impressive reasoning capabilities, yet their performance is highly dependent on the prompting strategy and model scale. While reinforcement learning and fine-tuning have been deployed to boost reasoning, these approaches incur substantial computational and data overhead. In this work, we introduce Adaptive Graph of Thoughts (AGoT), a dynamic, graph-based inference framework that enhances LLM reasoning solely at test time. Rather than relying on fixed-step methods like Chain of Thought (CoT) or Tree of Thoughts (ToT), AGoT recursively decomposes complex queries into structured subproblems, forming an dynamic directed acyclic graph (DAG) of interdependent reasoning steps. By selectively expanding only those subproblems that require further analysis, AGoT unifies the strengths of chain, tree, and graph paradigms into a cohesive framework that allocates computation where it is most needed. We validate our approach on diverse benchmarks spanning multi-hop retrieval, scientific reasoning, and mathematical problem-solving, achieving up to 46.2% improvement on scientific reasoning tasks (GPQA) - comparable to gains achieved through computationally intensive reinforcement learning approaches and outperforming state-of-the-art iterative approaches. These results suggest that dynamic decomposition and structured recursion offer a scalable, cost-effective alternative to post-training modifications, paving the way for more robust, general-purpose reasoning in LLMs.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑