Augmenting Transformers with Recursively Composed Multi-grained Representations
Not on the map. Why?
Abstract (arXiv)
We present ReCAT, a recursive composition augmented Transformer that is able to explicitly model hierarchical syntactic structures of raw texts without relying on gold trees during both learning and inference. Existing research along this line restricts data to follow a hierarchical tree structure and thus lacks inter-span communications. To overcome the problem, we propose a novel contextual inside-outside (CIO) layer that learns contextualized representations of spans through bottom-up and top-down passes, where a bottom-up pass forms representations of high-level spans by composing low-level spans, while a top-down pass combines information inside and outside a span. By stacking several CIO layers between the embedding layer and the attention layers in Transformer, the ReCAT model can perform both deep intra-span and deep inter-span interactions, and thus generate multi-grained representations fully contextualized with other spans. Moreover, the CIO layers can be jointly pre-trained with Transformers, making ReCAT enjoy scaling ability, strong performance, and interpretability at the same time. We conduct experiments on various sentence-level and span-level tasks. Evaluation results indicate that ReCAT can significantly outperform vanilla Transformer models on all span-level tasks and baselines that combine recursive networks with Transformers on natural language inference tasks. More interestingly, the hierarchical structures induced by ReCAT exhibit strong consistency with human-annotated syntactic trees, indicating good interpretability brought by the CIO layers.
Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 29 of its 40 references that are in the map. First posted on arXiv 28 Sep 2023.
Builds on
29 of 40 references.
References · 29
- 2017Attention Is All You Needcited by 59,932
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
- 2020Language Models are Few-Shot Learnerscited by 32,199
- 2023GPT-4 Technical Reportcited by 18,132
- 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,854
- 2016Pointer Sentinel Mixture Modelscited by 2,992
- 2019SpanBERT: Improving Pre-training by Representing and Predicting Spanscited by 832
- 2016Recurrent Neural Network Grammarscited by 109
- 2016Neural Symbolic Machines: Learning Semantic Parsers on Freebase with Weak Supervisioncited by 101
- 2018Ordered Neurons: Integrating Tree Structures into Recurrent Neural Networkscited by 101
- 2019Compound Probabilistic Context-Free Grammars for Grammar Inductioncited by 76
- 2019Unsupervised Latent Tree Induction with Deep Inside-Outside Recursive Autoencoderscited by 60
17 more
- 2020Fast and Accurate Neural CRF Constituency Parsingcited by 50
- 2017Learning to Compose Task-Specific Tree Structurescited by 48
- 2019Unsupervised Recurrent Neural Network Grammarscited by 47
- 2022Transformer Grammars: Augmenting Transformer Language Models with Syntactic Inductive Biases at Scalecited by 40
- 2020StructFormer: Joint Unsupervised Induction of Dependency and Constituency Structure from Masked Language Modelingcited by 33
- 2016Learning to Compose Words into Sentences with Reinforcement Learningcited by 30
- 2017Jointly Learning Sentence Embeddings and Syntax with Unsupervised Tree-LSTMscited by 23
- 2020A Cross-Task Analysis of Text Span Representationscited by 21
- 2019Ordered Memorycited by 20
- 2021R2D2: Recursive Transformer based on Differentiable Tree for Interpretable Hierarchical Language Modelingcited by 19
- 2021Neural Bi-Lexicalized PCFG Inductioncited by 18
- 2021Modeling Hierarchical Structures with Continuous Recursive Neural Networkscited by 15
- 2022Fast-R2D2: A Pretrained Recursive Neural Network based on Pruned CKY for Grammar Induction and Text Representationcited by 14
- 2022Dynamic Programming in Rank Space: Scaling Structured Inference with Low-Rank HMMs and PCFGscited by 10
- 2023Beam Tree Recursive Cellscited by 6
- 2023A Multi-Grained Self-Interpretable Symbolic-Neural Model For Single/Multi-Labeled Text Classificationcited by 4
- 2023Efficient Beam Tree Recursioncited by 4
Built on by
Citing papers per year: 2024: 4; 2025: 0; 2026: 1.
5 papers.
- 2024Generative Pretrained Structured Transformers: Unsupervised Syntactic Language Models at Scalecited by 9
- 2026SpiralFormer: Looped Transformers Can Learn Hierarchical Dependencies via Multi-Resolution Recursioncited by 9
- 2024Efficient Length-Generalizable Attention via Causal Retrieval for Long-Context Language Modelingcited by 8
- 2024Unsupervised Morphological Tree Tokenizercited by 0
- 2024On Eliciting Syntax from Language Models via Hashingcited by 0
- 2026SpiralFormer: Looped Transformers Can Learn Hierarchical Dependencies via Multi-Resolution Recursion12 Feb 2026
- 2024On Eliciting Syntax from Language Models via Hashing5 Oct 2024
- 2024Efficient Length-Generalizable Attention via Causal Retrieval for Long-Context Language Modeling2 Oct 2024
- 2024Unsupervised Morphological Tree Tokenizer21 Jun 2024
- 2024Generative Pretrained Structured Transformers: Unsupervised Syntactic Language Models at Scale13 Mar 2024