arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2511.08577cs.CLcs.AIcs.LGcs.PF
收藏

Think-at-Hard: 选择性潜在迭代以改进推理语言模型

Think-at-Hard: Dynamic Looped Transformers for Improved Reasoning

Tsinghua University(清华大学);Shanghai Jiao Tong University(上海交通大学)

Tianyu Fu, Yichen You, Zekai Chen, Guohao Dai, Huazhong Yang, Yu Wang

AI总结:

针对循环变压器中潜在过思考问题,提出Think-at-Hard方法,通过轻量级决策器选择性地在困难令牌上触发潜在迭代,并采用深度感知LoRA和双因果注意力机制,在数学、问答和编码任务上一致提升性能。

摘要:

提升大型语言模型(LLMs)的推理能力,特别是在参数约束下,对实际应用至关重要。循环变压器通过执行多次潜在迭代来细化每个令牌,超越单次前向传播。然而,我们识别出一种潜在过思考现象:大多数令牌预测在第一次前向传播后已经正确,但在后续迭代中有时会被修改为错误。我们询问选择性地跳过潜在迭代是否能提高准确性,并揭示了一个显著的潜力:使用预言迭代策略可将性能提升高达7.3%。受此启发,我们提出了Think-at-Hard (TaH),一种针对选择性迭代优化的循环变压器。TaH采用轻量级神经决策器来触发潜在迭代,仅在标准前向传播后可能不正确的令牌上触发。在潜在迭代期间,深度感知的低秩适应(LoRA)模块将目标从一般的下一个令牌预测转变为聚焦的困难令牌细化。双因果注意力机制将注意力从令牌序列维度扩展到额外的迭代深度维度,实现跨迭代信息流,同时保持完全的序列并行性。在九个基准上的实验显示,在数学、问答和编码任务上一致提升。在相同参数数量下,TaH在93%的令牌上跳过迭代,性能比始终迭代的基线高3.8-4.4%,并超过单次迭代的Qwen3基线3.0-3.8%。当允许LoRA和决策器增加不到3%的参数时,增益分别进一步增加到5.3-6.2%和6.1-6.8%。我们的代码可在以下网址获取:https://this URL。

英文摘要:

Improving the reasoning abilities of Large Language Models (LLMs), especially under parameter constraints, is crucial for real-world applications. Looped transformers address this by performing multiple latent iterations to refine each token beyond a single forward pass. However, we identify a latent overthinking phenomenon: most token predictions are already correct after the first pass, but are sometimes revised into errors in later iterations. We ask whether selectively skipping latent iterations can improve accuracy, and reveal significant potential with an oracle iteration policy that boosts performance by up to 7.3%. Motivated by this, we propose Think-at-Hard (TaH), a looped transformer optimized for selective iteration. TaH employs a lightweight neural decider to trigger latent iteration, only at tokens likely to be incorrect after the standard forward pass. During latent iterations, depth-aware Low-Rank Adaptation (LoRA) modules shift the objective from general next-token prediction to focused hard-token refinement. A duo-causal attention mechanism extends attention from the token sequence dimension to an additional iteration depth dimension, enabling cross-iteration information flow with full sequential parallelism. Experiments on nine benchmarks show consistent gains across math, QA, and coding tasks. With identical parameter counts, TaH outperforms always-iterate baselines by 3.8-4.4% while skipping iterations on 93% of tokens, and exceeds single-iteration Qwen3 baselines by 3.0-3.8%. When allowing <3% more parameters from LoRA and decider, the gains further increase to 5.3-6.2% and 6.1-6.8%, respectively. Our code is available at https://github.com/thu-nics/TaH.

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

↑