The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
On the Computational Power of Winner-Take-All
Abstract
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-takeall 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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The Handbook of brain theory and neural networks
(1996) · Choice Reviews Online · doi:10.5860/choice.33-4484 · Cited by 3,870
The Synaptic Organization of the Brain
(2004) · Oxford University Press eBooks · doi:10.1093/acprof:oso/9780195159561.001.1 · Cited by 3,546
Advances in neural information processing systems 11
Peter Sollich, A. (1999) · Cited by 3,168
Leshno, M., Lin, V. Y., Pinkus, A., & Schocken, S. (1993) · Neural Networks · doi:10.1016/s0893-6080(05)80131-5 · Cited by 2,121
The Complexity of Boolean Functions
Wegener, I. (1987) · Cited by 882
Winner-Take-All Networks of O(N) Complexity
Lazzaro, J., Ryckebusch, S., Mahowald, M. A., & Mead, C. A. (1988) · doi:10.21236/ada451466 · Cited by 582
Competition and Cooperation in Neural Nets
AMARI, S.-I., & ARBIB, M. A. (1977) · Systems Neuroscience · doi:10.1016/b978-0-12-491850-4.50009-x · Cited by 378
Current-mode subthreshold MOS circuits for analog VLSI neural systems
Andreou, A. G., Boahen, K. A., Pouliquen, P. O., Pavasovic, A., Jenkins, R. E., & Strohbehn, K. (1991) · IEEE Transactions on Neural Networks · doi:10.1109/72.80331 · Cited by 313
Models of Computation: Exploring the Power of Computing
Savage, J. E. (1998) · Cited by 293
Ellias, S. A., & Grossberg, S. (1975) · Biological Cybernetics · doi:10.1007/bf00327046 · Cited by 271
Cited by
Deep learning in neural networks: an overview
Schmidhuber, J. (2015) · Neural Networks · doi:10.1016/j.neunet.2014.09.003 · Cited by 18,570
Maass, W., Natschläger, T., & Markram, H. (2002) · Neural Computation · doi:10.1162/089976602760407955 · Cited by 4,025
Self-citationNEURONAL CIRCUITS OF THE NEOCORTEX
Douglas, R. J., & Martin, K. A. C. (2004) · Annual Review of Neuroscience · doi:10.1146/annurev.neuro.27.070203.144152 · Cited by 1,886
Opportunities for neuromorphic computing algorithms and applications
Schuman, C. D., Kulkarni, S. R., Parsa, M., Mitchell, J. P., Date, P., & Kay, B. (2022) · Nature Computational Science · doi:10.1038/s43588-021-00184-y · Cited by 1,117
Scaling up molecular pattern recognition with DNA-based winner-take-all neural networks
Cherry, K. M., & Qian, L. (2018) · Nature · doi:10.1038/s41586-018-0289-6 · Cited by 486
Metadata
- Authors
- Maass, W.
- Venue
- Neural Computation
- Publisher
- MIT Press - Journals
- Published
- 2000-11-01
- Volume
- 12
- Issue
- 11
- Pages
- 2519-2535
- ISSN
- 0899-7667 (ISSN-L)
- 1530-888X
- OpenAlex
- W2167148127
- Cited by
- 355
- References
- 24
- FWCI
- 6.25
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: On the Computational Power of Winner-Take-All. https://app.cochat.ai/papers/10.1162/089976600300014827
- The paper
- Maass, W. (2000). On the Computational Power of Winner-Take-All. Neural Computation. https://doi.org/10.1162/089976600300014827
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.