跳到正文
arXiv cs.CL· Aur Shalev Merin·· 12 小时前AI 评分31

存在却难读出:用最小对比对探测 Ouro-1.4B 与 Qwen2.5-1.5B 的潜在推理

Present but Hard to Read: Probing Latent Reasoning with Minimal Pairs

AI 导读

研究用最小对比对探测 Ouro-1.4B 和 Qwen2.5-1.5B 的潜在推理,发现题目中的数字在最后一个提示词 token 处已可读出(readout 约 0.9),但常规单提示词探针几乎读不出:Ouro 仅 0.36、Qwen 仅 0.19,即便训练了 5,249 道题。

正文 · 原文

View PDF HTML (experimental)

Abstract:Probing studies of latent reasoning often read a model's state where the answer begins and take a failed probe as evidence that a value is absent. We test this with a digit copied from the question, in the looped model Ouro-1.4B and the standard transformer Qwen2.5-1.5B. Comparing prompts that differ only in that digit shows it is present at the last prompt token, in a code shared across questions (readout about 0.9). A probe that sees one prompt at a time, the usual setting, barely reads it: 0.36 in Ouro and 0.19 in Qwen even after 5,249 training questions. The digit's change is small rather than crowded: random noise lands on equally busy directions, while a random word in its place moves the state far more and is readable. Since every varied token leaves a trace, a successful probe is ambiguous too. We give a protocol, including a synthetic null for generic mixing, for testing computed values against copies and mixtures of the inputs. In pre-registered studies of two-step problems it finds a small signal for the unwritten intermediate a+b just before Ouro writes the answer's last digit, and its sign follows the operation, though mixing alone produces much of that sign-following part. Holding that value at another problem's from the first loop on does not move the written digit toward the other problem's, while the same patch of the answer does: the value is readable but not used.
Comments: 20 pages, 5 figures
Subjects: Machine Learning (cs.LG); Computation and Language (cs.CL)
Cite as: arXiv:2610.28498 [cs.LG]
  (or arXiv:2610.28498v1 [cs.LG] for this version)
  https://doi.org/10.48550/arXiv.2610.28498

arXiv-issued DOI via DataCite (pending registration)

Submission history

From: Aur Shalev Merin [view email]
[v1] Tue, 20 Oct 2026 16:41:29 UTC (82 KB)

来源:arXiv cs.CL · arxiv.org