mlsanityData to 7 Oct 2026

Tree-Planted Transformers: Unidirectional Transformer Language Models with Implicit Syntactic Supervision

arXiv 2402.12691 ↗First posted 20 Feb 2024cs.CLcited by 4

Not on the map. Why?

Abstract (arXiv)

Syntactic Language Models (SLMs) can be trained efficiently to reach relatively high performance; however, they have trouble with inference efficiency due to the explicit generation of syntactic structures. In this paper, we propose a new method dubbed tree-planting: instead of explicitly generating syntactic structures, we "plant" trees into attention weights of unidirectional Transformer LMs to implicitly reflect syntactic structures of natural language. Specifically, unidirectional Transformer LMs trained with tree-planting will be called Tree-Planted Transformers (TPT), which inherit the training efficiency from SLMs without changing the inference efficiency of their underlying Transformer LMs. Targeted syntactic evaluations on the SyntaxGym benchmark demonstrated that TPTs, despite the lack of explicit generation of syntactic structures, significantly outperformed not only vanilla Transformer LMs but also various SLMs that generate hundreds of syntactic structures in parallel. This result suggests that TPTs can learn human-like syntactic knowledge as data-efficiently as SLMs while maintaining the modeling space of Transformer LMs unchanged.

Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 28 of its 44 references that are in the map. First posted on arXiv 20 Feb 2024.

Builds on

28 of 44 references.

References · 28

  1. 2017Attention Is All You Needcited by 59,932
  2. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
  3. 2020Language Models are Few-Shot Learnerscited by 32,199
  4. 2022Training language models to follow instructions with human feedbackcited by 15,712
  5. 2018Constituency Parsing with a Self-Attentive Encodercited by 196
  6. 2020A Systematic Assessment of Syntactic Generalization in Neural Language Modelscited by 163
  7. 2023Sudden Drops in the Loss: Syntax Acquisition, Phase Transitions, and Simplicity Bias in MLMscited by 121
  8. 2016Recurrent Neural Network Grammarscited by 109
  9. 2018Ordered Neurons: Integrating Tree Structures into Recurrent Neural Networkscited by 101
  10. 2018Linguistically-Informed Self-Attention for Semantic Role Labelingcited by 71
  11. 2019Tree Transformer: Integrating Tree Structures into Self-Attentioncited by 68
  12. 2017Neural Language Modeling by Jointly Learning Syntax and Lexiconcited by 57
16 more
  1. 2021Syntax-BERT: Improving Pre-trained Transformers with Syntax Treescited by 51
  2. 2020Do Syntax Trees Help Pre-trained Transformers Extract Information?cited by 47
  3. 2022Transformer Grammars: Augmenting Transformer Language Models with Syntactic Inductive Biases at Scalecited by 40
  4. 2023DREEAM: Guiding Attention with Evidence for Improving Document-Level Relation Extractioncited by 37
  5. 2016Criticality in Formal Languages and Statistical Physicscited by 33
  6. 2020Tree-structured Attention with Hierarchical Accumulationcited by 30
  7. 2021Structural Guidance for Transformer Language Modelscited by 25
  8. 2017Effective Inference for Generative Neural Parsingcited by 24
  9. 2019Enhancing Machine Translation with Dependency-Aware Self-Attentioncited by 24
  10. 2023How to Plant Trees in Language Models: Data and Architectural Effects on the Emergence of Syntactic Inductive Biasescited by 23
  11. 2023Pushdown Layers: Encoding Recursive Structure in Transformer Language Modelscited by 18
  12. 2016What Do Recurrent Neural Network Grammars Learn About Syntax?cited by 15
  13. 2019PaLM: A Hybrid Parser and Language Modelcited by 13
  14. 2021Effective Batching for Recurrent Neural Network Grammarscited by 12
  15. 2020Exploiting Syntactic Structure for Better Language Modeling: A Syntactic Distance Approachcited by 8
  16. 2021Improving BERT Pretraining with Syntactic Supervisioncited by 4

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 1; 2026: 3.

4 papers.