title: Average case analysis of an Hebb-type rule that finds the network connectivity.
abstract: We describe an Hebb-type algorithm for learning unions of nonoverlapping perceptrons with binary weights. Two perceptrons are said to be nonoverlapping if they do not share any input variables. The learning algorithm is able to find both the network architecture and the weight values necessary to represent the target function. Moreover, the algorithm is local, homogeneous, and simple enough to be biologically plausible. We investigate the average behavior of this algorithm as a function of the size of the training set. We find that, as the size of the training set increases, the hypothesis network built by the algorithm "converges" to the target network, both in terms of the number of perceptrons and the connectivity. Moreover, the generalization rate converges exponentially to perfect generalization as a function of the number of training examples. The analytic expressions are in excellent agreement with the numerical simulations. To our knowledge, this is the first average case analysis of an algorithm that finds both the weight values and the network connectivity.
authors: Ottawa-Carleton Institute for Physics, University of Ottawa, Ont., Canada.
authors: M
authors: M
authors: Golea
mesh_terms: D000465:Algorithms; D005793:Generalization, Psychological; D016571:Neural Networks, Computer; D009434:Neural Pathways