论文信息 - Learning state space trajectories in recurrent neural networks : a preliminary report. - 字舞流文

Learning state space trajectories in recurrent neural networks : a preliminary report.

Abstract : We describe a procedure for finding learning state space trajectories in recurrent neural networks. Keywords: Connectionism; Learning algorithm; Trajectories following; Minimizing functionals.

Barak A. Pearlmutter

[1] A. E. Bryson,et al. A Steepest-Ascent Method for Solving Optimum Programming Problems , 1962 .

[2] P. Werbos,et al. Beyond Regression : "New Tools for Prediction and Analysis in the Behavioral Sciences , 1974 .

[3] C. D. Gelatt,et al. Optimization by Simulated Annealing , 1983, Science.

[4] Geoffrey E. Hinton,et al. A Learning Algorithm for Boltzmann Machines , 1985, Cogn. Sci..

[5] Geoffrey E. Hinton,et al. Learning internal representations by error propagation , 1986 .

[6] J. M. Sanz-Serna,et al. On simple moving grid methods for one-dimensional evolutionary partial differential equations , 1988 .

[7] Carsten Peterson,et al. A Mean Field Theory Learning Algorithm for Neural Networks , 1987, Complex Syst..

[8] Pineda,et al. Generalization of back-propagation to recurrent neural networks. , 1987, Physical review letters.

[9] Patrice Y. Simard,et al. Analysis of Recurrent Backpropagation , 1988 .

[10] PAUL J. WERBOS,et al. Generalization of backpropagation with application to a recurrent gas market model , 1988, Neural Networks.

[11] Geoffrey E. Hinton,et al. Phoneme recognition using time-delay neural networks , 1989, IEEE Trans. Acoust. Speech Signal Process..

[12] Ronald J. Williams,et al. A Learning Algorithm for Continually Running Fully Recurrent Neural Networks , 1989, Neural Computation.

[13] Michael I. Jordan. Attractor dynamics and parallelism in a connectionist sequential machine , 1990 .