mlsanityData to 7 Oct 2026

Pushdown Layers: Encoding Recursive Structure in Transformer Language Models

arXiv 2310.19089 ↗First posted 29 Oct 2023cs.CLcited by 18

Not on the map. Why?

Abstract (arXiv)

Recursion is a prominent feature of human language, and fundamentally challenging for self-attention due to the lack of an explicit recursive-state tracking mechanism. Consequently, Transformer language models poorly capture long-tail recursive structure and exhibit sample-inefficient syntactic generalization. This work introduces Pushdown Layers, a new self-attention layer that models recursive state via a stack tape that tracks estimated depths of every token in an incremental parse of the observed prefix. Transformer LMs with Pushdown Layers are syntactic language models that autoregressively and synchronously update this stack tape as they predict new tokens, in turn using the stack tape to softly modulate attention over tokens -- for instance, learning to "skip" over closed constituents. When trained on a corpus of strings annotated with silver constituency parses, Transformers equipped with Pushdown Layers achieve dramatically better and 3-5x more sample-efficient syntactic generalization, while maintaining similar perplexities. Pushdown Layers are a drop-in replacement for standard self-attention. We illustrate this by finetuning GPT2-medium with Pushdown Layers on an automatically parsed WikiText-103, leading to improvements on several GLUE text classification tasks.

Key facts. Cited by 18 papers in the map (data through 7 Oct 2026). Builds on 32 of its 46 references that are in the map. First posted on arXiv 29 Oct 2023.

Builds on

32 of 46 references.

References · 32

  1. 2017Attention Is All You Needcited by 59,932
  2. 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,854
  3. 2016Pointer Sentinel Mixture Modelscited by 2,992
  4. 2019What Does BERT Look At? An Analysis of BERT's Attentioncited by 994
  5. 2019BLiMP: The Benchmark of Linguistic Minimal Pairs for Englishcited by 553
  6. 2019Theoretical Limitations of Self-Attention in Neural Sequence Modelscited by 286
  7. 2018Targeted Syntactic Evaluation of Language Modelscited by 239
  8. 2022Neural Networks and the Chomsky Hierarchycited by 214
  9. 2020A Systematic Assessment of Syntactic Generalization in Neural Language Modelscited by 163
  10. 2018Multilingual Constituency Parsing with Self-Attention and Pre-Trainingcited by 117
  11. 2022Overcoming a Theoretical Limitation of Self-Attentioncited by 110
  12. 2016Recurrent Neural Network Grammarscited by 109
20 more
  1. 2021Self-Attention Networks Can Process Bounded Hierarchical Languagescited by 105
  2. 2018Ordered Neurons: Integrating Tree Structures into Recurrent Neural Networkscited by 101
  3. 2015Inferring Algorithmic Patterns with Stack-Augmented Recurrent Netscited by 76
  4. 2018Linguistically-Informed Self-Attention for Semantic Role Labelingcited by 71
  5. 2014Grammar as a Foreign Languagecited by 70
  6. 2019Tree Transformer: Integrating Tree Structures into Self-Attentioncited by 68
  7. 2019Unsupervised Latent Tree Induction with Deep Inside-Outside Recursive Autoencoderscited by 60
  8. 2015Learning to Transduce with Unbounded Memorycited by 54
  9. 2019Unsupervised Recurrent Neural Network Grammarscited by 47
  10. 2022Transformer Grammars: Augmenting Transformer Language Models with Syntactic Inductive Biases at Scalecited by 40
  11. 2022Characterizing Intrinsic Compositionality in Transformers with Tree Projectionscited by 40
  12. 2016A Fast Unified Model for Parsing and Sentence Understandingcited by 34
  13. 2015Neural Random-Access Machinescited by 32
  14. 2019Memory-Augmented Recurrent Neural Networks Can Learn Generalized Dyck Languagescited by 31
  15. 2021Structural Guidance for Transformer Language Modelscited by 25
  16. 2017Effective Inference for Generative Neural Parsingcited by 24
  17. 2021Learning Hierarchical Structures with Differentiable Nondeterministic Stackscited by 16
  18. 2020Guiding Attention for Self-Supervised Learning with Transformerscited by 14
  19. 2019PaLM: A Hybrid Parser and Language Modelcited by 13
  20. 2015Dependency Recurrent Neural Language Models for Sentence Completioncited by 9

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 10; 2025: 4; 2026: 4.

18 papers.

Sort:

By area:

  1. 2024SynCode: LLM Generation with Grammar Augmentationcited by 66
  2. 2024Mission: Impossible Language Modelscited by 31
  3. 2024A Survey on Compositional Learning of AI Models: Theoretical and Experimental Practicescited by 15
  4. 2024Generative Pretrained Structured Transformers: Unsupervised Syntactic Language Models at Scalecited by 9
  5. 2024Dependency Transformer Grammars: Integrating Dependency Structures into Transformer Language Modelscited by 7
  6. 2024Tree-Planted Transformers: Unidirectional Transformer Language Models with Implicit Syntactic Supervisioncited by 4
  7. 2024Banyan: Improved Representation Learning with Explicit Structurecited by 3
  8. 2024Tree Transformers are an Ineffective Model of Syntactic Constituencycited by 3
  9. 2025CARMA: Enhanced Compositionality in LLMs via Advanced Regularisation and Mutual Information Alignmentcited by 3
  10. 2024A Transformer with Stack Attentioncited by 2
  11. 2024Inducing Systematicity in Transformers by Attending to Structurally Quantized Embeddingscited by 1
  12. 2025A Systematic Study of Compositional Syntactic Transformer Language Modelscited by 1
6 more
  1. 2025Referring Expressions as a Lens into Spatial Language Grounding in Vision-Language Modelscited by 1
  2. 2025Learning Model Successorscited by 0
  3. 2026Filling in the Mechanisms: How do LMs Learn Filler-Gap Dependencies under Developmental Constraints?cited by 0
  4. 2026GiLT: Augmenting Transformer Language Models with Dependency Graphscited by 0
  5. 2026Transcript-Managed Transformers: Monotone Multi-Agent Collapse and Universality with Two Pop-Enabled Transcriptscited by 0
  6. 2026Beyond Sequence Order: Syntax-Informed Positional Embeddings for Transformerscited by 0