pith. machine review for the scientific record. sign in

arxiv: 1803.08165 · v1 · submitted 2018-03-21 · 💻 cs.NE · cs.LG

Recognition: unknown

Comparing Fixed and Adaptive Computation Time for Recurrent Neural Networks

Authors on Pith no claims yet
classification 💻 cs.NE cs.LG
keywords computationadaptivefixednetworksneuralrecurrentrepeat-rnnsample
0
0 comments X
read the original abstract

Adaptive Computation Time for Recurrent Neural Networks (ACT) is one of the most promising architectures for variable computation. ACT adapts to the input sequence by being able to look at each sample more than once, and learn how many times it should do it. In this paper, we compare ACT to Repeat-RNN, a novel architecture based on repeating each sample a fixed number of times. We found surprising results, where Repeat-RNN performs as good as ACT in the selected tasks. Source code in TensorFlow and PyTorch is publicly available at https://imatge-upc.github.io/danifojo-2018-repeatrnn/

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.