A Variable Memory Quasi-Newton Training Algorithm
Neural Processing Letters
| Hi-index | 0.00 |
An approach to flexible and efficient data parallel simulation of neural networks on large scale MIMD machines is presented. We regard the exploitation of the inherent parallelism of neural network models as necessary if larger networks and training data sets respectively are to be considered. Nevertheless it is essential to provide the flexibility for investigating various training algorithms or creating new ones without intimate knowledge of the underlaying hardware architecture and communication subsystem. We therefore encapsulated functional units being substantial with respect to the parallel execution. Based on these components even complex training algorithms can be formulated as a sequential program while the details of the parallelization are transparent. Communication tasks are performed very efficiently by using a distributed logarithmic tree. This logical structure additionally allows a direct mapping of the algorithm on various important parallel architectures. Finally a theoretical time complexity model is given and the correspondence to empirical data is shown.