The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
A Possibility for Implementing Curiosity and Boredom in Model-Building Neural Controllers
Open accessAbstract
This paper introduces a framework for `curious neural controllers' which employ an adaptive world model for goal directed on-line learning. First an on-line reinforcement learning algorithm for autonomous `animats' is described. The algorithm is based on two fully recurrent `self-supervised' continually running networks which learn in parallel. One of the networks learns to represent a complete model of the environmental dynamics and is called the `model network'. It provides complete `credit assignment paths' into the past for the second network which controls the animats physical actions in a possibly reactive environment. The animats goal is to maximize cumulative reinforcement and minimize cumulative `pain'. The algorithm has properties which allow to implement something like the desire to improve the model network's knowledge about the world. This is related to curiosity. It is described how the particular algorithm (as well as similar model-building algorithms) may be augmented ...
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 truck backer-upper: an example of self-learning in neural networks
Nguyen, & Widrow (1989) · International Joint Conference on Neural Networks · doi:10.1109/ijcnn.1989.118723 · Cited by 449
Experimental Analysis of the Real-time Recurrent Learning Algorithm
WILLIAMS, R. J., & ZIPSER, D. (1989) · Connection Science · doi:10.1080/09540098908915631 · Cited by 292
Supervised learning and systems with excess degrees of freedom
Jordan, M. I. (1988) · Cited by 180
Backpropagation and neurocontrol: a review and prospectus
Werbos, P. J. (1989) · doi:10.1109/ijcnn.1989.118583 · Cited by 129
An on-line algorithm for dynamic reinforcement learning and planning in reactive environments
Schmidhuber, J. (1990) · International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn.1990.137723 · Cited by 95
Self-citationStatic and Dynamic Error Propagation Networks with Application to Speech Coding
Robinson, A. J., & Fallside, F. (1987) · Cited by 79
On the use of backpropagation in associative reinforcement learning
Williams (1988) · IEEE International Conference on Neural Networks/IEEE ... International Conference on Neural Networks · doi:10.1109/icnn.1988.23856 · Cited by 72
Dynamic Reinforcement Driven Error Propagation Networks with Application to Game Playing
Robinson, T., & Fallside, F. (1989) · eScholarship (California Digital Library) · Cited by 18
Cited by
Deep Reinforcement Learning: A Brief Survey
Arulkumaran, K., Deisenroth, M. P., Brundage, M., & Bharath, A. A. (2017) · IEEE Signal Processing Magazine · doi:10.1109/msp.2017.2743240 · Cited by 4,733
A Brief Survey of Deep Reinforcement Learning
Arulkumaran, K., Deisenroth, M. P., Brundage, M., & Bharath, A. A. (2017) · arXiv · doi:10.48550/arxiv.1708.05866 · Cited by 4,733
Curiosity-Driven Exploration by Self-Supervised Prediction
Pathak, D., Agrawal, P., Efros, A. A., & Darrell, T. (2017) · 2017 IEEE Conference on Computer Vision and Pattern Recognition Workshops (CVPRW) · doi:10.1109/cvprw.2017.70 · Cited by 1,815
A Review on Generative Adversarial Networks: Algorithms, Theory, and Applications
Gui, J., Sun, Z., Wen, Y., Tao, D., & Ye, J. (2023) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2021.3130191 · Cited by 1,231
Meta-Learning in Neural Networks: A Survey
Hospedales, T., Antoniou, A., Micaelli, P., & Storkey, A. (2020) · arXiv · doi:10.48550/arxiv.2004.05439 · Cited by 886
Metadata
- Authors
- Schmidhuber, J.
- Venue
- From Animals to Animats
- Publisher
- The MIT Press
- Published
- 1991-02-04
- Pages
- 222-228
- OpenAlex
- W172298727
- Cited by
- 421
- References
- 8
- FWCI
- 1.37
- Type
- book chapter
- Language
- en
- Open access
- green
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: A Possibility for Implementing Curiosity and Boredom in Model-Building Neural Controllers. https://app.cochat.ai/papers/10.7551/mitpress/3115.003.0030
- The paper
- Schmidhuber, J. (1991). A Possibility for Implementing Curiosity and Boredom in Model-Building Neural Controllers. From Animals to Animats. https://doi.org/10.7551/mitpress/3115.003.0030
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.