Structural Optimization Ambiguity and Simplicity Bias in Unsupervised Neural Grammar Induction
Not on the map. Why?
Abstract (arXiv)
Neural parameterization has significantly advanced unsupervised grammar induction. However, training these models with a traditional likelihood loss for all possible parses exacerbates two issues: 1) textitstructural optimization ambiguity that arbitrarily selects one among structurally ambiguous optimal grammars despite the specific preference of gold parses, and 2) textitstructural simplicity bias that leads a model to underutilize rules to compose parse trees. These challenges subject unsupervised neural grammar induction (UNGI) to inevitable prediction errors, high variance, and the necessity for extensive grammars to achieve accurate predictions. This paper tackles these issues, offering a comprehensive analysis of their origins. As a solution, we introduce textitsentence-wise parse-focusing to reduce the parse pool per sentence for loss evaluation, using the structural bias from pre-trained parsers on the same dataset. In unsupervised parsing benchmark tests, our method significantly improves performance while effectively reducing variance and bias toward overly simplistic parses. Our research promotes learning more compact, accurate, and consistent explicit grammars, facilitating better interpretability.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 13 of its 32 references that are in the map. First posted on arXiv 23 Jul 2024.
Builds on
13 of 32 references.
References · 13
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
- 2017A Broad-Coverage Challenge Corpus for Sentence Understanding through Inferencecited by 2,665
- 2016Recurrent Neural Network Grammarscited by 109
- 2018Ordered Neurons: Integrating Tree Structures into Recurrent Neural Networkscited by 101
- 2019Tree Transformer: Integrating Tree Structures into Self-Attentioncited by 68
- 2019Unsupervised Latent Tree Induction with Deep Inside-Outside Recursive Autoencoderscited by 60
- 2017Neural Language Modeling by Jointly Learning Syntax and Lexiconcited by 57
- 2019Unsupervised Recurrent Neural Network Grammarscited by 47
- 2020StructFormer: Joint Unsupervised Induction of Dependency and Constituency Structure from Masked Language Modelingcited by 33
- 2021PCFGs Can Do Better: Inducing Probabilistic Context-Free Grammars with Many Symbolscited by 22
- 2021Neural Bi-Lexicalized PCFG Inductioncited by 18
- 2022Dynamic Programming in Rank Space: Scaling Structured Inference with Low-Rank HMMs and PCFGscited by 10
1 more
Built on by
Citing papers per year: 2025: 1.
1 paper.