跳到正文
研踪PaperTrail

论文库

检索计算机领域论文,按研究方向、作者或关键词筛选。

部分采集异常
正在读取账号与研究记录…

全站更新概况

+0新增论文
+0其中 AI 相关
+0已有论文修订
+93新增 AI 导读

arXiv 最近完成扫描:2026-11-16 01:34 · 全站最近入库:2026-11-14 15:09各信源进度 →

统计口径与数据新鲜度

统计 2026-11-15 06:11 — 2026-11-16 06:11(北京时间) · 点击数字查看对应简报;AI 相关包含在新增论文内。

最近完成检查:2026-11-16 01:34最近发现新增版本:2026-11-14 15:09库内论文最新更新时间:2026-11-13 02:59

每分钟刷新已保存的数据。空检查不代表采集异常;新收录可能包含历史论文。AI 导读按新增版本计数。

23,348 已收录论文19,580 AI 相关6,729 有修订112 HF 社区发现

浏览论文库

时间范围跟随排序:版本更新、本站收录或首次发表。最新收录可能包含历史论文。部分信源异常,查看状态 →

找到 1 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-16 01:33(北京时间)
版本更新 · v3arXiv:2610.28498

Copied, Mixed or Computed? Testing Latent Intermediate Values with Minimal Pairs

Aur Shalev Merin

原文摘要

Probing studies of latent reasoning read a model's state where the answer begins, and take a successful probe as evidence that an intermediate value was computed and a failed one as evidence that it was not. With prompts that differ in one token, we show that a digit copied from the question is present there in two looped and two standard language models, while a probe that sees one prompt at a time reads it at no more than 0.52 even after 45,000 training questions. Every token we varied leaves such a trace, so a successful probe may be reading the inputs. We give a protocol that tests a candidate value against copies of the inputs, against generic mixing of them (an operation swap with a bar set on synthetic mixtures), and for use (a clamp that controls for the copy), and we check each test where the answer is known. The clamp detects values a model is about to write or reads four tokens later, an unwritten bridge entity in two-hop recall (and not where it is readable but unused), and, in small transformers trained from scratch, an unwritten value used eight tokens later. Our first operation swap failed its positive control; its variance-based replacement passed two fresh controls but, in the small transformers, fires wherever the value is present. In the looped Ouro-1.4B the protocol finds a small code of the unwritten intermediate whose sign follows the operation, but it cannot be told apart from the answer with a copied number added back, and whether the model uses it is unresolved. For a published claim that sub-answers are computed only while a chain of thought is written, weaker tests suggest an early sub-answer; in correctly answered direct answers, whole-state patches find the sub-answer not carried on its own past its equation and, with different answers, the partner's answer in 8% of pairs (below our bar), mostly from the "=" before the answer (post hoc).

cs.LG · cs.CL