pith. sign in

arxiv: 1503.01007 · v4 · pith:RJF54O56new · submitted 2015-03-03 · 💻 cs.NE · cs.LG

Inferring Algorithmic Patterns with Stack-Augmented Recurrent Nets

classification 💻 cs.NE cs.LG
keywords learningrecurrentlearnedlimitationssequencessomestandardachievements
0
0 comments X
read the original abstract

Despite the recent achievements in machine learning, we are still very far from achieving real artificial intelligence. In this paper, we discuss the limitations of standard deep learning approaches and show that some of these limitations can be overcome by learning how to grow the complexity of a model in a structured way. Specifically, we study the simplest sequence prediction problems that are beyond the scope of what is learnable with standard recurrent networks, algorithmically generated sequences which can only be learned by models which have the capacity to count and to memorize sequences. We show that some basic algorithms can be learned from sequential data using a recurrent network associated with a trainable memory.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.