Dynamic Compositional Neural Networks over Tree Structure
Not on the map. Why?
Abstract (arXiv)
Tree-structured neural networks have proven to be effective in learning semantic representations by exploiting syntactic information. In spite of their success, most existing models suffer from the underfitting problem: they recursively use the same shared compositional function throughout the whole compositional process and lack expressive power due to inability to capture the richness of compositionality. In this paper, we address this issue by introducing the dynamic compositional neural networks over tree structure (DC-TreeNN), in which the compositional function is dynamically generated by a meta network. The role of meta-network is to capture the metaknowledge across the different compositional rules and formulate them. Experimental results on two typical tasks show the effectiveness of the proposed models.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). First posted on arXiv 11 May 2017.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 1; 2023: 1; 2024: 0; 2025: 0; 2026: 1.
3 papers.
- 2022Integrating Dependency Tree Into Self-attention for Sentence Representationcited by 0
- 2023Interpreting Sentiment Composition with Latent Semantic Treecited by 0
- 2026Know Yourself and Know Your Neighbour: A Syntactically Informed Self-Supervised Compositional Sentence Representation Learning Framework using a Recursive Hypernetworkcited by 0
- 2026Know Yourself and Know Your Neighbour: A Syntactically Informed Self-Supervised Compositional Sentence Representation Learning Framework using a Recursive Hypernetwork12 Oct 2026
- 2023Interpreting Sentiment Composition with Latent Semantic Tree31 Aug 2023
- 2022Integrating Dependency Tree Into Self-attention for Sentence Representation11 Mar 2022