Learning to Execute
원문 초록
Recurrent Neural Networks (RNNs) with Long Short-Term Memory units (LSTM) are widely used because they are expressive and are easy to train. Our interest lies in empirically evaluating the expressiveness and the learnability of LSTMs in the sequence-to-sequence regime by training them to evaluate short computer programs, a domain that has traditionally been seen as too complex for neural networks. We consider a simple class of programs that can be evaluated with a single left-to-right pass using constant memory. Our main result is that LSTMs can learn to map the character-level representations of such programs to their correct outputs. Notably, it was necessary to use curriculum learning, and while conventional curriculum learning proved ineffective, we developed a new variant of curriculum learning that improved our networks' performance in all experimental conditions. The improved curriculum had a dramatic impact on an addition problem, making it possible to train an LSTM to add two 9-digit numbers with 99% accuracy.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
EchoPrompt: Instructing the Model to Rephrase Queries for Improved In-context Learning
Latent Space Representations of Neural Algorithmic Reasoners
Unveiling Transformers with LEGO: a synthetic reasoning task
The CLRS Algorithmic Reasoning Benchmark
Learning to Execute Actions or Ask Clarification Questions
Static Prediction of Runtime Errors by Learning to Execute Programs with External Resource Descriptions
토론
이 논문과 연결된 포럼 글이 아직 없습니다.