community Lobsters AI Sat, 15 Aug 2026 正文 ok 311 words

潜在推理模型是否易于解释?

英文标题:Are Latent Reasoning Models Easily Interpretable?

潜在推理模型(LRM)以连续隐藏状态进行推理,相比显式推理模型具有更低的推理成本,并可在理论上并行探索多条推理路径,但其可解释性较弱。论文对两种先进 LRM 进行研究发现,在逻辑推理数据集上,模型通常即使完全不使用潜在推理 token,也几乎总能给出相同的最终答案。对于确实依赖潜在推理 token 的正确预测,研究者可在 65% 至 93% 的情况下解码出标准推理轨迹;此外,无需预先掌握标准轨迹,也能为多数正确预测找到经过验证的自然语言推理过程。研究表明,当前 LRM 很大程度上编码了可解释的过程,而可解释性本身可作为判断预测正确性的信号。
打开原文相关 2 · 机会 0
media2.1 KB media640 B media612 B media380 B media9.1 KB media32.7 KB media22.8 KB media24.2 KB media34.7 KB

中文

[提交于 2026 年 4 月 6 日(

v1

),最后修订于 2026 年 8 月 10 日(当前版本,v2)]

标题:潜在推理模型是否易于解释?

查看 Connor Dilgren 和 Sarah Wiegreffe 撰写的论文《潜在推理模型是否易于解释?》的 PDF。

查看 PDF HTML(实验版)

摘要:潜在推理模型(Latent Reasoning Models,LRM)因其较低的推理成本(相对于显式推理模型)以及在理论上能够并行探索多条推理路径的能力,受到了研究界的广泛关注。然而,这些优势的代价是可解释性下降:由于 LRM 不使用自然语言进行推理,因此难以对其进行监控。本文通过考察两种最先进的 LRM,研究其可解释性。首先,我们发现,潜在推理 token 对 LRM 的预测通常并非必需;在逻辑推理数据集上,LRM 几乎总能在完全不使用潜在推理的情况下,生成相同的最终答案。对推理 token 的这种利用不足,或许部分解释了为何 LRM 并未始终优于显式推理方法,也对既有研究中这些 token 被赋予的作用提出了疑问。其次,我们证明,当潜在推理 token 对性能确有必要时,对于预测正确的样本,我们能够在 65% 至 93% 的情况下解码出标准推理轨迹。这表明,LRM 往往执行的是预期的解题过程,而非不可解释的推理过程。最后,我们提出了一种方法:无需事先知道标准推理轨迹,即可从潜在 token 中解码出经过验证的自然语言推理轨迹。结果显示,对于大多数正确预测,可以找到经过验证的推理轨迹;而对于错误预测,只能在少数情况下找到此类轨迹。我们的发现强调,当前 LRM 在很大程度上编码了可解释的过程,而可解释性本身可以成为预测正确性的一个信号。

提交历史

作者:Connor Dilgren [

查看电子邮箱

]

[v1]

2026 年 4 月 6 日,星期一,17:50:06 UTC(651 KB)

[v2]

2026 年 8 月 10 日,星期一,13:30:13 UTC(699 KB)

English / 原文

[Submitted on 6 Apr 2026 (

v1

), last revised 10 Aug 2026 (this version, v2)]

Title:Are Latent Reasoning Models Easily Interpretable?

View a PDF of the paper titled Are Latent Reasoning Models Easily Interpretable?, by Connor Dilgren and Sarah Wiegreffe

View PDF HTML (experimental)

Abstract:Latent reasoning models (LRMs) have attracted significant research interest due to their low inference cost (relative to explicit reasoning models) and theoretical ability to explore multiple reasoning paths in parallel. However, these benefits come at the cost of reduced interpretability: LRMs are difficult to monitor because they do not reason in natural language. This paper presents an investigation into LRM interpretability by examining two state-of-the-art LRMs. First, we find that latent reasoning tokens are often unnecessary for LRMs' predictions; on logical reasoning datasets, LRMs can almost always produce the same final answers without using latent reasoning at all. This underutilization of reasoning tokens may partially explain why LRMs do not consistently outperform explicit reasoning methods and raises doubts about the stated role of these tokens in prior work. Second, we demonstrate that when latent reasoning tokens are necessary for performance, we can decode gold reasoning traces up to 65-93% of the time for correctly predicted instances. This suggests LRMs often implement the expected solution rather than an uninterpretable reasoning process. Finally, we present a method to decode a verified natural language reasoning trace from latent tokens without knowing a gold reasoning trace a priori, demonstrating that it is possible to find a verified trace for a majority of correct predictions but only a minority of incorrect predictions. Our findings highlight that current LRMs largely encode interpretable processes, and interpretability itself can be a signal of prediction correctness.

Submission history

From: Connor Dilgren [

view email

]

[v1]

Mon, 6 Apr 2026 17:50:06 UTC (651 KB)

[v2]

Mon, 10 Aug 2026 13:30:13 UTC (699 KB)