Parallel Implementation of a Recursive Least-Squares Neural Network Training Method on the Intel iPSC/2
✍ Scribed by J.E. Steck; B. Mcmillin; K. Krishnamurthy; G.G. Leininger
- Publisher
- Elsevier Science
- Year
- 1993
- Tongue
- English
- Weight
- 391 KB
- Volume
- 18
- Category
- Article
- ISSN
- 0743-7315
No coin nor oath required. For personal study only.
✦ Synopsis
An algorithm based on the Marquardt-Levenberg leastsquares optimization method has been shown by (S). Kollias and D. Anastasiou to be a much more efficient training method than gradient descent, when applied to some small feedforward neural networks. Yet, for many applications, the increase in computational complexity of the method outweighs any gain in learning rate obtained over current training methods. However, the leastsquares method lends itself to a more efficient implementation on distributed memory parallel computers than do standard methods. This is demonstrated by comparing computation times and learning rates for the least-squares method implemented on 1,2 , 4, 8, and 16 processors on an Intel iPSC/2 multicomputer. Two applications are given which demonstrate the faster real-time learning rate of the least-squares method over that of gradient descent. 1993 Academic Press, Inc.