Fetching the paper…
Reading the bibliography…
In order to learn complex grammars, recurrent neural networks (RNNs) require sufficient computational resources to ensure correct grammar recognition.
Syntactic Pattern Recognition, Applications
King Sun Fu, editor · 1977
Earlier work this paper cites.
Inductive inference: Theory and methods
Dana Angluin and Carl H Smith · 1983
Earlier work this paper cites.
A learning algorithm for continually running fully recurrent neural networks
R. J. Williams and D. Zipser · 1989
Earlier work this paper cites.
Recursive distributed representations
Jordan B Pollack · 1990
Earlier work this paper cites.
Learning from hints in neural networks
Y. S. Abu-Mostafa · 1990
Earlier work this paper cites.
Learning and extracting finite state automata with second-order recurrent neural networks
C Lee Giles, Clifford B Miller, Dong Chen, Hsing-Hen Chen, Guo-Zheng Sun, and Yee-Chun Lee · 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
Earlier work this paper cites.
Learning and development in neural networks: The importance of starting small
Jeffrey L Elman · 1993
Earlier work this paper cites.
Discrete recurrent neural networks for grammatical inference
Zheng Zeng, Rodney M Goodman, and Padhraic Smyth · 1994
Earlier work this paper cites.
Learning to count without a counter: A case study of dynamics and activation landscapes in recurrent networks
Janet Wiles and Jeff Elman · 1995
Earlier work this paper cites.
Gradient-based learning algorithms for recurrent networks and their computational complexity
Ronald J Williams and David Zipser · 1995
Earlier work this paper cites.
Constructing deterministic finite-state automata in recurrent neural networks
Christian W Omlin and C Lee Giles · 1996
Earlier work this paper cites.
Long short-term memory
Sepp Hochreiter and Jürgen Schmidhuber · 1997
Earlier work this paper cites.
Finite state machines and recurrent neural networks—automata and dynamical systems approaches
Peter Tiňo, Bill G Horne, C Lee Giles, and Pete C Collingwood · 1998
Cited alongside, same era.
The neural network pushdown automaton: Architecture, dynamics and training
G. Z. Sun, C. L. Giles, and H. H. Chen · 1998
Cited alongside, same era.
Context-free and context-sensitive dynamics in recurrent neural networks
Mikael Bodén and Janet Wiles · 2000
Cited alongside, same era.
Fractal encoding of context-free grammars in connectionist networks
Whitney Tabor · 2000
Cited alongside, same era.
Lstm recurrent networks learn simple context-free and context-sensitive languages
F. A. Gers and E. Schmidhuber · 2001
Cited alongside, same era.
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
John E. Hopcroft, Rajeev Motwani, and Jeffrey D. Ullman · 2006
Deep Learning
Ian Goodfellow, Yoshua Bengio, and Aaron Courville · 2016
Later among the works it cites.
Zoneout: Regularizing rnns by randomly preserving hidden activations
David Krueger, Tegan Maharaj, János Kramár, Mohammad Pezeshki, Nicolas Ballas, Nan Rosemary Ke, Anirudh Goyal, Yoshua Bengio, Aaron Courville, and Chris Pal · 2016
Later among the works it cites.
Unbiased online recurrent optimization
Corentin Tallec and Yann Ollivier · 2017
Later among the works it cites.
Evaluating the ability of lstms to learn context-free grammars
Luzi Sennhauser and Robert C Berwick · 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
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Alex Graves, Greg Wayne, and Ivo Danihelka · 2014
Cited alongside, same era.
Empirical evaluation of gated recurrent neural networks on sequence modeling
Junyoung Chung, Caglar Gulcehre, KyungHyun Cho, and Yoshua Bengio · 2014
Cited alongside, same era.
Inferring algorithmic patterns with stack-augmented recurrent nets
Armand Joulin and Tomas Mikolov · 2015
Cited alongside, same era.
Learning to transduce with unbounded memory
Edward Grefenstette, Karl Moritz Hermann, Mustafa Suleyman, and Phil Blunsom · 2015
Cited alongside, same era.
Karol Kurach, Marcin Andrychowicz, and Ilya Sutskever · 2015
Cited alongside, same era.
Training recurrent networks online without backtracking
Yann Ollivier, Corentin Tallec, and Guillaume Charpiat · 2015
Cited alongside, same era.
Later among the works it cites.
Memory architectures in recurrent neural network language models
Dani Yogatama, Yishu Miao, Gabor Melis, Wang Ling, Adhiguna Kuncoro, Chris Dyer, and Phil Blunsom · 2018
Later among the works it cites.
Number sequence prediction problems for evaluating computational powers of neural networks
Hyoungwook Nam, Segwang Kim, and Kyomin Jung · 2019
Closest in time.
Learning by abstraction: The neural state machine
Drew A. Hudson and Christopher D. Manning · 2019
Closest in time.
On the computational power of rnns
Samuel A. Korsky and Robert C. Berwick · 2019
Closest in time.
Learned neural iterative decoding for lossy image compression systems
Alexander G Ororbia, Ankur Mali, Jian Wu, Scott O’Connell, William Dreese, David Miller, and C Lee Giles · 2019
Closest in time.
Lifelong neural predictive coding: Sparsity yields less forgetting when learning cumulatively
Alexander Ororbia, Ankur Mali, Daniel Kifer, and C Lee Giles · 2019
Closest in time.
Biologically motivated algorithms for propagating local target representations
Alexander G Ororbia and Ankur Mali · 2019
Closest in time.
LSTM networks can perform dynamic counting
Mirac Suzgun, Sebastian Gehrmann, Yonatan Belinkov, and Stuart M. Shieber · 2019
Closest in time.