Enhancing Reinforcement Learning with discrete interfaces to learn the Dyck Language
Not on the map. Why?
Abstract (arXiv)
Even though most interfaces in the real world are discrete, no efficient way exists to train neural networks to make use of them, yet. We enhance an Interaction Network (a Reinforcement Learning architecture) with discrete interfaces and train it on the generalized Dyck language. This task requires an understanding of hierarchical structures to solve, and has long proven difficult for neural networks. We provide the first solution based on learning to use discrete data structures. We encountered unexpected anomalous behavior during training, and utilized pre-training based on execution traces to overcome them. The resulting model is very small and fast, and generalizes to sequences that are an entire order of magnitude longer than the training data.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 15 of its 22 references that are in the map. First posted on arXiv 27 Oct 2021.
Builds on
15 of 22 references.
References · 15
- 2014Neural Turing Machinescited by 644
- 2017PathNet: Evolution Channels Gradient Descent in Super Neural Networkscited by 364
- 2014Memory Networkscited by 363
- 2019Theoretical Limitations of Self-Attention in Neural Sequence Modelscited by 288
- 2015Neural GPUs Learn Algorithmscited by 121
- 2015Neural Programmer-Interpreterscited by 101
- 2016Neuro-Symbolic Program Synthesiscited by 84
- 2020Learning Compositional Rules via Neural Program Synthesiscited by 74
- 2015Learning to Transduce with Unbounded Memorycited by 54
- 2015Neural Random-Access Machinescited by 34
- 2019Memory-Augmented Recurrent Neural Networks Can Learn Generalized Dyck Languagescited by 31
- 2018Evaluating the Ability of LSTMs to Learn Context-Free Grammarscited by 16
3 more
Built on by
Not cited yet.