Design of Cooperative Networks
Name
AI_WP_253.pdf
Description
Main article
Size
1.12 MB
Format
Adobe PDF
Checksum (MD5)
b6d6fcb1de90335d76ddb9ede487971a
Author(s)
Marroquin, J. L.
Date Issued
July 1983
Publisher
MIT Artificial Intelligence Laboratory
Series/Report no.
MIT Artificial Intelligence Laboratory Working Papers, WP-253
Abstract
In this paper we analyse several approaches to the design of Cooperative Algorithms for solving a general problem: That of computing the values of some property over a spatial domain, when these values are constrained (but not uniquely determined) by some observations, and by some a priori knowledge about the nature of the solution (smoothness, for example).
Specifically, we discuss the use of: Variational techniques; stochastic approximation methods for global optimization, and linear threshold networks. Finally, we present a new approach, based on the interconnection of Winner-take-all networks, for which it is possible to establish precise convergence results, including bounds on the rate of convergence.
Persistent DSpace Link
