arXivDaily arXiv每日学术速递 周一至周五更新
北美退伍军人节(Veterans Day),12 日无更新
arXiv 2601.09855cs.AIcs.CL
收藏

深入思考,但简短:大型推理模型的稳定序列测试时间扩展

Thinking Long, but Short: Stable Sequential Test-Time Scaling for Large Reasoning Models

Huawei Noah’s Ark Lab(华为诺亚实验室)

Michael R. Metel, Yufei Cui, Boxing Chen, Prasanna Parthasarathi

AI总结:

本文提出Min-Seek方法,通过高效管理KV缓存实现大型推理模型在扩展推理长度时的稳定性与准确性提升。

摘要:

序列测试时间扩展是一种有前景的无训练方法,用于提高大型推理模型的准确性,但目前实施中存在显著的局限性。诱导模型进行更长时间的思考可以提高其准确性,但随着推理长度的进一步延长,也已显示会导致准确性下降和模型不稳定。本文提出了一种新的序列测试时间扩展方法,Min-Seek,该方法在广泛的诱导思考范围内显著提高了模型的准确性,稳定了序列扩展的准确性,并消除了对推理长度微调的需求。除了在各种推理任务上提高模型准确性外,我们的方法本质上是高效的,因为在推理过程中只保留一个额外诱导思考的KV对。通过使用一种自定义的KV缓存,该缓存存储没有位置嵌入的键,通过在每次生成新思考前动态编码它们为连续的,我们的方法可以在模型最大上下文长度之外继续推理,并在温和条件下具有线性计算复杂性。

英文摘要:

Sequential test-time scaling is a promising training-free method to improve large reasoning model accuracy, but as currently implemented, significant limitations have been observed. Inducing models to think for longer can increase their accuracy, but as the length of reasoning is further extended, it has also been shown to result in accuracy degradation and model instability. This work presents a novel sequential test-time scaling method, Min-Seek, which improves model accuracy significantly over a wide range of induced thoughts, stabilizing the accuracy of sequential scaling, and removing the need for reasoning length fine-tuning. Beyond improving model accuracy over a variety of reasoning tasks, our method is inherently efficient, as only the KV pairs of one additional induced thought are kept in the KV cache during reasoning. With a custom KV cache which stores keys without position embeddings, by dynamically encoding them contiguously before each new generated thought, our method can continue to reason well beyond a model's maximum context length, and under mild conditions has linear computational complexity.

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

↑