REVIEW 1 cited by
Inferring Algorithmic Patterns with Stack-Augmented Recurrent Nets
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
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.
Forward citations
Cited by 1 Pith paper
-
Emergent Stack Representations in Modeling Counter Languages Using Transformers
A small transformer trained on counter languages encodes the current stack depth in its final-layer activations, recoverable by simple probing classifiers.
Discussion (0). Continue with ORCID to comment.