The DOI matches its Crossref record; 49 of the 49 references it cites were found in a registry or an index.
Task Decomposition Through Competition in a Modular Connectionist Architecture: The What and Where Vision Tasks
Abstract
A novel modular connectionist architecture is presented in which the networks composing the architecture compete to learn the training patterns. An outcome of the competition is that different networks learn different training patterns and, thus, learn to compute different functions. The architecture performs task decomposition in the sense that it learns to partition a task into two or more functionally independent tasks and allocates distinct networks to learn each task. In addition, the architecture tends to allocate to each task the network whose topology is most appropriate to that task. The architecture's performance on “what” and “where” vision tasks is presented and compared with the performance of two multilayer networks. Finally, it is noted that function decomposition is an underconstrained problem, and, thus, different modular architectures may decompose a function in different ways. A desirable decomposition can be achieved if the architecture is suitably restricted in the types of functions that it can compute. Finding appropriate restrictions is possible through the application of domain knowledge. A strength of the modular architecture is that its structure is well suited for incorporating domain knowledge.
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
Multilayer feedforward networks are universal approximators
Hornik, K., Stinchcombe, M., & White, H. (1989) · Neural Networks · doi:10.1016/0893-6080(89)90020-8 · Cited by 21,728
Learning Internal Representations by Error Propagation
Rumelhart, D. E., Hinton, G. E., & Williams, R. J. (1985) · doi:10.21236/ada164453 · Cited by 16,172
Parallel Distributed Processing: Explorations in the Microstructure of Cognition: Foundations
Rumelhart, D. E., McClelland, J. L., & AU (1986) · doi:10.7551/mitpress/5236.001.0001 · Cited by 15,686
(1973) · CERN Document Server (European Organization for Nuclear Research) · Cited by 12,895
Self-organized formation of topologically correct feature maps
Kohonen, T. (1982) · Biological Cybernetics · doi:10.1007/bf00337288 · Cited by 9,529
Multilayer feedforward networks are universal approximators
HornikK., StinchcombeM., & WhiteH. (1989) · Neural Networks · doi:10.5555/70405.70408 · Cited by 9,081
Adaptive Mixtures of Local Experts
Jacobs, R. A., Jordan, M. I., Nowlan, S. J., & Hinton, G. E. (1991) · Neural Computation · doi:10.1162/neco.1991.3.1.79 · Cited by 5,384
Self-citationPattern Classification and Scene Analysis
Thompson, M., Duda, R. O., & Hart, P. E. (1974) · Leonardo · doi:10.2307/1573081 · Cited by 4,495
Object vision and spatial vision: Two cortical pathways
Mishkin, M., Ungerleider, L. G., & Macko, K. A. (1983) · Trends in Neurosciences · doi:10.1016/0166-2236(83)90190-x · Cited by 2,947 · cited 2×
“Mishkin, Ungerleider, and Macko (1983) reviewed evidence that a pathway running ventrally, interconnecting the striate, prestriate, and inferior temporal areas, computes object recognition, whereas a pathway running dorsally, interconnecting the striate, prestriate and inferior parietal areas, computes spatial localiz…”
Beyond Regression : "New Tools for Prediction and Analysis in the Behavioral Sciences
Werbos, P. J. (1974) · Medical Entomology and Zoology · Cited by 2,789
Cited by
Adaptive Mixtures of Local Experts
Jacobs, R. A., Jordan, M. I., Nowlan, S. J., & Hinton, G. E. (1991) · Neural Computation · doi:10.1162/neco.1991.3.1.79 · Cited by 5,384
Self-citationHolroyd, C. B., & Coles, M. G. H. (2002) · Psychological Review · doi:10.1037/0033-295x.109.4.679 · Cited by 4,027
Being There: Putting Brain, Body and World Together Again.
van Gelder, T., & Clark, A. (1998) · The Philosophical Review · doi:10.2307/2998391 · Cited by 3,128
Multiple paired forward and inverse models for motor control
Wolpert, D. M., & Kawato, M. (1998) · Neural Networks · doi:10.1016/s0893-6080(98)00066-5 · Cited by 2,151
Statistical learning of tone sequences by human infants and adults
Saffran, J. R., Johnson, E. K., Aslin, R. N., & Newport, E. L. (1999) · Cognition · doi:10.1016/s0010-0277(98)00075-4 · Cited by 1,429
Deep dyslexia: A case study of connectionist neuropsychology
Plaut, D. C., & Shallice, T. (1993) · Cognitive Neuropsychology · doi:10.1080/02643299308253469 · Cited by 856
MOSAIC Model for Sensorimotor Learning and Control
Haruno, M., Wolpert, D. M., & Kawato, M. (2001) · Neural Computation · doi:10.1162/089976601750541778 · Cited by 709
Mixture of experts: a literature survey
Masoudnia, S., & Ebrahimpour, R. (2014) · Artificial Intelligence Review · doi:10.1007/s10462-012-9338-y · Cited by 561
Generalisation of regular and irregular morphological patterns
Prasada, S., & Pinker, S. (1993) · Language and Cognitive Processes · doi:10.1080/01690969308406948 · Cited by 534
Learning and selective attention
Dayan, P., Kakade, S., & Montague, P. R. (2000) · Nature Neuroscience · doi:10.1038/81504 · Cited by 495
Multiple Realizability Revisited: Linking Cognitive and Neural States
Bechtel, W., & Mundale, J. (1999) · Philosophy of Science · doi:10.1086/392683 · Cited by 483
Evolutionary ensembles with negative correlation learning
Higuchi, T., Yao, X., & Liu, Y. (2000) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.887237 · Cited by 445
Rethinking Eliminative Connectionism
Marcus, G. F. (1998) · Cognitive Psychology · doi:10.1006/cogp.1998.0694 · Cited by 348
Two routes or one in reading aloud? A connectionist dual-process model.
Zorzi, M., Houghton, G., & Butterworth, B. (1998) · Journal of Experimental Psychology: Human Perception and Performance · doi:10.1037/0096-1523.24.4.1131 · Cited by 339
Symbolically speaking: a connectionist model of sentence production
Chang, F. (2002) · Cognitive Science · doi:10.1016/s0364-0213(02)00079-4 · Cited by 337
Associative Engines: Connectionism, Concepts and Representational Change.
McCauley, R. N., & Clark, A. (1995) · The Philosophical Quarterly · doi:10.2307/2220426 · Cited by 315
Transfer of learning by composing solutions of elemental sequential tasks
Singh, S. P. (1992) · Machine Learning · doi:10.1007/bf00992700 · Cited by 288
Separate modifiability, mental modules, and the use of pure and composite measures to reveal them
Sternberg, S. (2001) · Acta Psychologica · doi:10.1016/s0001-6918(00)00045-7 · Cited by 266
An improved algorithm for neural network classification of imbalanced training sets
Anand, R., Mehrotra, K. G., Mohan, C. K., & Ranka, S. (1993) · IEEE Transactions on Neural Networks · doi:10.1109/72.286891 · Cited by 262
A comparative study of classifier ensembles for bankruptcy prediction
Tsai, C.-F., Hsu, Y.-F., & Yen, D. C. (2014) · Applied Soft Computing · doi:10.1016/j.asoc.2014.08.047 · Cited by 202
Multi-Source Domain Adaptation with Mixture of Experts
Guo, J., Shah, D., & Barzilay, R. (2018) · Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing · doi:10.18653/v1/d18-1498 · Cited by 168
Brain-like functional specialization emerges spontaneously in deep neural networks
Dobs, K., Martinez, J., Kell, A. J. E., & Kanwisher, N. (2022) · Science Advances · doi:10.1126/sciadv.abl8913 · Cited by 129
Model averaging, optimal inference, and habit formation
FitzGerald, T. H. B., Dolan, R. J., & Friston, K. J. (2014) · Frontiers in Human Neuroscience · doi:10.3389/fnhum.2014.00457 · Cited by 121
Metadata
- Authors
- Jacobs, R. A., Jordan, M. I., & Barto, A. G.
- Venue
- Cognitive Science
- Publisher
- Wiley
- Published
- 1991-04
- Volume
- 15
- Issue
- 2
- Pages
- 219-250
- ISSN
- 0364-0213 (ISSN-L)
- 1551-6709
- OpenAlex
- W1979500821
- Cited by
- 490
- References
- 49
- FWCI
- 21.76
- 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
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.