Reinforcement Learning: An Introduction
The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
IS THERE MORE TO UNCERTAINTY THAN SOME PROBABILITY THEORISTS MIGHT HAVE US BELIEVE?*
Klir, G. J. (1989) · International Journal of General Systems · doi:10.1080/03081078908935057 · Cited by 103
Cited by
Playing Atari with Deep Reinforcement Learning
Mnih, V., Kavukcuoglu, K., Silver, D., Graves, A., Antonoglou, I., Wierstra, D., & Riedmiller, M. (2013) · arXiv · doi:10.48550/arxiv.1312.5602 · Cited by 9,471
A Survey of the Usages of Deep Learning for Natural Language Processing
Otter, D. W., Medina, J. R., & Kalita, J. K. (2021) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2020.2979670 · Cited by 1,836
Concrete Problems in AI Safety
Amodei, D., Olah, C., Steinhardt, J., Christiano, P., Schulman, J., & Mané, D. (2016) · arXiv · doi:10.48550/arxiv.1606.06565 · Cited by 1,314
Efficient Selectivity and Backup Operators in Monte-Carlo Tree Search
Coulom, R. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-75538-8_7 · Cited by 1,240
Foundations of Machine Learning
Mohri, M., Rostamizadeh, A., & Talwalkar, A. (2018) · doi:10.7551/mitpress/10290.001.0001 · Cited by 1,122
(2015) · Journal of Machine Learning Research · Cited by 1,119
Introduction to Multi-Armed Bandits
Slivkins, A. (2019) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000068 · Cited by 780
SNAS: Stochastic Neural Architecture Search
Xie, S., Zheng, H., Liu, C., & Lin, L. (2018) · arXiv · doi:10.48550/arxiv.1812.09926 · Cited by 731
IntelliLight: A Reinforcement Learning Approach for Intelligent Traffic Light Control
Wei, H., Zheng, G., Yao, H., & Li, Z. (2018) · Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining · doi:10.1145/3219819.3220096 · Cited by 684
DRN: A Deep Reinforcement Learning Framework for News Recommendation
Zheng, G., Zhang, F., Zheng, Z., Xiang, Y., Yuan, N. J., Xie, X., & Li, Z. (2018) · Proceedings of the 2018 World Wide Web Conference on World Wide Web - WWW '18 · doi:10.1145/3178876.3185994 · Cited by 630
Autonomous Inverted Helicopter Flight via Reinforcement Learning
Ng, A. Y., Coates, A., Diel, M., Ganapathi, V., Schulte, J., Tse, B., Berger, E., & Liang, E. (2006) · Springer Tracts in Advanced Robotics · doi:10.1007/11552246_35 · Cited by 553
Noisy Networks for Exploration
Fortunato, M., Azar, M. G., Piot, B., Menick, J., Osband, I., Graves, A., Mnih, V., Munos, R., Hassabis, D., Pietquin, O., et al. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1706.10295 · Cited by 543
Active learning of inverse models with intrinsically motivated goal exploration in robots
Baranes, A., & Oudeyer, P.-Y. (2013) · Robotics and Autonomous Systems · doi:10.1016/j.robot.2012.05.008 · Cited by 455
Convergence rates of efficient global optimization algorithms
Bull, A. D. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1101.3501 · Cited by 446
Types of machine learning algorithms
Oladipupo, T. (2010) · New Advances in Machine Learning · doi:10.5772/9385 · Cited by 443
Unbiased offline evaluation of contextual-bandit-based news article recommendation algorithms
Li, L., Chu, W., Langford, J., & Wang, X. (2011) · Proceedings of the fourth ACM international conference on Web search and data mining · doi:10.1145/1935826.1935878 · Cited by 443
Prediction error in reinforcement learning: A meta-analysis of neuroimaging studies
Garrison, J., Erdeniz, B., & Done, J. (2013) · Neuroscience & Biobehavioral Reviews · doi:10.1016/j.neubiorev.2013.03.023 · Cited by 438
Deep Exploration via Bootstrapped DQN
Osband, I., Blundell, C., Pritzel, A., & Roy, B. V. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1602.04621 · Cited by 434
Deep reinforcement learning for page-wise recommendations
Zhao, X., Xia, L., Zhang, L., Ding, Z., Yin, D., & Tang, J. (2018) · Proceedings of the 12th ACM Conference on Recommender Systems · doi:10.1145/3240323.3240374 · Cited by 418
Multi-Hop Knowledge Graph Reasoning with Reward Shaping
Lin, X. V., Socher, R., & Xiong, C. (2018) · Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing · doi:10.18653/v1/d18-1362 · Cited by 399
(2000) · CrossRef Listing of Deleted DOIs · doi:10.1162/1532443041827907 · Cited by 388
Neural Symbolic Machines: Learning Semantic Parsers on Freebase with Weak Supervision
Liang, C., Berant, J., Le, Q., Forbus, K. D., & Lao, N. (2017) · Proceedings of the 55th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers) · doi:10.18653/v1/p17-1003 · Cited by 381
Count-Based Exploration with Neural Density Models
Ostrovski, G., Bellemare, M. G., Oord, A. V. D., & Munos, R. (2017) · arXiv · doi:10.48550/arxiv.1703.01310 · Cited by 377
Stochastic dynamic programming with factored representations
Boutilier, C., Dearden, R., & Goldszmidt, M. (2000) · Artificial Intelligence · doi:10.1016/s0004-3702(00)00033-3 · Cited by 361
Multi-agent reinforcement learning as a rehearsal for decentralized planning
Kraemer, L., & Banerjee, B. (2016) · Neurocomputing · doi:10.1016/j.neucom.2016.01.031 · Cited by 343
Dynamic Maps for Long-Term Operation of Mobile Service Robots
Biber, P., & Duckett, T. (2005) · Robotics: Science and Systems I · doi:10.15607/rss.2005.i.003 · Cited by 334
Deep Reinforcement Learning for Mention-Ranking Coreference Models
Clark, K., & Manning, C. D. (2016) · Proceedings of the 2016 Conference on Empirical Methods in Natural Language Processing · doi:10.18653/v1/d16-1245 · Cited by 328
Oboe: auto-tuning video ABR algorithms to network conditions
Akhtar, Z., Nam, Y. S., Govindan, R., Rao, S., Chen, J., Katz-Bassett, E., Ribeiro, B., Zhan, J., & Zhang, H. (2018) · Proceedings of the 2018 Conference of the ACM Special Interest Group on Data Communication · doi:10.1145/3230543.3230558 · Cited by 327
Reinforcement Learning Approach for Optimal Distributed Energy Management in a Microgrid
Foruzan, E., Soh, L.-K., & Asgarpoor, S. (2018) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2018.2823641 · Cited by 294
Data-based approximate policy iteration for affine nonlinear continuous-time optimal control design
Luo, B., Wu, H.-N., Huang, T., & Liu, D. (2014) · Automatica · doi:10.1016/j.automatica.2014.10.056 · Cited by 280
FlipIt: The Game of “Stealthy Takeover”
van Dijk, M., Juels, A., Oprea, A., & Rivest, R. L. (2013) · Journal of Cryptology · doi:10.1007/s00145-012-9134-5 · Cited by 275
Taming the Monster: A Fast and Simple Algorithm for Contextual Bandits
Agarwal, A., Hsu, D., Kale, S., Langford, J. C., Li, L. C., & Schapire, R. E. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1402.0555 · Cited by 273
Operant variability: Evidence, functions, and theory
Neuringer, A. (2002) · Psychonomic Bulletin & Review · doi:10.3758/bf03196324 · Cited by 272
Customer Acquisition via Display Advertising Using Multi-Armed Bandit Experiments
Schwartz, E. M., Bradlow, E. T., & Fader, P. S. (2017) · Marketing Science · doi:10.1287/mksc.2016.1023 · Cited by 260
Brandi, S., Piscitelli, M. S., Martellacci, M., & Capozzoli, A. (2020) · Energy and Buildings · doi:10.1016/j.enbuild.2020.110225 · Cited by 258
Leike, J., Martic, M., Krakovna, V., Ortega, P. A., Everitt, T., Lefrancq, A., Orseau, L., & Legg, S. (2017) · arXiv · doi:10.48550/arxiv.1711.09883 · Cited by 240
Darla Improving zero-shot transfer in reinforcement learning
Higgins, I., Pal, A., Rusu, A. A., Matthey, L., Burgess, C. P., Pritzel, A., Botvinick, M., Blundell, C., & Lerchner, A. (2017) · arXiv · doi:10.48550/arxiv.1707.08475 · Cited by 219
Learning with Opponent-Learning Awareness
Foerster, J., Chen, R. Y., Al-Shedivat, M., Whiteson, S., Abbeel, P., & Mordatch, I. (2018) · International Joint Conference on Autonomous Agents and Multiagent Systems · doi:10.65109/hgwa8807 · Cited by 215
AWAC: Accelerating Online Reinforcement Learning with Offline Datasets
Nair, A., Gupta, A., Dalal, M., & Levine, S. (2020) · arXiv · doi:10.48550/arxiv.2006.09359 · Cited by 175
Blundell, C., Uria, B., Pritzel, A., Li, Y., Ruderman, A., Leibo, J. Z., Rae, J., Wierstra, D., & Hassabis, D. (2016) · arXiv · doi:10.48550/arxiv.1606.04460 · Cited by 162
Bengio, Y. (2017) · arXiv · doi:10.48550/arxiv.1709.08568 · Cited by 155
Safe Exploration in Markov Decision Processes
Moldovan, T. M., & Abbeel, P. (2012) · arXiv · doi:10.48550/arxiv.1205.4810 · Cited by 152
Towards Deep Symbolic Reinforcement Learning
Garnelo, M., Arulkumaran, K., & Shanahan, M. (2016) · arXiv · doi:10.48550/arxiv.1609.05518 · Cited by 146
“m on a stochastic variant of the game. 1 Introduction Deep reinforcement learning (DRL), wherein a deep neural network [1, 2] is used as a function approximator within a reinforcement learning system [3], has recently been shown to be effective in a number of domains, including Atari video games [4], robotics [5], and…”
BackgroundMinimax Regret Bounds for Reinforcement Learning
Azar, M. G., Osband, I., & Munos, R. (2017) · arXiv · doi:10.48550/arxiv.1703.05449 · Cited by 124
Axiomatic methods, dopamine and reward prediction error
Caplin, A., & Dean, M. (2008) · Current Opinion in Neurobiology · doi:10.1016/j.conb.2008.07.007 · Cited by 88
Clune, J. (2019) · arXiv · doi:10.48550/arxiv.1905.10985 · Cited by 82
“], good initializations [50, 52], normalization schemes [74, 98], hierarchical methods [34, 11, 60, 188], capsules[144, 64], unsupervisedlearningtechniques[52, 135,89, 51], valueor advantagefunctions [179], intrinsic motivation [174, 128, 126, 19], trust regions [153], auxiliary tasks [76], solutions to catastrophic f…”
Background(2018) · arXiv (Cornell University) · Cited by 74
Approach-Induced Biases in Human Information Sampling
Hunt, L. T., Rutledge, R. B., Malalasekera, W. M. N., Kennerley, S. W., & Dolan, R. J. (2016) · PLOS Biology · doi:10.1371/journal.pbio.2000638 · Cited by 60
Interactive Intent Modeling for Exploratory Search
Ruotsalo, T., Peltonen, J., Eugster, M. J. A., Głowacka, D., Floréen, P., Myllymäki, P., Jacucci, G., & Kaski, S. (2018) · ACM Transactions on Information Systems · doi:10.1145/3231593 · Cited by 57
Meta-learning of Sequential Strategies
Ortega, P. A., Wang, J. X., Rowland, M., Genewein, T., Kurth-Nelson, Z., Pascanu, R., Heess, N., Veness, J., Pritzel, A., Sprechmann, P., et al. (2019) · arXiv · doi:10.48550/arxiv.1905.03030 · Cited by 47
“ntial prediction case to create an adaptive agent that acts according to probability matching—and more specifically, Thompson sampling [Thompson, 1933]—to address the exploration-exploitation problem [Sutton et al., 1998]. For this, we need generators that not only produce observations, but also optimal actions provide…”
BackgroundA Survey of Exploration Methods in Reinforcement Learning
Amin, S., Gomrokchi, M., Satija, H., van Hoof, H., & Precup, D. (2021) · arXiv · doi:10.48550/arxiv.2109.00157 · Cited by 41
On the Weaknesses of Reinforcement Learning for Neural Machine Translation
Choshen, L., Fox, L., Aizenbud, Z., & Abend, O. (2019) · arXiv · doi:10.48550/arxiv.1907.01752 · Cited by 28
Observational Learning by Reinforcement Learning
Borsa, D., Piot, B., Munos, R., & Pietquin, O. (2017) · arXiv · doi:10.48550/arxiv.1706.06617 · Cited by 47
“ng another agent sharing its environment. In the machine learning literature, one of the most popular and successful ways for modeling goalmotivated learning agents is via Reinforcement Learning (RL) [1, 2]. In the recent years, combining RL with the increased representational power of deep learning [3] and the memory…”
BackgroundPlanning and Learning in Environments with Delayed Feedback
Walsh, T. J., Nouri, A., Li, L., & Littman, M. L. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-74958-5_41 · Cited by 23
Pattern recognition of human arm movement using deep reinforcement learning
Seok, W., Kim, Y., & Park, C. (2018) · 2018 International Conference on Information Networking (ICOIN) · doi:10.1109/icoin.2018.8343257 · Cited by 25
Optimal Policies Tend To Seek Power
Turner, A. M., Smith, L., Shah, R., Critch, A., & Tadepalli, P. (2019) · arXiv · doi:10.48550/arxiv.1912.01683 · Cited by 18
Albers, H. J., Hall, K. M., Lee, K. D., Taleghan, M. A., & Dietterich, T. G. (2018) · Ecological Economics · doi:10.1016/j.ecolecon.2018.03.031 · Cited by 14
Metadata
- Venue
- Kybernetes
- Publisher
- Emerald
- Published
- 1998-12-01
- Volume
- 27
- Issue
- 9
- Pages
- 1093-1096
- ISSN
- 0368-492X (ISSN-L)
- OpenAlex
- W2312609093
- Cited by
- 1,472
- References
- 1
- FWCI
- 18.38
- 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.