By Topic

Data-parallel training of spatiotemporal connectionist networks on the Connection Machine

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Fontaine, T. ; Dept. of Comput. & Inf. Sci., Pennsylvania Univ., Philadelphia, PA, USA

An algorithm for optimizing spatiotemporal connectionist networks utilizing training set parallelism has been implemented on the Connection Machine (CM). The algorithm supports several optimization methods including backpropagation, conjugate gradient, and pseudo-Newtonian. By allocating one CM processor per training example, the computational complexity of the gradient derivation becomes independent of the number of training examples. The author has experimentally corroborated this independence, and reports the timing performance of the Connection Machine implementation on a series of spatiotemporal discrimination tasks. He also presents the timing performance of a serial implementation of the algorithm, running on an IBM RS/6000, to emphasize the efficacy of the data-parallel approach

Published in:

Neural Networks, 1992. IJCNN., International Joint Conference on  (Volume:4 )

Date of Conference:

7-11 Jun 1992