The moving targets algorithm for difficult temporal credit assignment problems

Richard Rohwer, Fionn Murtagh (Editor)

    Research output: Unpublished contribution to conferenceUnpublished Conference Paperpeer-review


    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.
    Original languageEnglish
    Publication statusPublished - 1990
    EventNeural Networks for Statistical and Economic Data - Dublin, Republic of Ireland
    Duration: 10 Dec 199011 Dec 1990


    WorkshopNeural Networks for Statistical and Economic Data
    CityDublin, Republic of Ireland


    • networks
    • algorithm
    • minimization
    • moving target

    Cite this