arXiv 论文:重新思考固定长度的潜空间推理
Rethinking Fixed-Horizon Latent Reasoning
AI 导读
arXiv 论文发现,潜空间思维链(CoT)延长到预设全程反而可能降低推理性能:后期计算主要重组已有候选答案,可能削弱正确候选的支持度。作者提出一种轻量方法,估计剩余推理进展并在推理时自适应调整潜空间长度。在多个算术 benchmark 上,该方法最高提升推理准确率 7.2 个百分点、减少最多 29.0% 的潜空间计算,且无需重新训练 LLM。
正文 · 原文
Abstract:Existing latent reasoners typically run for a preset latent horizon during inference. Intuitively, a longer horizon should provide more opportunity for reasoning. However, in this work, we find that extending latent Chain-of-Thought (CoT) to the full preset horizon may in fact degrade reasoning performance. We observe that latent CoT evolves through distinct functional stages, with earlier computation forming frontier reasoning states, while later computation mainly reorganizes existing candidates and can weaken gold candidate support. These findings motivate a rethink of fixed-horizon latent inference. To address this, we characterize the reasoning benefits of latent CoT by realized and remaining constructive progress. Empirically, we find that higher realized constructive progress corresponds to higher current reasoning accuracy, while more remaining progress corresponds to larger future gains from continued latent CoT. To this end, we introduce a lightweight method that estimates the remaining reasoning progress and adaptively adjusts the latent horizon during inference. Across representative latent CoT reasoners and multiple arithmetic benchmarks, our method improves reasoning accuracy by up to 7.2 percentage points while reducing latent computation by up to 29.0%, without retraining the LLM.
| Comments: | 21 pages, 4 figures |
| Subjects: | Machine Learning (cs.LG); Artificial Intelligence (cs.AI); Computation and Language (cs.CL) |
| Cite as: | arXiv:2611.24001 [cs.LG] |
| (or arXiv:2611.24001v1 [cs.LG] for this version) | |
| https://doi.org/10.48550/arXiv.2611.24001 arXiv-issued DOI via DataCite (pending registration) |
Submission history
From: Tianxiang Chen [view email]
[v1]
Wed, 18 Nov 2026 07:49:12 UTC (461 KB)
来源:arXiv cs.AI · arxiv.org