用精简思维模板加速大模型推理,不生成冗长步骤。
Fast Thinking for Large Language Models
- 训练时用压缩思维草图学策略代码本,推理时快速调用。
- 在多个基准上准确率媲美甚至超越传统方法,推理成本大幅降低。
- 适合需要快速响应的场景,如实时问答、交互式应用。
面向推理的大语言模型通常依赖逐词生成显式推理过程,其性能高度依赖大规模监督微调或强化学习。尽管思维链(CoT)技术显著提升了复杂推理任务的表现,但效率低下,需生成长推理序列,导致延迟高、令牌消耗大。本文提出隐式代码本加速思考(Latent Codebooks for Fast Thinking)框架:训练阶段仅使用简洁的思维链草图学习离散策略先验代码本;推理阶段,模型通过单次传入从代码本中提炼的少量连续思考向量进行策略级引导,无需生成显式推理令牌。为配合该设计,我们提出轻量级路由机制GainRouter,可自适应切换快速代码本引导推理与慢速显式推理模式,抑制过度思考,减少无效令牌生成。多推理基准实验表明,该方法在保持竞争力甚至更优准确率的同时,显著降低推理开销,为大模型高效可控推理提供了实用路径。
原文摘要 · Abstract (English)
Reasoning-oriented Large Language Models (LLMs) often rely on generating explicit tokens step by step, and their effectiveness typically hinges on large-scale supervised fine-tuning or reinforcement learning. While Chain-of-Thought (CoT) techniques substantially enhance performance on complex reasoning tasks, they remain inefficient, requiring long reasoning traces that increase latency and token usage. In this work, we introduce Latent Codebooks for Fast Thinking, a framework that uses concise CoT sketches only during training to learn a codebook of discrete strategy priors. At inference, the model conditions on a handful of continuous thinking vectors distilled from the codebook in a single pass, enabling strategy-level guidance without producing explicit reasoning tokens. To complement this design, we propose GainRouter, a lightweight routing mechanism that adaptively switches between fast codebook guided inference and slow explicit reasoning, thereby suppressing overthinking and reducing unnecessary token generation. Experiments across multiple reasoning benchmarks show that our approach achieves competitive or superior accuracy while substantially lowering inference cost, offering a practical path toward efficient and controllable reasoning in large language models.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。