By Topic

On learning a function of perceptrons

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)
Anthony, M. ; Dept. of Math., London Sch. of Econ., UK

This paper concerns the generalization accuracy when training a classifier that is a fixed Boolean function of the outputs of a number of perceptrons. The analysis involves the 'margins' achieved by the constituent perceptrons on the training data. A special case is that in which the fixed Boolean function is the majority function (where we have a 'committee of perceptrons'). Recent work of Auer et al. studied the computational properties of such networks (where they were called 'parallel perceptrons'), proposed an incremental learning algorithm for them. The results given here provide further motivation for the use of this learning rule.

Published in:

Neural Networks, 2004. Proceedings. 2004 IEEE International Joint Conference on  (Volume:2 )

Date of Conference:

25-29 July 2004