Fetching the paper…
Reading the bibliography…
We introduce three memory-augmented Recurrent Neural Networks (MARNNs) and explore their capabilities on a series of simple language modeling tasks whose solutions require stack-based mechanisms.
Recognizing well-parenthesized expressions in the streaming model
Frédéric Magniez, Claire Mathieu, and Ashwin Nayak. 2014 · 1905
Earlier work this paper cites.
Theoretical limitations of self-attention in neural sequence models
Michael Hahn. 2019 · 1906
Earlier work this paper cites.
Sequential neural networks as automata
William Merrill. 2019 · 1906
Earlier work this paper cites.
Syntactic Structures
Noam Chomsky. 1957 · 1957
Earlier work this paper cites.
Context-Free Grammars and Pushdown Storage
Noam Chomsky. 1962 · 1962
Earlier work this paper cites.
The Algebraic Theory of Context-Free Languages
Noam Chomsky and Marcel P Schützenberger. 1963 · 1963
Earlier work this paper cites.
The hardest context-free language
Sheila A Greibach. 1973 · 1973
Earlier work this paper cites.
On deterministic context-free languages, multihead automata, and the power of an auxiliary pushdown store
Ivan Hal Sudborough. 1976 · 1976
Earlier work this paper cites.
Finding Structure in Time
Jeffrey L Elman. 1990 · 1990
Earlier work this paper cites.
Distributed Representations, Simple Recurrent Networks, and Grammatical Structure
Jeffrey L Elman. 1991 · 1991
Earlier work this paper cites.
The Induction of Dynamical Recognizers
Jordan B Pollack. 1991 · 1991
Earlier work this paper cites.
Learning Context-free Grammars: Capabilities and Limitations of a Recurrent Neural Network with an External Stack Memory
Sreerupa Das, C Lee Giles, and Guo-Zheng Sun. 1992 · 1992
Earlier work this paper cites.
Using Prior Knowledge in a NNPDA to Learn Context-Free Languages
Sreerupa Das, C Lee Giles, and Guo-Zheng Sun. 1993 · 1993
Earlier work this paper cites.
Analog Computation via Neural Networks
Hava T Siegelmann and Eduardo D Sontag. 1994 · 1994
Earlier work this paper cites.
Discrete Recurrent Neural Networks for Grammatical Inference
Zheng Zeng, Rodney M Goodman, and Padhraic Smyth. 1994 · 1994
Earlier work this paper cites.
On the Computational Power of Neural Nets
Hava T Siegelmann and Eduardo D Sontag. 1995 · 1995
Earlier work this paper cites.
A Recurrent Network that Performs a Context-Sensitive Prediction Task
Mark Steijvers. 1996 · 1996
Earlier work this paper cites.
Long Short-Term Memory
Sepp Hochreiter and Jürgen Schmidhuber. 1997 · 1997
Earlier work this paper cites.
Designing a Counter: Another Case Study of Dynamics and Activation Landscapes in Recurrent Networks
Steffen Hölldobler, Yvonne Kalinke, and Helko Lehmann. 1997 · 1997
Cited alongside, same era.
Learning a Context-Free Task with a Recurrent Neural Network: An Analysis of Stability
Bradley Tonkes and Janet Wiles. 1997 · 1997
Cited alongside, same era.
Recurrent Neural Networks can Learn to Implement Symbol-Sensitive Counting
Paul Rodriguez and Janet Wiles. 1998 · 1998
Cited alongside, same era.
Learning to Predict a Context-Free Language: Analysis of Dynamics in Recurrent Hidden Units
Mikael Bodén, Janet Wiles, Bradley Tonkes, and Alan Blair. 1999 · 1999
Cited alongside, same era.
Context-Free and Context-Sensitive Dynamics in Recurrent Neural Networks
Mikael Bodén and Janet Wiles. 2000 · 2000
Cited alongside, same era.
Karol Kurach, Marcin Andrychowicz, and Ilya Sutskever. 2015 · 2015
Later among the works it cites.
Reinforcement Learning Neural Turing Machines–Revised
Wojciech Zaremba and Ilya Sutskever. 2015 · 2015
Later among the works it cites.
Learning Operations on a Stack with Neural Turing Machines
Tristan Deleu and Joseph Dureau. 2016 · 2016
Later among the works it cites.
Hybrid Computing Using a Neural Network with Dynamic External Memory
Alex Graves, Greg Wayne, Malcolm Reynolds, Tim Harley, Ivo Danihelka, Agnieszka Grabska-Barwińska, Sergio Gómez Colmenarejo, Edward Grefenstette, Tiago Ramalho, John Agapiou, et al. 2016 · 2016
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Felix A Gers and E Schmidhuber. 2001 · 2001
Cited alongside, same era.
Learning Context Sensitive Languages with LSTM Trained with Kalman Filters
Felix A Gers, Juan Antonio Pérez-Ortiz, Douglas Eck, and Jürgen Schmidhuber. 2002 · 2002
Cited alongside, same era.
Recurrent Neural Network Based Language Model
Tomáš Mikolov, Martin Karafiát, Lukáš Burget, Jan Černockỳ, and Sanjeev Khudanpur. 2010 · 2010
Cited alongside, same era.
LSTM Neural Networks for Language Modeling
Martin Sundermeyer, Ralf Schlüter, and Hermann Ney. 2012 · 2012
Cited alongside, same era.
Speech Recognition with Deep Recurrent Neural Networks
Alex Graves, Abdel-rahman Mohamed, and Geoffrey Hinton. 2013 · 2013
Cited alongside, same era.
Recurrent Continuous Translation Models
Nal Kalchbrenner and Phil Blunsom. 2013 · 2013
Cited alongside, same era.
Neural Machine Translation by Jointly Learning to Align and Translate
Dzmitry Bahdanau, Kyunghyun Cho, and Yoshua Bengio. 2014 · 2014
Cited alongside, same era.
Eric Jang, Shixiang Gu, and Ben Poole. 2016 · 2016
Later among the works it cites.
Lie Access Neural Turing Machine
Greg Yang. 2016 · 2016
Later among the works it cites.
Learning Simple Algorithms from Examples
Wojciech Zaremba, Tomas Mikolov, Armand Joulin, and Rob Fergus. 2016 · 2016
Later among the works it cites.
Attention is all you need
Ashish Vaswani, Noam Shazeer, Niki Parmar, Jakob Uszkoreit, Llion Jones, Aidan N Gomez, Łukasz Kaiser, and Illia Polosukhin. 2017 · 2017
Later among the works it cites.
Can Recurrent Neural Networks Learn Nested Recursion?
Jean-Philippe Bernardy. 2018 · 2018
Later among the works it cites.
Dynamic Neural Turing Machine with Continuous and Discrete Addressing Schemes
Caglar Gulcehre, Sarath Chandar, Kyunghyun Cho, and Yoshua Bengio. 2018 · 2018
Later among the works it cites.
Context-Free Transductions with Neural Stacks
Yiding Hao, William Merrill, Dana Angluin, Robert Frank, Noah Amsel, Andrew Benz, and Simon Mendelsohn. 2018 · 2018
Later among the works it cites.
Evaluating the Ability of LSTMs to Learn Context-Free Grammars
Luzi Sennhauser and Robert Berwick. 2018 · 2018
Later among the works it cites.
Closing Brackets with Recurrent Neural Networks
Natalia Skachkova, Thomas Trost, and Dietrich Klakow. 2018 · 2018
Later among the works it cites.
On the practical computational power of finite precision rnns for language recognition
Gail Weiss, Yoav Goldberg, and Eran Yahav. 2018 · 2018
Later among the works it cites.
Learning the Dyck language with attention-based Seq2Seq models
Xiang Yu, Ngoc Thang Vu, and Jonas Kuhn. 2019 · 2019
Closest in time.
Learning Nonregular Languages: A Comparison of Simple Recurrent Networks and LSTM
Jürgen Schmidhuber, F Gers, and Douglas Eck. 2002 · 2041
Closest in time.
Simple Recurrent Networks Learn Context-Free and Context-Sensitive Languages by Counting
Paul Rodriguez. 2001 · 2093
Closest in time.