A Symbolic Complexity Analysis of Connectionist Algorithms for Distributed-Memory Machines

TitleA Symbolic Complexity Analysis of Connectionist Algorithms for Distributed-Memory Machines
Publication TypeTechnical Report
Year of Publication1992
AuthorsBachrach, J.
Other Numbers748
Abstract

This paper attempts to rigorously determine the computation and communication requirements of connectionist algorithms running on a distributed-memory machine. The strategy involves (1) specifying key connectionist algorithms in a high-level object-oriented language, (2) extracting their running times as polynomials, and (3) analyzing these polynomials to determine the algorithms' space and time complexity. Results are presented for various implementations of the back-propagation algorithm.

URLhttp://www.icsi.berkeley.edu/ftp/global/pub/techreports/1992/tr-92-043.pdf
Bibliographic Notes

ICSI Technical Report TR-92-043

Abbreviated Authors

J. Bachrach

ICSI Publication Type

Technical Report