aiqbench analysis
This theoretical study rigorously validates the linear representation hypothesis by demonstrating that deep transformers can encode hierarchical grammatical structures into low-dimensional subspaces. By constructing models where depth scales with grammar complexity, the authors provide formal proof for how these architectures capture compositional features across layers without relying on recursion. The findings offer critical insight into the structural capacity of attention mechanisms to represent abstract states within residual streams.
An expressivity analysis of hierarchical modelling in deep transformers via bounded-depth grammars
arXiv:2606.17522v1 Announce Type: cross Abstract: Deep neural networks are widely believed to derive their expressive power from their ability to form \textbf{hierarchical representations}, capturing progressively more abstract and compositional features across layers. In language modeling, \textbf{transformers} have emerged as the dominant architecture, with early layers capturing local syntactic patterns and later layers encoding more complex clause-level dependencies. While this intuition has shaped model design, there remains a lack of rigorous theoretical work demonstrating \textbf{how} deep transformers represent such hierarchical structures. In this work, we analyze the expressiveness of deep transformer models through the formal lens of bounded-depth, non-recursive context-free grammars. For this class of grammars, we explicitly construct transformers with positional attention whose depth grows linearly with grammar depth, while the neuron count scales with the number of derivation-tree shapes and quadratically with the number of production rules. Our theoretical results support the linear representation hypothesis by demonstrating that these architectures possess the structural capacity to encode abstract grammatical states into low-dimensional, linearly separable subspaces within the residual stream.
Abstract:Deep neural networks are widely believed to derive their expressive power from their ability to form \textbf{hierarchical representations}, capturing progressively more abstract and compositional features across layers. In language modeling, \textbf{transformers} have emerged as the dominant architecture, with early layers capturing local syntactic patterns and later layers encoding more complex clause-level dependencies. While this intuition has shaped model design, there remains a lack of rigorous theoretical work demonstrating \textbf{how} deep transformers represent such hierarchical structures. In this work, we analyze the expressiveness of deep transformer models through the formal lens of bounded-depth, non-recursive context-free grammars. For this class of grammars, we explicitly construct transformers with positional attention whose depth grows linearly with grammar depth, while the neuron count scales with the number of derivation-tree shapes and quadratically with the number of production rules. Our theoretical results support the linear representation hypothesis by demonstrating that these architectures possess the structural capacity to encode abstract grammatical states into low-dimensional, linearly separable subspaces within the residual stream.
Computation and Language (cs.CL); Machine Learning (cs.LG)
I.2.7; I.2.6; I.2.4
arXiv:2606.17522 [cs.CL]
(or arXiv:2606.17522v1 [cs.CL] for this version)
https://doi.org/10.48550/arXiv.2606.17522 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 265 words
Related coverage
An expressivity analysis of hierarchical modelling in deep transformers via bounded-depth grammars
arXiv · Jul 20, 2026

PIRAMID: Progress and Plans
LessWrong · Jul 27, 2026

Generalization and infinite width
LessWrong · Aug 1, 2026
Generalization of Transformer-Based Neural Quantum States via In-Context Learning
arXiv · Oct 5, 2026