Modeling Hierarchical Structures with Continuous Recursive Neural Networks
Jishnu Ray Chowdhury, Cornelia Caragea
Abstract
Recursive Neural Networks (RvNNs), which compose sequences according to their underlying hierarchical syntactic structure, have performed well in several natural language processing tasks compared to similar models without structural biases. However, traditional RvNNs are incapable of inducing the latent structure in a plain text sequence on their own. Several extensions have been proposed to overcome this limitation. Nevertheless, these extensions tend to rely on surrogate gradients or reinforcement learning at the cost of higher bias or variance. In this work, we propose Continuous Recursive Neural Network (CRvNN) as a backpropagation-friendly alternative to address the aforementioned limitations. This is done by incorporating a continuous relaxation to the induced structure. We demonstrate that CRvNN achieves strong performance in challenging synthetic tasks such as logical inference (Bowman et al., 2015b) and ListOps (Nangia & Bowman, 2018). We also show that CRvNN performs comparably or better than prior latent structure models on real-world tasks such as sentiment analysis and natural language inference. 1
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Cited by top-tier papers8
- The Neural Data Router: Adaptive Control Flow in Transformers Improves Systematic GeneralizationRóbert Csordás, Kazuki Irie, Jürgen SchmidhuberICLR 2022 · 70 citations
- Beam Tree Recursive CellsJishnu Ray Chowdhury, Cornelia CarageaICML 2023 · 7 citations
- Fast-R2D2: A Pretrained Recursive Neural Network based on Pruned CKY for Grammar Induction and Text RepresentationXiang Hu, Haitao Mi, Liang Li, Gerard de MeloEMNLP 2022 · 7 citations
- Recursion in Recursion: Two-Level Nested Recursion for Length Generalization with ScalabilityJishnu Ray Chowdhury, Cornelia CarageaNeurIPS 2023 · 7 citations
- Augmenting Transformers with Recursively Composed Multi-grained RepresentationsXiang Hu, Qingyang Zhu, Kewei Tu, Wei WuICLR 2024 · 6 citations
Builds on6
- On the Variance of the Adaptive Learning Rate and BeyondLiyuan Liu, Haoming Jiang, Pengcheng He, Weizhu Chen et al.ICLR 2020 · 2,210 citations
- Tree-Structured Attention with Hierarchical AccumulationXuan-Phi Nguyen, Shafiq R. Joty, Steven C. H. Hoi, Richard SocherICLR 2020 · 79 citations
- Compositional Generalization by Learning Analytical ExpressionsQian Liu, Shengnan An, Jian-Guang Lou, Bei Chen et al.NeurIPS 2020 · 79 citations
- Retrofitting Structure-aware Transformer Language Model for End TasksHao Fei, Yafeng Ren, Donghong JiEMNLP 2020 · 56 citations
- Unsupervised Parsing with S-DIORA: Single Tree Encoding for Deep Inside-Outside Recursive AutoencodersAndrew Drozdov, Subendhu Rongali, Yi-Pei Chen, Tim O'Gorman et al.EMNLP 2020 · 27 citations
Related papers
- Self-Instantiated Recurrent Units with Dynamic Soft RecursionAston Zhang, Yi Tay, Yikang Shen, Alvin Chan et al.NeurIPS 2021 · 4 citations
- Structured Attention for Unsupervised Dialogue Structure InductionLiang Qiu, Yizhou Zhao, Weiyan Shi, Yuan Liang et al.EMNLP 2020 · 29 citations
- Recursive Bayesian Networks: Generalising and Unifying Probabilistic Context-Free Grammars and Dynamic Bayesian NetworksRobert Lieck, Martin RohrmeierNeurIPS 2021 · 5 citations
- Efficient Beam Tree RecursionJishnu Ray Chowdhury, Cornelia CarageaNeurIPS 2023 · 4 citations
- Separating the 'what' and 'how' of compositional computation to enable reuse and continual learningHaozhe Shan, Minni Sun, Lea DunckerNeurIPS 2025 · 10 citations
