Causal Evidence of Stack Representations in Modeling Counter Languages Using Transformers
Not on the map. Why?
Abstract (arXiv)
Formal languages have proven to be effective conduits to understand the inner mechanisms of transformers. Past work has shown that transformers trained on next token prediction over counter languages learn representations consistent with an underlying stack structure. Beyond representational analysis, this paper investigates the causal role of these representations. Linear probes are trained to predict the stack depth at each token from the model's hidden states, and a principal representation direction is extracted from the probe. Ablation of this direction from the model causes sequential accuracy to collapse to near 0%, providing strong empirical evidence that the stack representation is not just learned, but is causally necessary for model performance.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 7 of its 8 references that are in the map. First posted on arXiv 2 Jun 2026.
Builds on
7 of 8 references.
References · 7
- 2022Locating and Editing Factual Associations in GPTcited by 2,609
- 2021Probing Classifiers: Promises, Shortcomings, and Advancescited by 831
- 2023Progress measures for grokking via mechanistic interpretabilitycited by 822
- 2019Designing and Interpreting Probes with Control Taskscited by 608
- 2019Theoretical Limitations of Self-Attention in Neural Sequence Modelscited by 286
- 2019On the Turing Completeness of Modern Neural Network Architecturescited by 129
- 2025Emergent Stack Representations in Modeling Counter Languages Using Transformerscited by 2
Built on by
Not cited yet.