The DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.
Online learning control by association and reinforcement
Abstract
This paper focuses on a systematic treatment for developing a generic online learning control system based on the fundamental principle of reinforcement learning or more specifically neural dynamic programming. This online learning system improves its performance over time in two aspects: 1) it learns from its own mistakes through the reinforcement signal from the external environment and tries to reinforce its action to improve future performance; and 2) system states associated with the positive reinforcement is memorized through a network learning process where in the future, similar states will be more positively associated with a control action leading to a positive reinforcement. A successful candidate of online learning control design is introduced. Real-time learning algorithms is derived for individual components in the learning system. Some analytical insight is provided to give guidelines on the learning process took place in each module of the online learning control system.
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
Kohonen, T. (2001) · Springer Series in Information Sciences · doi:10.1007/978-3-642-56927-2 · Cited by 16,019
A Stochastic Approximation Method
Robbins, H., & Monro, S. (1951) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177729586 · Cited by 9,643
Watkins, C. J. C. H., & Dayan, P. (1992) · Machine Learning · doi:10.1007/bf00992698 · Cited by 9,083
Learning to predict by the methods of temporal differences
Sutton, R. S. (1988) · Machine Learning · doi:10.1007/bf00115009 · Cited by 5,148
Kirk, D. E. (1970) · Cited by 3,804
(2012) · Encyclopedia of the Sciences of Learning · doi:10.1007/978-1-4419-1428-6_5086 · Cited by 3,515
Neuronlike adaptive elements that can solve difficult learning control problems
Barto, A. G., Sutton, R. S., & Anderson, C. W. (1983) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/tsmc.1983.6313077 · Cited by 3,233
Freimer, M., Bellman, R. E., & Dreyfus, S. E. (1964) · Journal of the American Statistical Association · doi:10.2307/2282884 · Cited by 2,153
Bellman, R. E., & Dreyfus, S. E. (1962) · Princeton University Press eBooks · doi:10.1515/9781400874651 · Cited by 1,971
Neuro-Dynamic Programming: NDP
Bertsekas, D. P. (2001) · Encyclopedia of Optimization · doi:10.1007/0-306-48332-7_333 · Cited by 1,466
Dynamic Programming: Deterministic and Stochastic Models
Bertsekas, D. P. (1987) · Medical Entomology and Zoology · Cited by 1,325
An analysis of temporal-difference learning with function approximation
Tsitsiklis, J. N., & Van Roy, B. (1997) · IEEE Transactions on Automatic Control · doi:10.1109/9.580874 · Cited by 1,194
Prokhorov, D. V., & Wunsch, D. C. (1997) · IEEE Transactions on Neural Networks · doi:10.1109/72.623201 · Cited by 1,186
Stochastic Approximation Algorithms and Applications
Puhalskii, A., Kushner, H. J., & Yin, G. G. (1998) · Journal of the American Statistical Association · doi:10.2307/2669885 · Cited by 994
Approximate dynamic programming for real-time control and neural modeling
Werbos, P. J. (1992) · Medical Entomology and Zoology · Cited by 971
(2011) · Encyclopedia of Machine Learning · doi:10.1007/978-0-387-30164-8_588 · Cited by 950
Stochastic Approximation Algorithms and Applications
Kushner, H. J., & Yin, G. G. (1997) · Springer eBooks · doi:10.1007/978-1-4899-2696-8 · Cited by 869
TD-Gammon, a Self-Teaching Backgammon Program, Achieves Master-Level Play
Tesauro, G. (1994) · Neural Computation · doi:10.1162/neco.1994.6.2.215 · Cited by 787
Practical issues in temporal difference learning
Tesauro, G. (1992) · Machine Learning · doi:10.1007/bf00992697 · Cited by 787
Learning Through Reinforcement and Replicator Dynamics
Börgers, T., & Sarin, R. (1997) · Journal of Economic Theory · doi:10.1006/jeth.1997.2319 · Cited by 737
A Menu of Designs for Reinforcement Learning Over Time
Werbos, P. J. (1991) · Neural Networks for Control · doi:10.7551/mitpress/4939.003.0007 · Cited by 605
Experiments with Reinforcement Learning in Problems with Continuous State and Action Spaces
Santamaria, J. C., Sutton, R. S., & Ram, A. (1997) · Adaptive Behavior · doi:10.1177/105971239700600201 · Cited by 258
Adaptive critic designs: A case study for neurocontrol
Prokhorov, D. V., Santiago, R. A., & Wunsch, D. C. (1995) · Neural Networks · doi:10.1016/0893-6080(95)00042-9 · Cited by 199
A survey of dynamic programming computational procedures
Larson, R. E. (1967) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1967.1098755 · Cited by 81
Neurogammon: a neural-network backgammon program
Tesauro, G. (1990) · International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn.1990.137821 · Cited by 63
A neighboring optimal adaptive critic for missile guidance
Dalton, J. S., & Balakrishnan, S. N. (1996) · Mathematical and Computer Modelling · doi:10.1016/0895-7177(95)00226-x · Cited by 36
Cited by
Al-Tamimi, A., Lewis, F. L., & Abu-Khalaf, M. (2007) · Automatica · doi:10.1016/j.automatica.2006.09.019 · Cited by 611
Cui, R., Yang, C., Li, Y., & Sharma, S. (2017) · IEEE Transactions on Systems, Man, and Cybernetics: Systems · doi:10.1109/tsmc.2016.2645699 · Cited by 538
Dynamic Energy Management System for a Smart Microgrid
Venayagamoorthy, G. K., Sharma, R. K., Gautam, P. K., & Ahmadi, A. (2016) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2016.2514358 · Cited by 328
Liu, D., Wang, D., Wang, F.-Y., Li, H., & Yang, X. (2014) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2014.2357896 · Cited by 310
A translational perspective on the anti-anhedonic effect of ketamine and its neural underpinnings
Pulcu, E., Guinea, C., Cowen, P. J., Murphy, S. E., & Harmer, C. J. (2022) · Molecular Psychiatry · doi:10.1038/s41380-021-01183-1 · Cited by 35
Metadata
- Authors
- Si, J., & Wang, Y.-T.
- Venue
- IEEE Transactions on Neural Networks
- Published
- 2001-03
- Volume
- 12
- Issue
- 2
- Pages
- 264-276
- ISSN
- 1045-9227 (ISSN-L)
- OpenAlex
- W2165501837
- Cited by
- 773
- References
- 26
- FWCI
- 9.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.