Key points are not available for this paper at this time.
A novel variant of the familiar backpropagation-through-time approach to training recurrent networks is described. This algorithm is intended to be used on arbitrary recurrent networks that run continually without ever being reset to an initial state, and it is specifically designed for computationally efficient computer implementation. This algorithm can be viewed as a cross between epochwise backpropagation through time, which is not appropriate for continually running networks, and the widely used on-line gradient approximation technique of truncated backpropagation through time.
Building similarity graph...
Analyzing shared references across papers
Loading...
Williams et al. (Sat,) studied this question.
www.synapsesocial.com/papers/6a08a198ab15ea61dee8fa92 — DOI: https://doi.org/10.1162/neco.1990.2.4.490
Ronald J. Williams
Jing Peng
Neural Computation
Northeastern University
Building similarity graph...
Analyzing shared references across papers
Loading...