arXiv:2603.28135cs.AI2026-03被引 2

让AI在推理时自主决定何时扩展、修剪或放弃,提升准确率且更省算力。

CoT2-Meta: Budgeted Metacognitive Control for Test-Time Reasoning

  • 通过元认知控制动态管理推理过程,决定何时扩展或剪枝路径。
  • 在相同算力下,多项基准测试精度领先,最高提升4.3点。
  • 适合需要高效、可靠推理的场景,如复杂问答与代码生成。

近期测试时推理方法通过生成更多候选推理链或搜索更大推理树提升性能,但通常缺乏对何时扩展、如何剪枝、是否修复及何时放弃的明确控制。我们提出CoT2-Meta,一种无需训练的元认知推理框架,结合对象级思维链生成与对部分推理轨迹的元级控制。该框架包含四项组件:策略条件化思维生成、树状结构搜索、在线步骤级推理评估器,以及通过扩展、剪枝、修复、停止和回退决策分配计算的元控制器。在匹配的推理预算下,CoT2-Meta持续优于强单路径、采样和搜索基线,包括ReST-MCTS。在默认主干模型上,其在MATH上达到92.8 EM,GPQA为90.4准确率,GSM8K为98.65 EM,BBEH为75.8准确率,MMMU-Pro为85.6准确率,HLE为48.8准确率,相较最强非CoT2-Meta基线分别提升+3.6、+5.2、+1.15、+2.0、+4.3、+4.3点。此外,在覆盖知识问答、多跳推理、编程与分布外评估的15个基准套件中仍有效。分析显示其具备更好的算力扩展性、校准性、选择性预测能力、定向修复行为,并在不同主干模型中保持一致优势。结果表明,显式元认知控制是构建可靠、高效测试时推理系统的重要设计原则。

原文摘要 · Abstract (English)

Recent test-time reasoning methods improve performance by generating more candidate chains or searching over larger reasoning trees, but they typically lack explicit control over when to expand, what to prune, how to repair, and when to abstain. We introduce CoT2-Meta, a training-free metacognitive reasoning framework that combines object-level chain-of-thought generation with meta-level control over partial reasoning trajectories. The framework integrates four components: strategy-conditioned thought generation, tree-structured search, an online process oracle for step-level reasoning evaluation, and a meta-controller that allocates computation through expansion, pruning, repair, stopping, and fallback decisions. Under matched inference budgets, CoT2-Meta consistently outperforms strong single-path, sampling-based, and search-based baselines, including ReST-MCTS. On the default backbone, it achieves 92.8 EM on MATH, 90.4 accuracy on GPQA, 98.65 EM on GSM8K, 75.8 accuracy on BBEH, 85.6 accuracy on MMMU-Pro, and 48.8 accuracy on HLE, with gains over the strongest non-CoT2-Meta baseline of +3.6, +5.2, +1.15, +2.0, +4.3, and +4.3 points, respectively. Beyond these core results, the framework remains effective across a broader 15-benchmark suite spanning knowledge and QA, multi-hop reasoning, coding, and out-of-distribution evaluation. Additional analyses show better compute scaling, improved calibration, stronger selective prediction, targeted repair behavior, and consistent gains across backbone families. These results suggest that explicit metacognitive control is a practical design principle for reliable and compute-efficient test-time reasoning systems.

元认知推理优化测试时推理算力效率

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