A Fixed Size Storage O(n3) Time Complexity Learning Algorithm for Fully Recurrent Continually Running Networks
暂无分享,去创建一个
[1] M. Gherrity,et al. A learning algorithm for analog, fully recurrent neural networks , 1989, International 1989 Joint Conference on Neural Networks.
[2] Barak A. Pearlmutter. Learning State Space Trajectories in Recurrent Neural Networks , 1988, Neural Computation.
[3] Ronald J. Williams,et al. Experimental Analysis of the Real-time Recurrent Learning Algorithm , 1989 .
[4] Fernando J. Pineda,et al. Time Dependent Adaptive Neural Networks , 1989, NIPS.
[5] David Zipser,et al. A Subgrouping Strategy that Reduces Complexity and Speeds Up Learning in Recurrent Networks , 1989, Neural Computation.
[6] Jing Peng,et al. An Efficient Gradient-Based Algorithm for On-Line Training of Recurrent Network Trajectories , 1990, Neural Computation.
[7] Jürgen Schmidhuber,et al. Adaptive decomposition of time , 1991 .
[8] J. Urgen Schmidhuber. Adaptive Decomposition Of Time , 1991 .
[9] Jürgen Schmidhuber,et al. Learning Complex, Extended Sequences Using the Principle of History Compression , 1992, Neural Computation.