Please use this identifier to cite or link to this item:
|Title:||Parallel growing and training of neural networks using output parallelism||Authors:||Guan, S.-U.
|Keywords:||Constructive learning algorithm
Multilayered feedforward networks
|Issue Date:||May-2002||Citation:||Guan, S.-U., Li, S. (2002-05). Parallel growing and training of neural networks using output parallelism. IEEE Transactions on Neural Networks 13 (3) : 542-550. ScholarBank@NUS Repository. https://doi.org/10.1109/TNN.2002.1000123||Abstract:||In order to find an appropriate architecture for a large-scale real-world application automatically and efficiently, a natural method is to divide the original problem into a set of subproblems. In this paper, we propose a simple neural-network task decomposition method based on output parallelism. By using this method, a problem can be divided flexibly into several subproblems as chosen, each of which is composed of the whole input vector and a fraction of the output vector. Each module (for one subproblem) is responsible for producing a fraction of the output vector of the original problem. The hidden structure for the original problem's output units are decoupled. These modules can be grown and trained in parallel on parallel processing elements. Incorporated with a constructive learning algorithm, our method does not require excessive computation and any prior knowledge concerning decomposition. The feasibility of output parallelism is analyzed and proved. Some benchmarks are implemented to test the validity of this method. Their results show that this method can reduce computational time, increase learning speed and improve generalization accuracy for both classification and regression problems.||Source Title:||IEEE Transactions on Neural Networks||URI:||http://scholarbank.nus.edu.sg/handle/10635/56984||ISSN:||10459227||DOI:||10.1109/TNN.2002.1000123|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.