HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS		QUICK SEARCH:   [advanced] Author: Keyword(s): Year:  Vol:  Page:

This Article Full Text Full Text (PDF) Alert me when this article is cited Alert me if a correction is posted Services Similar articles in this journal Similar articles in PubMed Alert me to new issues of the journal Download to citation manager Citing Articles Citing Articles via HighWire Citing Articles via Google Scholar Google Scholar Articles by Maass, W. Search for Related Content PubMed PubMed Citation Articles by Maass, W.

On the Computational Power of Winner-Take-All

Institute for Theoretical Computer Science, Technische Universität Graz, A-8010 Graz, Austria

This article initiates a rigorous theoretical analysis of the computational power of circuits that employ modules for computing winner-take-all. Computational models that involve competitive stages have so far been neglected in computational complexity theory, although they are widely used in computational brain models, artificial neural networks, and analog VLSI. Our theoretical analysis shows that winner-take-all is a surprisingly powerful computational module in comparison with threshold gates (also referred to as McCulloch-Pitts neurons) and sigmoidal gates. We prove an optimal quadratic lower bound for computing winner-take-all in any feedforward circuit consisting of threshold gates. In addition we show that arbitrary continuous functions can be approximated by circuits employing a single soft winner-take-all gate as their only nonlinear operation.

Our theoretical analysis also provides answers to two basic questions raised by neurophysiologists in view of the well-known asymmetry between excitatory and inhibitory connections in cortical circuits: how much computational power of neural networks is lost if only positive weights are employed in weighted sums and how much adaptive capability is lost if only the positive weights are subject to plasticity.

This article has been cited by other articles:

				J. Sima and P. Orponen General-Purpose Computation with Neural Networks: A Survey of Complexity Theoretic Results Neural Comput., December 1, 2003; 15(12): 2727 - 2778. [Abstract] [Full Text] [PDF]

				W. Maass, T. Natschlager, and H. Markram Real-Time Computing Without Stable States: A New Framework for Neural Computation Based on Perturbations Neural Comput., November 1, 2002; 14(11): 2531 - 2560. [Abstract] [Full Text] [PDF]

				X. Xie, R. H. R. Hahnloser, and H. S. Seung Selectively Grouping Neurons in Recurrent Networks of Lateral Inhibition Neural Comput., November 1, 2002; 14(11): 2627 - 2646. [Abstract] [Full Text] [PDF]