让大模型像专家一样有策略地思考,解决推理混乱、难收敛的问题。
Heuristic Classification of Thoughts Prompting (HCoT): Integrating Expert System Heuristics for Structured Reasoning into Large Language Models
- 用启发式分类框架动态控制推理过程,让思考有结构
- 在两个复杂推理任务上超越现有方法,24点游戏更省计算资源
- 适合需要稳定可靠推理的高难度任务,如数学证明或决策规划
本文针对大语言模型(LLM)在解决复杂问题时的两大缺陷:一是推理过程呈贝叶斯式随机生成,每个词元从上下文依赖的概率分布中采样,导致决策路径本质上随机而非确定性规划;二是推理与决策机制静态解耦,动态获取的领域知识无法动态调整底层推理策略。这使得初始决策缺乏战略锚定,推理链常无法收敛至正确解。为此,我们提出一种嵌入生成过程的求解方法,兼容多种LLM且支持方案复用,基于新型思维启发式分类提示框架(HCoT)。HCoT通过启发式分类模型将LLM推理能力与结构化问题空间结合,实现对推理过程的可控引导并提供可复用的抽象解。在两个搜索空间定义不明确的复杂归纳推理任务上,HCoT性能优于现有方法(如Tree-of-Thoughts和Chain-of-Thoughts)。在结构良好的24点游戏中,其令牌效率显著高于最先进的Tree-of-Thoughts-Breadth-First-Search。在准确率与令牌使用量之间,HCoT达成帕累托最优平衡,展现出优异的性能-成本权衡。
原文摘要 · Abstract (English)
This paper addresses two limitations of large language models (LLMs) in solving complex problems: (1) their reasoning processes exhibit Bayesian-like stochastic generation, where each token is sampled from a context-dependent probability distribution, leading to inherently random decision trajectories rather than deterministic planning; (2) the reasoning and decision-making mechanisms are statically decoupled, meaning dynamically retrieved domain knowledge fails to dynamically adjust the underlying reasoning strategy. These dual deficiencies result in initial decisions lacking strategic anchoring and reasoning chains often failing to converge on correct solutions, as stochastic generation lacks mechanisms for trajectory correction or knowledge-guided optimization during sequential reasoning. To resolve these issues, we propose a problem-solving method integrated into the LLM's generation process to guide reasoning. This method, compatible with numerous LLMs and featuring reusable solutions, is grounded in a novel Heuristic-Classification-of-Thoughts prompting schema (HCoT). HCoT synergizes the LLM's reasoning ability with a structured problem space via a heuristic classification model that controls the reasoning process and provides reusable abstract solutions. Evaluated on two complex inductive reasoning tasks with ill-defined search spaces, HCoT outperforms existing approaches (e.g., Tree-of-Thoughts and Chain-of-Thoughts prompting) in performance. On the well-structured 24 Game task, HCoT demonstrates significantly higher token efficiency compared to the state-of-the-art Tree-of-Thoughts-Breadth-First-Search. In terms of both accuracy and token usage, HCoT achieves a Pareto frontier balance, offering a strong trade-off between performance and computational cost.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。