paper-with-me

홈 › Papers

The Readout Shortcut: Positional Number Copying Dominates Arithmetic CoT Readout in Small Language Models

2026-05-20 · Ming Liu arxiv

Chain-of-thought (CoT) prompting is necessary for arithmetic in small language models, yet shuffling its steps preserves most performance. What does CoT contribute if not logical sequencing? In three 1-3B instruction-tuned LMs on GSM8K, we isolate the answer-readout stage via prefix completion and identify a positional shortcut: the model copies whichever number occupies the trailing position before the answer delimiter, regardless of intermediate reasoning. Gold-answer presence accounts for 54-92 pp of accuracy (89-92% of each model's teacher-forcing ceiling); even on incorrect items, the final answer matches the last CoT number 95-96% of the time. The copy channel takes precedence over retained-context completion: replacing the trailing number with a wrong value collapses accuracy to near-zero despite correct intermediates, yet removing it recovers 5-32 pp above that floor--even single-step arithmetic the model can otherwise perform is suppressed when a copyable number is present. Qwen and Llama copy novel distractors 87-95% of the time; Gemma gates selectively. Head-level ablation implicates architecture-specific head sets; the effect replicates on GSM-Symbolic. On non-arithmetic BBH tasks, shuffle retention drops sharply; at 7-8B, content-selective gating emerges. Step-level faithfulness evaluations risk conflating positional answer transport with genuine computation--a failure mode for CoT-based oversight.

📄 PDF Abstract BibTeX arXiv:2605.22870

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Frontier Language Models Struggle to Copy: Text Can Be Better Viewed in 2D

2026-07-17 · Haodong Wen, Yiran Zhang, Yingfa Chen, Kaifeng Lyu arxiv

While large language models (LLMs) can solve advanced reasoning problems in seconds, we show that even frontier models fail to perform a much simpler operation: exactly copying an input string that lies well within their…

From Shortcut to Induction Head: How Data Diversity Shapes Algorithm Selection in Transformers

2025-12-21 · Ryotaro Kawata, Yujin Song, Alberto Bietti, Naoki Nishikawa 외 arxiv

Transformers can implement both generalizable algorithms (e.g., induction heads) and simple positional shortcuts (e.g., memorizing fixed output positions). In this work, we study how the choice of pretraining data distri…

Classical Copying versus Quantum Entanglement in Natural Language: The Case of VP-ellipsis

2018-11-08 · Gijs Wijnholds, Mehrnoosh Sadrzadeh

This paper compares classical copying and quantum entanglement in natural language by considering the case of verb phrase (VP) ellipsis. VP ellipsis is a non-linear linguistic phenomenon that requires the reuse of resour…

Observable- and Positional-Encoding-Dependent Symmetry Readout from Neural Network Weights

2026-07-03 · Naoya Chiba, Satoshi Sugiyama, Yuki Uranishi arxiv

Post-hoc analysis of trained neural network weights often seeks to recover geometric structure directly from the parameters. We show that, for positional-encoding-equipped neural fields, the symmetry visible from weights…

Position Rebinding Cache Reuse: Replay-Free Visual Revisiting for Interleaved Multimodal Reasoning

2026-06-25 · Mengzhao Wang, Yanli Ji, Wangmeng Zuo, Peng Ye 외 arxiv

Interleaved multimodal reasoning improves visual grounding by revisiting visual evidence during multi-step generation, yet existing methods typically rely on token replay, repeatedly forwarding selected visual tokens. A …

Multimodal ReasoningVisual Grounding