New FKI-Report

[Juergen Schmidhuber]

Here is another one:

---------------------------------------------------------------------

      AN O(n^3) LEARNING ALGORITHM FOR FULLY RECURRENT NETWORKS
                        Juergen Schmidhuber
              Technical Report FKI-151-91, May 6, 1991

  The fixed-size  storage learning  algorithm for  fully recurrent
  continually running networks  (e.g. (Robinson + Fallside, 1987),
  (Williams + Zipser, 1988)) requires O(n^4) computations per time
  step, where n is the  number of non-input  units. We  describe a
  method  which computes  exactly the same  gradient and  requires
  fixed-size storage of the same order  as the previous algorithm.
  But, the average time complexity per time step is O(n^3).

---------------------------------------------------------------------

To obtain a copy, do:

             unix>         ftp 131.159.8.35

             Name:         anonymous
             Password:     your name, please
             ftp>          binary
             ftp>          cd pub/fki
             ftp>          get fki151.ps.Z
             ftp>          bye

             unix>         uncompress fki151.ps.Z
             unix>         lpr  fki151.ps


Please do not forget to leave your name (instead of your
email address).

NOTE: fki151.ps is designed for European A4 paper format
      (20.9cm x 29.6cm).



In case of ftp-problems send email to
schmidhu at informatik.tu-muenchen.de
or contact

Juergen Schmidhuber
Institut fuer Informatik,
Technische Universitaet Muenchen
Arcisstr. 21
8000 Muenchen 2
GERMANY