The DOI matches its Crossref record.
Connectionist Learning for Control: An Overview
Abstract
THIS REPORT IS AN INTRODUCTORY OVERVIEW OF LEARNING BY CONNECTIONIST NETWORKS, ALSO CALLED ARTIFICIAL NEURAL NETWORKS, WITH A FOCUS ON THE IDEAS AND METHODS MOST RELEVANT TO THE CONTROL OF DYNAMICAL SYSTEMS. IT IS INTENDED BOTH TO PROVIDE AN OVERVIEW OF CONNECTIONIST IDEAS FOR CONTROL THEORISTS AND TO PROVIDE CONNECTIONIST RESEARCHERS WITH AN INTRODUCTION TO CERTAIN ISSUES IN CONTROL. THE PERSPECTIVE TAKEN EMPHASIZES THE CONTINUITY OF THE CURRENT CONNECTIONIST RESEARCH WITH MORE TRADITIONAL RESEARCH IN CONTROL, SIGNAL PROCESSING, AND PATTERN CLASSIFICATION. CONTROL THEORY IS A WELL-DEVELOPED FIELD WITH A LARGE LITERATURE, AND MANY OF THE LEARNING METHODS BEING DESCRIBED BY CONNECTIONISTS ARE CLOSELY RELATED TO METHODS THAT ALREADY HAVE BEEN INTENSIVELY STUDIED BY ADAPTIVE CONTROL THEORISTS. ON THE OTHER HAND, THE DIRECTIONS THAT CONNECTIONISTS ARE TAKING THESE METHODS HAVE CHARACTERISTICS THAT ARE ABSENT IN THE TRADITIONAL ENGINEERING APPROACHES. THIS REPORT DESCRIBES THESE CHARACTERISTICS AND DISCUSSES THEIR POSITIVE AND NEGATIVE ASPECTS. IT IS ARGUED THAT CONNECTIONISTS APPROACHES TO CONTROL ARE SPECIAL CASES OF MEMORY--INTENTIVE APPROACHES, PROVIDED A SUFFICIENTLY GENERALIZED VIEW OF MEMORY IS ADOPTED. BECAUSE ADAPTIVE CONNECTIONIST NETWORKS CAN COVER THE RANGE BETWEEN STRUCTURELESS LOOKUP TABLES AND HIGHLY CONSTRAINED MODEL-BASED PARAMETER ESTIMATION, THEY SEEM WELL-SUITED FOR THE ACQUISITION AND STORAGE OF CONTROL INFORMATION. AD
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
Cited by
Reinforcement Learning: An Introduction
(2005) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2004.842673 · Cited by 24,496
Adaptive representation of dynamics during learning of a motor task
Shadmehr, R., & Mussa-Ivaldi, F. (1994) · The Journal of Neuroscience · doi:10.1523/jneurosci.14-05-03208.1994 · Cited by 2,612
Reinforcement learning and adaptive dynamic programming for feedback control
Lewis, F. L., & Vrabie, D. (2009) · IEEE Circuits and Systems Magazine · doi:10.1109/mcas.2009.933854 · Cited by 1,558
Is the cerebellum a Smith predictor?
Miall, R. C., Weir, D. J., Wolpert, D. M., & Stein, J. F. (1993) · Journal of Motor Behavior · doi:10.1080/00222895.1993.9942050 · Cited by 1,071
An evolutionary algorithm that constructs recurrent neural networks
Angeline, P. J., Saunders, G. M., & Pollack, J. B. (1994) · IEEE Transactions on Neural Networks · doi:10.1109/72.265960 · Cited by 1,012
Metadata
- Authors
- Barto, A. G.
- Venue
- Neural Networks for Control
- Publisher
- The MIT Press
- Published
- 1991-01-10
- Pages
- 5-58
- OpenAlex
- W1984482772
- Cited by
- 200
- References
- 0
- FWCI
- 35.70
- Type
- book chapter
- 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: Connectionist Learning for Control: An Overview. https://app.cochat.ai/papers/10.7551/mitpress/4939.003.0005
- The paper
- Barto, A. G. (1991). Connectionist Learning for Control: An Overview. Neural Networks for Control. https://doi.org/10.7551/mitpress/4939.003.0005
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.