Policy Gradient as a Proxy for Dynamic Oracles in Constituency Parsing
Not on the map. Why?
Abstract (arXiv)
Dynamic oracles provide strong supervision for training constituency parsers with exploration, but must be custom defined for a given parser's transition system. We explore using a policy gradient method as a parser-agnostic alternative. In addition to directly optimizing for a tree-level metric such as F1, policy gradient has the potential to reduce exposure bias by allowing exploration during training; moreover, it does not require a dynamic oracle for supervision. On four constituency parsers in three languages, the method substantially outperforms static oracle likelihood training in almost all settings. For parsers where a dynamic oracle is available (including a novel oracle which we define for the transition system of Dyer et al. 2016), policy gradient typically recaptures a substantial fraction of the performance gain afforded by the dynamic oracle.
Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). First posted on arXiv 8 Jun 2018.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 1; 2023: 1; 2024: 2.
5 papers.
- 2024BigCodeBench: Benchmarking Code Generation with Diverse Function Calls and Complex Instructionscited by 546
- 2022Quark: Controllable Text Generation with Reinforced Unlearningcited by 237
- 2023Grounding Language Models to Images for Multimodal Inputs and Outputscited by 131
- 2021Discontinuous Grammar as a Foreign Languagecited by 4
- 2024Improving Autoregressive Training with Dynamic Oraclescited by 0
- 2024BigCodeBench: Benchmarking Code Generation with Diverse Function Calls and Complex Instructions22 Jun 2024
- 2024Improving Autoregressive Training with Dynamic Oracles13 Jun 2024
- 2023Grounding Language Models to Images for Multimodal Inputs and Outputs31 Jan 2023
- 2022Quark: Controllable Text Generation with Reinforced Unlearning26 May 2022
- 2021Discontinuous Grammar as a Foreign Language20 Oct 2021