The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Opposition-Based Reinforcement Learning
Open accessAbstract
Reinforcement learning is a machine intelligence scheme for learning in highly dynamic, probabilistic environments. By interaction with the environment, reinforcement agents learn optimal control policies, especially in the absence of a priori knowledge and/or a sufficiently large amount of training data. Despite its advantages, however, reinforcement learning suffers from a major drawback - high calculation cost because convergence to an optimal solution usually requires that all states be visited frequently to ensure that policy is reliable. This is not always possible, however, due to the complex, high-dimensional state space in many applications. This paper introduces opposition-based reinforcement learning, inspired by opposition-based learning, to speed up convergence. Considering opposite actions simultaneously enables individual states to be updated more than once shortening exploration and expediting convergence. Three versions of Q-learning algorithm will be given as examples. Experimental results for the grid world problem of different sizes demonstrate the superior performance of the proposed approach.
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
Reinforcement Learning: An Introduction
Sutton, R. S., & Barto, A. G. (1998) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.1998.712192 · Cited by 27,225
Watkins, C. J. C. H., & Dayan, P. (1992) · Machine Learning · doi:10.1007/bf00992698 · Cited by 9,083
Reinforcement Learning: A Survey
Kaelbling, L. P., Littman, M. L., & Moore, A. W. (1996) · Journal of Artificial Intelligence Research · doi:10.1613/jair.301 · Cited by 8,972
Relational Reinforcement Learning
Džeroski, S., De Raedt, L., & Driessens, K. (2001) · Machine Learning · doi:10.1023/a:1007694015589 · Cited by 371
Cited by
Opposition-Based Differential Evolution
Rahnamayan, S., Tizhoosh, H. R., & Salama, M. M. A. (2008) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2007.894200 · Cited by 1,630
Self-citationAn improved differential evolution algorithm and its application in optimization problem
Deng, W., Shang, S., Cai, X., Zhao, H., Song, Y., & Xu, J. (2021) · Soft Computing · doi:10.1007/s00500-020-05527-x · Cited by 383
A novel population initialization method for accelerating evolutionary algorithms
Rahnamayan, S., Tizhoosh, H. R., & Salama, M. M. A. (2007) · Computers & Mathematics with Applications · doi:10.1016/j.camwa.2006.07.013 · Cited by 374
Self-citationOpposition versus randomness in soft computing techniques
Rahnamayan, S., Tizhoosh, H. R., & Salama, M. M. A. (2008) · Applied Soft Computing · doi:10.1016/j.asoc.2007.07.010 · Cited by 338
Self-citationOppositional biogeography-based optimization
Ergezer, M., Simon, D., & Du, D. (2009) · 2009 IEEE International Conference on Systems, Man and Cybernetics · doi:10.1109/icsmc.2009.5346043 · Cited by 300
Metadata
- Authors
- Tizhoosh, H. R., & Pattern Analysis and Machine Intelligence Laboratory, S. D. E.
- Venue
- Journal of Advanced Computational Intelligence and Intelligent Informatics
- Publisher
- Fuji Technology Press Ltd.
- Published
- 2006-07-20
- Volume
- 10
- Issue
- 4
- Pages
- 578-585
- ISSN
- 1343-0130 (ISSN-L)
- 1883-8014
- OpenAlex
- W190427941
- Cited by
- 204
- References
- 4
- FWCI
- 16.07
- Type
- journal article
- Language
- en
- Open access
- hybrid
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.