Next: About this document ...
Up: A FIXED SIZE STORAGE
Previous: ACKNOWLEDGEMENTS
 Gherrity, 1989

Gherrity, M. (1989).
A learning algorithm for analog fully recurrent neural networks.
In IEEE/INNS International Joint Conference on Neural Networks,
San Diego, volume 1, pages 643644.
 Pearlmutter, 1989

Pearlmutter, B. A. (1989).
Learning state space trajectories in recurrent neural networks.
Neural Computation, 1(2):263269.
 Pineda, 1990

Pineda, F. J. (1990).
Time dependent adaptive neural networks.
In Touretzky, D. S., editor, Advances in Neural Information
Processing Systems 2, pages 710718. Morgan Kaufmann.
 Robinson and Fallside, 1987

Robinson, A. J. and Fallside, F. (1987).
The utility driven dynamic error propagation network.
Technical Report CUED/FINFENG/TR.1, Cambridge University Engineering
Department.
 Schmidhuber, 1991

Schmidhuber, J. (1991).
Adaptive decomposition of time.
In Kohonen, T., Mäkisara, K., Simula, O., and Kangas, J.,
editors, Artificial Neural Networks, pages 909914. Elsevier Science
Publishers B.V., NorthHolland.
 Schmidhuber, 1992

Schmidhuber, J. (1992).
Learning complex, extended sequences using the principle of history
compression.
Neural Computation, 4(2):234242.
 Williams, 1989

Williams, R. J. (1989).
Complexity of exact gradient computation algorithms for recurrent
neural networks.
Technical Report Technical Report NUCCS8927, Boston: Northeastern
University, College of Computer Science.
 Williams and Peng, 1990

Williams, R. J. and Peng, J. (1990).
An efficient gradientbased algorithm for online training of
recurrent network trajectories.
Neural Computation, 4:491501.
 Williams and Zipser, 1989

Williams, R. J. and Zipser, D. (1989).
Experimental analysis of the realtime recurrent learning algorithm.
Connection Science, 1(1):87111.
 Williams and Zipser, 1994

Williams, R. J. and Zipser, D. (1994).
Gradientbased learning algorithms for recurrent networks and their
computational complexity.
In Backpropagation: Theory, Architectures and Applications.
Hillsdale, NJ: Erlbaum.
 Zipser, 1989

Zipser, D. (1989).
A subgrouping strategy that reduces learning complexity and speeds up
learning in recurrent networks.
Neural Computation, 1(4):552558.
Juergen Schmidhuber
20030213
Back to Recurrent Neural Networks page