arXiv:2510.04116cs.AI2025-10被引 3

自动搜索推理骨架,让大模型更聪明地思考。

Searching Meta Reasoning Skeleton to Guide LLM Reasoning

  • 用有向无环图统一表示推理骨架,捕捉复杂逻辑依赖。
  • 在多个基准数据集上优于已有方法,显著提升推理准确率。
  • 适合需要高效自适应推理的场景,如智能问答与复杂决策。

元推理行为可作为大语言模型推理的骨架,从而提升推理性能。然而,以往研究多采用人工设计的骨架结构,难以适配具体查询需求,也难以捕捉推理步骤间的复杂逻辑依赖。为此,本文采用有向无环图(DAG)表示元推理骨架,统一已有方案并建模复杂依赖关系。提出AutoMR框架,受自动化机器学习(AutoML)启发,自动搜索查询相关的元推理骨架。基于DAG构建搜索空间,并定义搜索问题。设计动态骨架采样算法,在推理时根据上下文扩展骨架,能高效生成搜索空间内任意骨架,并随推理过程自适应调整。在多个基准数据集上的实验表明,AutoMR在广泛任务中均优于现有方法。

原文摘要 · Abstract (English)

Meta reasoning behaviors work as a skeleton to guide large language model (LLM) reasoning, thus help to improve reasoning performance. However, prior researches implement meta reasoning skeleton with manually designed structure, limiting ability to adapt to query-specific requirement and capture intricate logical dependency among reasoning steps. To deal with the challenges, we represent meta reasoning skeleton with directed acyclic graph (DAG) to unify skeletons proposed in prior works and model intricate logical dependency. Then we propose AutoMR, a framework that searches for query-aware meta reasoning skeleton automatically inspired by automated machine learning (AutoML). Specifically, we construct search space based on DAG representation of skeleton and then formulate the search problem. We design a dynamic skeleton sampling algorithm by expanding meta reasoning skeleton along with reasoning context at inference time. This algorithm can derive any meta reasoning skeleton in search space efficiently and adapt skeleton to evolving base reasoning context, thus enable efficient query-aware skeleton search. We conduct experiments on extensive benchmark datasets. Experimental results show that AutoMR achieves better reasoning performance than previous works broadly.

大模型推理自动搜索元推理

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。