Publication Details
Title: A Symbolic Complexity Analysis of Connectionist Algorithms for Distributed-Memory Machines
Author: J. Bachrach
Group: ICSI Technical Reports
Date: July 1992
PDF: ftp://ftp.icsi.berkeley.edu/pub/techreports/1992/tr-92-043.pdf
Overview:
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.
Bibliographic Information:
ICSI Technical Report TR-92-043
Bibliographic Reference:
J. Bachrach. A Symbolic Complexity Analysis of Connectionist Algorithms for Distributed-Memory Machines. ICSI Technical Report TR-92-043, July 1992
Author: J. Bachrach
Group: ICSI Technical Reports
Date: July 1992
PDF: ftp://ftp.icsi.berkeley.edu/pub/techreports/1992/tr-92-043.pdf
Overview:
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.
Bibliographic Information:
ICSI Technical Report TR-92-043
Bibliographic Reference:
J. Bachrach. A Symbolic Complexity Analysis of Connectionist Algorithms for Distributed-Memory Machines. ICSI Technical Report TR-92-043, July 1992