REVIEW 5 major objections 4 minor 13 references
Transformers separate right from wrong by rotating answers in representation space, not by scaling them
Reviewed by Pith at T0; open to challenge. T0 means a machine referee read the full paper against a public rubric. the ladder, T0–T4 →
T0 review · deepseek-v4-flash
2026-08-02 20:57 UTC pith:I7EP7MZ3
load-bearing objection Novel trajectory measurement undermined by missing control and abstract-body mismatch—worth a referee's time, not acceptance as-is. the 5 major comments →
How Transformers Reject Wrong Answers: Rotational Dynamics of Factual Constraint Processing
The pith
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
The paper's core discovery is that factual constraint processing in decoder-only transformers is geometric and rotational: when a model is forced to process a correct versus an incorrect single-token continuation of the same query, the displacement from the query-only representation has nearly identical length for both continuations (norm ratio within 3% of 1) while their angular separation grows through mid-depth (cosine similarity drops to roughly 0.65–0.69 in the larger models), then partially reconverges. Superimposed on this, the logit-lens commitment to the correct token collapses in the incorrect run to about 0.08 in the 7B and 13B models, meaning the unembedding readout assigns about
What carries the argument
The central machinery is the displacement field (Definition 1) and the derived measures of rotational divergence—cosine separation of displacement vectors with a norm ratio near unity—and the commitment ratio (Definition 3), which applies the final layer norm and unembedding to each intermediate hidden state to read out the model's intermediate preference between the correct and incorrect token. These two devices let the author separate angular from radial divergence and quantify 'active suppression' as κ < 0.5. The paper also uses linear probes and an attention allocation ratio as supporting measurements.
Load-bearing premise
The load-bearing premise is that the normalized logit-lens readout restricted to the two forced tokens faithfully reflects the model's internal preference, so that a commitment ratio below 0.5 demonstrates 'active suppression' rather than the model simply reading the token it was forced to carry; the paper explicitly concedes that only a random-token control can settle this.
What would settle it
Force a random unrelated token, such as 'apple', as a third continuation of the same factual queries and measure the commitment ratio between the correct token and the random token across layers; if κ also collapses below 0.5, the suppression reading is an artifact of the unembedding reading out the forced token, and the active-suppression claim collapses.
If this is right
- Hallucination detectors that compare embedding norms or magnitudes will miss the signal; the discriminative information lies in angular position, so cosine-based or projection-based methods are the ones with a geometric basis.
- The commitment collapse offers a potential label-free internal flag because it appears before the final layer and does not require knowing the true answer if contrastive continuations are constructed, though the paper does not bridge to open-ended autoregressive generation.
- The scale threshold implies that models below roughly 1.6B parameters lack the internal circuitry for this kind of conflict resolution, so mitigation strategies that work at larger scales may have nothing to engage with at smaller scales.
- The positive correlation between linear separability and commitment gap in larger models suggests that representation and generation become coupled with scale, making intermediate layers the place to look for factual commitments.
Where Pith is reading between the lines
- A direct test of whether rotational divergence is specific to factual constraints or a general binary-distinction mechanism would run the same protocol on non-factual contrasts (e.g., syntactic or stylistic continuations); if the same isometric divergence appears, the finding is about transformer computation generally, not hallucination specifically.
- The paper's own caveat implies a decisive control: adding a random-token condition would separate 'active suppression' from 'conformity to the forced token'; the authors did not run it, so the suppression claim should be treated as provisional.
- The claimed 1.5B/1.6B threshold could be tested within a single model family by evaluating the same queries at several nearby scales, which would distinguish a sharp phase transition from a gradual improvement artifact.
- If angular divergence is the real substrate, then activation patching or steering should aim to rotate representations along the correct-answer direction rather than rescale them; that is a testable prediction for intervention methods.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper introduces 'forced-completion probing,' a method for tracking five geometric quantities across transformer layers when a model processes correct versus incorrect single-token continuations of factual queries. The central empirical claims are: (1) correct and incorrect answer paths separate primarily by rotation rather than by scaling, with near-constant displacement norms and falling cosine similarity; (2) in models above roughly 1.6B parameters, the incorrect path drives a two-token logit-lens commitment ratio far below 0.5, interpreted as 'active suppression' of the correct token; and (3) this behavior is absent in the smallest tested model, suggesting a scale threshold. The paper reports results for four models (LLaMA-2 13B, Mistral 7B, StableLM-2 1.6B, Qwen2 1.5B) across 300 queries in three domains, with additional linear-probe and attention-allocation analyses.
Significance. If the rotational-divergence result holds, it would be a useful, non-obvious observation about how transformer hidden states encode factual correctness, with potential implications for hallucination detection and interpretability. The paper also demonstrates good methodological instincts: it includes control query categories, Mann-Whitney tests with FDR correction, token-span matching for multi-token keywords, and it explicitly acknowledges several limitations and a missing control. However, the significance is currently undercut by major inconsistencies between the abstract and the body (model counts, activation-patching experiments, scale-threshold claims) and by the lack of a random-token control that the authors themselves identify as necessary to interpret the 'active suppression' result. The geometric results are interesting but the headline mechanistic claim is not yet supported.
major comments (5)
- [Abstract vs. §4.2, Table 1, Conclusion] The abstract claims 'six decoder-only transformers spanning four architecture families' plus a seventh flat model, and the final sentence of §8 claims 'seven models.' The body evaluates only four models (LLaMA-2 13B, Mistral 7B, StableLM-2 1.6B, Qwen2 1.5B); no Gemma or other Llama/Mistral variants appear. This directly undermines the 'holds across six models/four families' and 'phase transition' statements. Either add the missing models or restrict all claims to the four evaluated.
- [§5.2, Definition 3–4] The central 'active suppression' claim is not identifiable without a random-token control, as the abstract itself concedes. κ(ℓ) is a two-token softmax over exactly t+ and t−; when the forced token t− is processed, the residual stream at the last position contains the embedding/context of that token, so κ_min=0.08 may simply reflect the unembedding reading out the forced token, not active suppression. The paper presents no control where an unrelated random token is appended and κ is computed. Without it, Definition 4's interpretation collapses to forced-token conformity.
- [Abstract vs. body] The abstract promises activation-patching results: 'Where single-layer activation patching is cleanly interpretable (LLaMA-2 13B, Mistral 7B) it yields no layer band of consistent recovery; a third model ... we diagnose as a code-path artefact and exclude.' No section in the body reports any activation-patching experiment. This is a missing empirical result that is load-bearing for the 'distributed-by-trajectory' conclusion. Either add the experiment or remove the claim from the abstract.
- [Table 3] The t-statistics in Table 3 are computed at the layer ℓ*/L where κ_min occurs, after scanning all layers. This post-selection inference is not corrected for multiple comparisons, so reported p<10^-100 is inflated. Pairwise comparisons in §4.5 use FDR across layers, but the one-sample t-tests do not. Report the full κ profile and apply FDR or a hold-out layer selection procedure before claiming significance.
- [§1, §5.4, §7.5, Abstract] The scale-threshold claim is stated inconsistently. The abstract and §1 say 'phase transition' and 'emerge at 1.6B'; §5.4 and Limitation 5 say 'cannot be determined from four models alone' and 'could reflect architectural differences rather than scale alone.' The abstract also calls Qwen2 1.5B flat 'plausibly a tokenizer artefact' while §5.4 says it is 'evidence of a genuine absence.' These contradictions must be resolved and the claims carefully hedged.
minor comments (4)
- [Table 2] Norm ratios η are reported as point means without variance or confidence intervals. Given the claim of isometric divergence, report SEM or a distribution; otherwise the near-unity values cannot be assessed.
- [§5.4] The phrase 'Qwen2 achieves only 0.50 at its single valid layer' is unexplained. Which layer is 'valid' and why are other layers invalid? Clarify.
- [References] The StableLM-2 technical report reference has a malformed author list: 'Reshinth Adithyan Sauer, et al.' Should be corrected.
- [Abstract] The sentence 'It holds across six decoder-only transformers ... a seventh (Qwen2 1.5B) is flat' is ambiguous: is Qwen2 one of the six or an additional seventh model? Clarify the count.
Circularity Check
Active-suppression finding is Definition 4 restated: κ<0.5 is labeled 'active suppression,' then the observed κmin=0.08 is reported as independent evidence, despite the abstract conceding the forced-token conformity alternative and omitting the random-token control.
specific steps
-
self definitional
[Definition 4 (Section 3, M4); Section 5.2; Section 8 Conclusions]
"Definition 4 (Active suppression). A model shows active suppression at layer ℓ if, when processing the incorrect answer, κ(ℓ) < 0.5 − ϵ ... This means the intermediate representation actively favors the incorrect token over the correct one—the model is not only uncertain but is driving probability away from the right answer. ... Section 5.2: κ does not only stagnate—it collapses below 0.5, reaching κmin = 0.08 ... meaning the model actively drives probability away from the correct token."
Def. 4 makes 'active suppression' the name for κ<0.5 in the incorrect run. Section 5.2 treats κmin=0.08 as showing the model 'actively drives probability away from the correct token,' and the conclusion repeats it. That is the defining condition restated as a discovery, not a tested mechanism. Additionally, κ is a two-token softmax over exactly t+ and t− taken after t− has been appended; the residual stream carries the forced token, so low κ can be the forced token's own readout. The abstract concedes this ('could equally reflect the model conforming to the token it is forced to carry, which only a random-token control can settle'), and no such control is supplied. The suppression result is thus equivalent to Definition 4's criterion, not independent evidence.
full rationale
The rotational-divergence measurements (M1–M3) are self-contained: η≈1 and ρ are computed from matched correct/incorrect/query runs and checked against neutral and control categories, so those findings are not circular. No self-citation chain or imported uniqueness theorem is used; all references are external. The one load-bearing circularity is the active-suppression claim: Definition 4 stipulates that κ<0.5 during the incorrect run counts as 'active suppression,' and then Sections 5.2 and 8 report the measured κmin=0.08 as evidence for the mechanism. Since κ is a two-token ratio over exactly the correct and incorrect tokens after the incorrect token has been appended, the sub-0.5 value is plausibly the forced-token input being read out through the unembedding; the abstract itself flags this and calls for a random-token control that is never run. This makes the suppression result constructed by definition (partial circularity), though the paper's caveat and its independent geometric findings prevent it from being wholly circular; score 6.
Axiom & Free-Parameter Ledger
axioms (5)
- domain assumption Normalized logit lens (final RMSNorm/LayerNorm + lm_head applied to intermediate hidden states) faithfully estimates the model's per-token preference.
- domain assumption The hidden state at the last token position is the correct locus for studying answer processing at every layer.
- domain assumption Neutral query controls are sufficient to distinguish factual processing from forced-completion artifacts, and no random-token control is needed.
- domain assumption The absence of the phenomena in Qwen2 1.5B can be attributed to parameter scale rather than tokenizer or architecture differences.
- domain assumption Attention weights from the last token to manually annotated keyword spans are a valid mechanistic correlate of factual engagement.
Cite this review
Pith. "Pith review of How Transformers Reject Wrong Answers: Rotational Dynamics of Factual Constraint Processing." pith.science (2026). https://pith.science/paper/I7EP7MZ3
@misc{pith2026260313259,
author = {Pith},
title = {Pith review of: How Transformers Reject Wrong Answers: Rotational Dynamics of Factual Constraint Processing},
year = {2026},
howpublished = {\url{https://pith.science/paper/I7EP7MZ3}},
note = {Machine review of arXiv:2603.13259}
}
read the original abstract
When a decoder-only transformer is forced to process matched correct and incorrect single-token continuations of a factual query, the two pathways through hidden-state space diverge: displacement vectors from the query-only representation keep near-equal magnitude but rotate apart, with angular separation growing through mid-depth before late layers resolve an asymmetric outcome. A logit-lens preference in the incorrect run falls far below the equal-probability prior (roughly 11.5x more mass on the incorrect token than the correct one). We read this pattern, rotational divergence then late-layer asymmetric commitment, as the geometric signature of the model externally appearing to reject a wrong continuation, while staying explicit that it is observational, not causal: the incorrect run could equally reflect the model conforming to the token it is forced to carry, which only a random-token control can settle. It holds across six decoder-only transformers spanning four architecture families (Llama, Mistral, Gemma, StableLM) from 1B to 13B parameters; a seventh (Qwen2 1.5B) is flat under our protocol, plausibly a tokenizer artefact, leaving an emergence threshold open. Linear probes recover the distinction at intermediate depth, and cross-domain transfer is structurally asymmetric, a financial-medical corridor transferring far better than transport pairs. Where single-layer activation patching is cleanly interpretable (LLaMA-2 13B, Mistral 7B) it yields no layer band of consistent recovery; a third model (StableLM-2 1.6B) recovers uniformly above the ceiling, which we diagnose as a code-path artefact and exclude. Under this scoped null the late-layer asymmetry is not localized to a single component, fitting a distributed-by-trajectory account rather than single-layer localized recall. We document this with forced-completion probing across seven models, three domains, and 300 queries.
Figures
Reference graph
Works this paper leans on
-
[2]
Alexander Yom Din, Noga Tamir, Idan Szpektor, and Yoav Goldberg. Jump to conclusions: Short- cutting transformers with linear transformations.arXiv preprint arXiv:2303.09435,
-
[5]
Dissecting recall of factual as- sociations in auto-regressive language models
Mor Geva, Jasmijn Bastings, Katja Filippova, and Amir Globerson. Dissecting recall of factual as- sociations in auto-regressive language models. InProceedings of the 2023 Conference on Empirical Methods in Natural Language Processing,
2023
-
[7]
Lei Huang, Weijiang Yu, Weitao Ma, Weihong Zhong, Zhangyin Feng, Haotian Wang, Qianglong Chen, Weihua Peng, Xiaocheng Feng, Bing Qin, et al. A survey on hallucination in large language models: Principles, taxonomy, challenges, and open questions.arXiv preprint arXiv:2311.05232,
-
[8]
Mistral 7B.arXiv preprint arXiv:2310.06825,
Albert Q Jiang, Alexandre Sablayrolles, Arthur Mensch, Chris Bamford, Devendra Singh Chaplot, Diego de las Casas, Florian Bressand, Gianna Lengyel, Guillaume Lample, Lucile Saulnier, et al. Mistral 7B.arXiv preprint arXiv:2310.06825,
-
[9]
Samuel Marks and Max Tegmark. The geometry of truth: Emergent linear structure in large language model representations of true/false datasets.arXiv preprint arXiv:2310.06824,
-
[10]
LLaMA: Open and efficient foundation language models.arXiv preprint arXiv:2302.13971,
14 Hugo Touvron, Thibaut Lavril, Gautier Izacard, Xavier Martinet, Marie-Anne Lachaux, Timothée Lacroix, Baptiste Rozière, Naman Goyal, Eric Hambro, Faisal Azhar, et al. LLaMA: Open and efficient foundation language models.arXiv preprint arXiv:2302.13971,
-
[13]
Representation engineering: A top-down approach to AI transparency.arXiv preprint arXiv:2310.01405,
Andy Zou, Long Phan, Sarah Chen, James Campbell, Phillip Guo, Richard Ren, Alexander Pan, Xuwang Yin, Mantas Mazeika, Ann-Kathrin Dombrowski, et al. Representation engineering: A top-down approach to AI transparency.arXiv preprint arXiv:2310.01405,
-
[2019]
Transformer feed-forward layers are key-value memories
Mor Geva, Roei Schuster, Jonathan Berant, and Omer Levy. Transformer feed-forward layers are key-value memories. InProceedings of the 2021 Conference on Empirical Methods in Natural Language Processing,
2021
-
[2020]
Qwen2 technical report.arXiv preprint arXiv:2407.10671,
An Yang, Baosong Yang, Binyuan Hui, Bo Zheng, Bowen Yu, Chang Zhou, et al. Qwen2 technical report.arXiv preprint arXiv:2407.10671,
-
[2021]
How contextual are contextualized word representations? comparing the ge- ometry of BERT, ELMo, and GPT-2 representations
Kawin Ethayarajh. How contextual are contextualized word representations? comparing the ge- ometry of BERT, ELMo, and GPT-2 representations. InProceedings of the 2019 Conference on Empirical Methods in Natural Language Processing,
2019
-
[2022]
Transformers: State-of-the-art natural language processing
Thomas Wolf, Lysandre Debut, Victor Sanh, Julien Chaumond, Clement Delangue, Anthony Moi, Pierric Cistac, Tim Rault, Remi Louf, Morgan Funtowicz, et al. Transformers: State-of-the-art natural language processing. InProceedings of the 2020 Conference on Empirical Methods in Natural Language Processing: System Demonstrations, pages 38–45,
2020
-
[2023]
Stable LM 2 1.6B technical report.arXiv preprint arXiv:2402.17834,
Marco Bellagente, Jonathan Tow, Dakota Mahan, Duy Phung, Maksym Zhuravinskyi, Reshinth Adithyan Sauer, et al. Stable LM 2 1.6B technical report.arXiv preprint arXiv:2402.17834,
-
[2024]
Designing and interpreting probes with control tasks
John Hewitt and Percy Liang. Designing and interpreting probes with control tasks. InProceedings of the 2019 Conference on Empirical Methods in Natural Language Processing,
2019
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.