The moving targets algorithm for difficult temporal credit assignment problems


The 'moving targets' algorithm for training recurrent networks is reviewed and applied to a task which demonstrates the ability of this algorithm to use distant contextual information. Some practical difficulties are discussed, especially with regard to the minimization process. Results on performance and computational requirements of several different 2nd-order minimization algorithms are presented for moving target problems.

Divisions: Aston University (General)
Event Title: Neural Networks for Statistical and Economic Data
Event Type: Other
Event Dates: 1990-12-10 - 1990-12-11
Last Modified: 29 Nov 2023 14:12
Date Deposited: 11 Mar 2019 20:32
PURE Output Type: Paper
Published Date: 1990
Authors: Rohwer, Richard

Export / Share Citation


Additional statistics for this record