The DOI matches its Crossref record; 78 of the 93 references it cites were found in a registry or an index.
Revisiting the Arcade Learning Environment: Evaluation Protocols and Open Problems for General Agents
Open accessAbstract
The Arcade Learning Environment (ALE) is an evaluation platform that poses the challenge of building AI agents with general competency across dozens of Atari 2600 games. It supports a variety of different problem settings and it has been receiving increasing attention from the scientific community, leading to some high-profile success stories such as the much publicized Deep Q-Networks (DQN). In this article we take a big picture look at how the ALE is being used by the research community. We show how diverse the evaluation methodologies in the ALE have become with time, and highlight some key concerns when evaluating agents in the ALE. We use this discussion to present some methodological best practices and provide new benchmark results using these best practices. To further the progress in the field, we introduce a new version of the ALE that supports multiple game modes and provides a form of stochasticity we call sticky actions. We conclude this big picture look by revisiting challenges posed when the ALE was introduced, summarizing the state-of-the-art in various problems and highlighting problems that remain open.
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.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“For instance, the standard protocol for the Atari benchmark (a set of environments that require limited generalisation (Cobbe et al., 2020)) is to use 200M environment interactions per game (Machado et al., 2018)”
From Craftax: A Lightning-Fast Benchmark for Open-Ended Reinforcement Learning (2024) · cites this paper as Machado et al., 2018
Experimental — accuracy not yet measuredThe cited source says what the claim attributes to it.
In the citing paper
“We abide by Machado et al. (2018)'s recommendations of evaluation protocol, including the use of stochasticity, ignoring the lives signal, and reporting the average performance during training.”
From Loss of Plasticity in Continual Deep Reinforcement Learning (2023) · cites this paper as Machado et al. (2018)
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
ImageNet classification with deep convolutional neural networks
Krizhevsky, A., Sutskever, I., & Hinton, G. E. (2017) · Communications of the ACM · doi:10.1145/3065386 · Cited by 112,155
Human-level control through deep reinforcement learning
Mnih, V., Kavukcuoglu, K., Silver, D., Rusu, A. A., Veness, J., Bellemare, M. G., Graves, A., Riedmiller, M., Fidjeland, A. K., Ostrovski, G., et al. (2015) · Nature · doi:10.1038/nature14236 · Cited by 30,357
Self-citationReinforcement Learning: An Introduction
Sutton, R. S., & Barto, A. (2005) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2004.842673 · Cited by 25,268
Mastering the game of Go with deep neural networks and tree search
Silver, D., Huang, A., Maddison, C. J., Guez, A., Sifre, L., van den Driessche, G., Schrittwieser, J., Antonoglou, I., Panneershelvam, V., Lanctot, M., et al. (2016) · Nature · doi:10.1038/nature16961 · Cited by 15,612
Bellman, R. E. (2010) · doi:10.1515/9781400835386 · Cited by 14,588
Asynchronous Methods for Deep Reinforcement Learning
Mnih, V., Badia, A. P., Mirza, M., Graves, A., Lillicrap, T. P., Harley, T., Silver, D., & Kavukcuoglu, K. (2016) · arXiv · doi:10.48550/arxiv.1602.01783 · Cited by 7,132
Deep Reinforcement Learning with Double Q-Learning
Van Hasselt, H., Guez, A., & Silver, D. (2016) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v30i1.10295 · Cited by 3,318
Dueling Network Architectures for Deep Reinforcement Learning
Wang, Z., Schaul, T., Hessel, M., van Hasselt, H., Lanctot, M., & de Freitas, N. (2015) · arXiv · doi:10.48550/arxiv.1511.06581 · Cited by 3,300
Schaul, T., Quan, J., Antonoglou, I., & Silver, D. (2015) · arXiv · doi:10.48550/arxiv.1511.05952 · Cited by 3,120
The Arcade Learning Environment: An Evaluation Platform for General Agents
Bellemare, M. G., Naddaf, Y., Veness, J., & Bowling, M. (2013) · Journal of Artificial Intelligence Research · doi:10.1613/jair.3912 · Cited by 2,161
Self-citationTransfer Learning for Reinforcement Learning Domains: A Survey
Taylor, M. E., & Stone, P. (2009) · doi:10.5555/1577069.1755839 · Cited by 1,524
On-line Q-learning Using Connectionist Systems
Rummery, G. A. (1994) · Cited by 1,477
Campbell, M., Hoane, A. J., & Hsu, F.-H. (2002) · Artificial Intelligence · doi:10.1016/s0004-3702(01)00129-1 · Cited by 1,226
Intrinsic Motivation Systems for Autonomous Mental Development
Oudeyer, P.-Y., Kaplan, F., & Hafner, V. V. (2007) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2006.890271 · Cited by 1,126
Reinforcement Learning with Unsupervised Auxiliary TasksPreprint
Jaderberg, M., Mnih, V., Czarnecki, W. M., Schaul, T., Leibo, J. Z., Silver, D., & Kavukcuoglu, K. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1611.05397 · Cited by 1,117
Deep Q-learning From Demonstrations
Hester, T., Vecerik, M., Pietquin, O., Lanctot, M., Schaul, T., Piot, B., Horgan, D., Quan, J., Sendonaris, A., Osband, I., et al. (2018) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v32i1.11757 · Cited by 889
Reinforcement learning for robots using neural networks
Lin, L.-J. (1992) · Defense Technical Information Center (DTIC) · Cited by 841
Deep Exploration via Bootstrapped DQNPreprint
Osband, I., Blundell, C., Pritzel, A., & Roy, B. V. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1602.04621 · Cited by 837
A Distributional Perspective on Reinforcement LearningPreprint
Bellemare, M. G., Dabney, W., & Munos, R. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1707.06887 · Cited by 724
Self-citationFeUdal Networks for Hierarchical Reinforcement LearningPreprint
Vezhnevets, A. S., Osindero, S., Schaul, T., Heess, N., Jaderberg, M., Silver, D., & Kavukcuoglu, K. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1703.01161 · Cited by 693
Intrinsically Motivated Reinforcement Learning
Singh, S. P., Barto, A. G., & Chentanez, N. (2005) · doi:10.21236/ada440280 · Cited by 614
Brockman, G., Cheung, V., Pettersson, L., Schneider, J., Schulman, J., Tang, J., & Zaremba, W. (2016) · arXiv · doi:10.48550/arxiv.1606.01540 · Cited by 582
Thrun, S., & Mitchell, T. M. (1995) · Robotics and Autonomous Systems · doi:10.1016/0921-8890(95)00004-y · Cited by 536
Action-Conditional Video Prediction using Deep Networks in Atari GamesPreprint
Oh, J., Guo, X., Lee, H., Lewis, R. L., & Singh, S. P. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1507.08750 · Cited by 524
PAC-Bayesian Generalization Error Bounds for Gaussian Process Classification
Seeger, M. (2003) · Infoscience (Ecole Polytechnique Fédérale de Lausanne) · doi:10.1162/153244303765208377 · Cited by 515
Actor-Mimic: Deep Multitask and Transfer Reinforcement LearningPreprint
Parisotto, E., Ba, J. L., & Salakhutdinov, R. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1511.06342 · Cited by 504
Incentivizing Exploration In Reinforcement Learning With Deep Predictive ModelsPreprint
Stadie, B. C., Levine, S., & Abbeel, P. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1507.00814 · Cited by 462
Schaeffer, J., BURCH, N. R., Björnsson, Y., Kishimoto, A., Müller, M., Lake, R., Lu, P., & Sutphen, S. (2007) · Science · doi:10.1126/science.1144079 · Cited by 452
An analysis of model-based Interval Estimation for Markov Decision Processes
Strehl, A. L., & Littman, M. L. (2008) · Journal of Computer and System Sciences · doi:10.1016/j.jcss.2007.08.009 · Cited by 428
A survey of real-time strategy game AI research and competition in StarCraft
Ontanon, S., Synnaeve, G., Uriarte, A., Richoux, F., Churchill, D., & Preuss, M. (2013) · IEEE Transactions on Computational Intelligence and AI in Games · doi:10.1109/tciaig.2013.2286295 · Cited by 423
Safe and Efficient Off-Policy Reinforcement LearningPreprint
Munos, R., Stepleton, T., Harutyunyan, A., & Bellemare, M. G. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1606.02647 · Cited by 391
Self-citationMassively Parallel Methods for Deep Reinforcement LearningPreprint
Nair, A., Srinivasan, P., Blackwell, S., Alcicek, C., Fearon, R., De Maria, A., Panneershelvam, V., Suleyman, M., Beattie, C., Petersen, S., et al. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1507.04296 · Cited by 390
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
Self-citationR-MAX: a general polynomial time algorithm for near-optimal reinforcement learning
Brafman, R. I., & Tennenholtz, M. (2001) · Cited by 366
Racing the beam: the Atari video computer system
(2009) · Choice Reviews Online · doi:10.5860/choice.46-6853 · Cited by 321
Sutton, R. S., Modayil, J., Delp, M., Degris, T., Pilarski, P. M., White, A., & Precup, D. (2011) · doi:10.5555/2031678.2031726 · Cited by 304
Knowledge Growth in an Artificial Animal
Wilson, S. W. (1986) · Springer eBooks · doi:10.1007/978-1-4757-1895-9_18 · Cited by 274
Deep Learning for Real-Time Atari Game Play Using Offline Monte-Carlo Tree Search Planning
Guo, X., Singh, S. P., Lee, H., Lewis, R. L., & Wang, X. (2014) · Cited by 271
Rusu, A. A., Colmenarejo, S. G., Gulcehre, C., Desjardins, G., Kirkpatrick, J., Pascanu, R., Mnih, V., Kavukcuoglu, K., & Hadsell, R. (2015) · arXiv · doi:10.48550/arxiv.1511.06295 · Cited by 270
Unifying Count-Based Exploration and Intrinsic Motivation
Bellemare, M. G., Srinivasan, S., Ostrovski, G., Schaul, T., Saxton, D., & Munos, R. (2016) · arXiv · doi:10.48550/arxiv.1606.01868 · Cited by 264
Self-citationIntrinsic Motivation and Reinforcement Learning
Barto, A. G. (2012) · Springer eBooks · doi:10.1007/978-3-642-32375-1_2 · Cited by 243
The Malmo platform for artificial intelligence experimentation
Johnson, M., Hofmann, K., Hutton, T. J., & Bignell, D. E. (2016) · International Joint Conference on Artificial Intelligence · Cited by 205
Graying the black box: Understanding DQNsPreprint
Zahavy, T., Ben-Zrihem, N., & Mannor, S. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1602.02658 · Cited by 200
Improving Multi-Step Prediction of Learned Time Series Models
Venkatraman, A., Hebert, M., & Bagnell, J. (2015) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v29i1.9590 · Cited by 198
A Neuroevolution Approach to General Atari Game Playing
Hausknecht, M. J., Lehman, J., Miikkulainen, R., & Stone, P. (2014) · IEEE Transactions on Computational Intelligence and AI in Games · doi:10.1109/tciaig.2013.2294713 · Cited by 193
Self-citationThe Arcade Learning Environment: An Evaluation Platform for General Agents
Bellemare, M. G., Naddaf, Y., Veness, J., & Bowling, M. (2012) · arXiv · doi:10.48550/arxiv.1207.4708 · Cited by 187
Self-citationReproducibility of Benchmarked Deep Reinforcement Learning Tasks for Continuous Control
Islam, R., Henderson, P., Gomrokchi, M., & Precup, D. (2017) · arXiv · doi:10.48550/arxiv.1708.04133 · Cited by 177
Recurrent Environment SimulatorsPreprint
Chiappa, S., Racanière, S., Wierstra, D., & Mohamed, S. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1704.02254 · Cited by 154
Sutton, R. S., Maei, H. R., & Szepesvári, C. (2008) · neural information processing systems · Cited by 152
CHILD: A First Step Towards Continual Learning
Ring, M. B. (1997) · Machine Learning · doi:10.1023/a:1007331723572 · Cited by 143
Approximate Planning in Large POMDPs via Reusable Trajectories
Kearns, M. J., Mansour, Y., & Ng, A. Y. (1999) · Cited by 135
Increasing the Action Gap: New Operators for Reinforcement Learning
G. Bellemare, M., Ostrovski, G., Guez, A., Thomas, P. S., & Munos, R. (2016) · AAAI Publications (The Association for the Advancement of Artificial Intelligence (AAAI)) · doi:10.1609/aaai.v30i1.10303 · Cited by 124
Self-citationCount-Based Exploration in Feature Space for Reinforcement Learning
Martin, J., Sasikumar, S. N., Everitt, T., & Hütter, M. (2017) · International Joint Conference on Artificial Intelligence · doi:10.24963/ijcai.2017/344 · Cited by 117
Maei, H. R., & Sutton, R. S. (2010) · Artificial General Intelligence · doi:10.2991/agi.2010.22 · Cited by 106
Learning from Demonstrations for Real World Reinforcement LearningPreprint
Hester, T., Vecerík, M., Pietquin, O., Lanctot, M., Schaul, T., Piot, B., Sendonaris, A., Dulac-Arnold, G., Osband, I., Agapiou, J., et al. (2017) · arXiv (Cornell University) · Cited by 96
A Laplacian Framework for Option Discovery in Reinforcement LearningPreprint
Machado, M. C., Bellemare, M. G., & Bowling, M. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1703.00956 · Cited by 93
Self-citationInvestigating Contingency Awareness Using Atari 2600 Games
Bellemare, M. G., Veness, J., & Bowling, M. (2021) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v26i1.8321 · Cited by 75
Self-citationLevine, J., Congdon, C. B., Ebner, M., Kendall, G., Lucas, S. M., Miikkulainen, R. P., Schaul, T., & Thompson, T. (2013) · Open Access at Essex (University of Essex) · doi:10.4230/dfu.vol6.12191.77 · Cited by 74
Beattie, C., Leibo, J. Z., Teplyashin, D., Ward, T., Wainwright, M., Küttler, H., Lefrancq, A., Green, S., Valdés, V., Sadik, A., et al. (2016) · arXiv · doi:10.48550/arxiv.1612.03801 · Cited by 68
State of the Art Control of Atari Games Using Shallow Reinforcement Learning
Liang, Y., Machado, M. C., Talvitie, E., & Bowling, M. (2016) · Adaptive Agents and Multi-Agents Systems · doi:10.5555/2936924.2936996 · Cited by 65
Self-citationClassical planning with simulators: results on the Atari video games
Lipovetzky, N., Ramírez, M., & Geffner, H. (2015) · Cited by 63
Model regularization for stable sample rollouts
Talvitie, E. (2014) · Cited by 51
Self-citationValue-Aware Loss Function for Model-based Reinforcement Learning
Farahmand, A. M., Barreto, A. D. M. S., & Nikovski, D. N. (2017) · PolyPublie (École Polytechnique de Montréal) · Cited by 46
Frame Skip Is a Powerful Parameter for Learning to Play Atari
Braylan, A. (2015) · National Conference on Artificial Intelligence · Cited by 46
Emergent Tangled Graph Representations for Atari Game Playing Agents
Kelly, S., & Heywood, M. I. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-55696-3_5 · Cited by 44
Self-Correcting Models for Model-Based Reinforcement Learning
Talvitie, E. (2017) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v31i1.10850 · Cited by 42
Self-citationReinforcement Learning in POMDPs Without Resets
Even-Dar, E., Kakade, S. M., & Mansour, Y. (2005) · ScholarlyCommons (University of Pennsylvania) · Cited by 39
Game-independent AI agents for playing Atari 2600 console games
Naddaf, Y. (2010) · ERA: Education and Research Archive (University of Alberta) · doi:10.7939/r3134q · Cited by 36
Bellemare, M. G., Veness, J., & Talvitie, E. (2014) · Cited by 35
Self-citationBlind search for Atari-like online planning revisited
Shleyfman, A., Tuisov, A., & Domshlak, C. (2016) · International Joint Conference on Artificial Intelligence · Cited by 25
The Impact of Determinism on Learning Atari 2600 Games
Hausknecht, M., & Stone, P. (2015) · National Conference on Artificial Intelligence · Cited by 24
Self-citationBayesian Learning of Recursively Factored Environments
Bellemare, M. G., Veness, J., & Bowling, M. (2013) · Cited by 21
Self-citationSketch-Based Linear Value Function Approximation
Bellemare, M. G., Veness, J., & Bowling, M. (2012) · Cited by 21
Self-citationDomain-Independent Optimistic Initialization for Reinforcement LearningPreprint
Machado, M. C., Srinivasan, S., & Bowling, M. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1410.4604 · Cited by 21
Self-citationA Comparison of learning algorithms on the Arcade Learning EnvironmentPreprint
Defazio, A., & Graepel, T. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1410.8620 · Cited by 20
Learning to Prune Dominated Action Sequences in Online Black-Box Planning
Jinnai, Y., & Fukunaga, A. S. (2017) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v31i1.10663 · Cited by 12
Reports of the 2016 AAAI Workshop Program
Albrecht, S. V., Bouchard, B., Brownstein, J. S., Buckeridge, D. L., Caragea, C., Carter, K. M., Darwiche, A. Y., Fortuna, B., Francillette, Y., Gaboury, S., et al. (2016) · AI Magazine · doi:10.1609/aimag.v37i3.2680 · Cited by 7
Veness, J., Bellemare, M. G., Hütter, M., Chua, A., & Desjardins, G. (2015) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v29i1.9600 · Cited by 6
Self-citation
Flagged first, then by citations
15 of the 93 references couldn’t be matched to a known paper.
Research works printed but not linked: 8
- Hausknecht, M.; Lehman, J.; Miikkulainen, R.; and Stone, P. 2013. A neuroevolution approach to general atari game playing. In IEEE Transactions on Computational Intelli- gence and AI in Games.
- Mnih, V.; Kavukcuoglu, K.; Silver, D.; Graves, A.; Antonoglou, I.; Wierstra, D.; and Riedmiller, M. 2013. Playing atari with deep reinforcement learning. CoRR abs/1312.5602. · arXiv
- Albrecht, S. V., L., J. C., Buckeridge, D. L., Botea, A., Caragea, C., Chi, C., Damoulas, T., Dilkina, B. N., Eaton, E., Fazli, P., Ganzfried, S., Lindauer, M. T., Machado, M. C., Malitsky, Y., Marcus, G., Meijer, S., Rossi, F., Shaban-Nejad, A., Thiebaux, S., Veloso, M. M., Walsh, T., Wang, C., Zhang, J., & Zheng, Y. (2015). Reports on the 2015 AAAI Workshop Program. AI Magazine, 36 (2), 90-101.
- Campbell, M., Hoane, Jr., A. J., & Hsu, F.-h. (2002). Deep Blue. Artificial Intelligence, 134 (1-2), 57-83.
- Harutyunyan, A., Bellemare, M. G., Stepleton, T., & Munos, R. (2016). Q(λ) with Off- Policy Corrections. In Proceedings of the International Conference on Algorithmic Learning Theory (ALT), pp. 305-320.
- Hutter, M. (2005). Universal Artificial Intelligence: Sequential Decisions based on Algorith- mic Probability. Springer.
- Kearns, M. J., & Singh, S. P. (2002). Near-Optimal Reinforcement Learning in Polynomial Time. Machine Learning, 49 (2-3), 209-232.
- Nair, A., Srinivasan, P., Blackwell, S., Alcicek, C., Fearon, R., Maria, A. D., Panneershelvam, V., Suleyman, M., Beattie, C., Petersen, S., Legg, S., Mnih, V., Kavukcuoglu, K., & Silver, D. (2015). Massively Parallel Methods for Deep Reinforcement Learning. In ICML Deep Learning Workshop.
Cited by
Sorted by citations
Deep Reinforcement Learning That Matters
Henderson, P., Islam, R., Bachman, P., Pineau, J., Precup, D., & Meger, D. (2018) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v32i1.11694 · Cited by 1,685
Mastering Atari, Go, chess and shogi by planning with a learned model
Schrittwieser, J., Antonoglou, I., Hubert, T., Simonyan, K., Sifre, L., Schmitt, S., Guez, A., Lockhart, E., Hassabis, D., Graepel, T., et al. (2020) · RePEc: Research Papers in Economics · Cited by 1,310
Mastering Atari, Go, chess and shogi by planning with a learned model
Schrittwieser, J., Antonoglou, I., Hubert, T., Simonyan, K., Sifre, L., Schmitt, S., Guez, A., Lockhart, E., Hassabis, D., Graepel, T., et al. (2020) · Nature · doi:10.1038/s41586-020-03051-4 · Cited by 1,214
Meta-Learning in Neural Networks: A Survey
Hospedales, T. M., Antoniou, A., Micaelli, P., & Storkey, A. J. (2021) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2021.3079209 · Cited by 886
QT-Opt: Scalable Deep Reinforcement Learning for Vision-Based Robotic Manipulation
Kalashnikov, D., Irpan, A., Pastor, P., Ibarz, J., Herzog, A., Jang, E., Quillen, D., Holly, E., Kalakrishnan, M., Vanhoucke, V., et al. (2018) · arXiv · doi:10.48550/arxiv.1806.10293 · Cited by 697
Metadata
- Authors
- Machado, M. C., Bellemare, M. G., Talvitie, E., Veness, J., Hausknecht, M., & Bowling, M.
- Affiliations
- University of Alberta (CA)
- Franklin & Marshall College (US)
- Google DeepMind (United Kingdom) (GB)
- Microsoft (United States) (US)
- Venue
- Journal of Artificial Intelligence Research
- Publisher
- AI Access Foundation
- Published
- 2018-03-19
- Volume
- 61
- Pages
- 523-562
- ISSN
- 1076-9757 (ISSN-L)
- OpenAlex
- W2754879180
- Cited by
- 359
- References
- 93
- Citations by year
- 2026: 9 · 2025: 16 · 2024: 21 · 2023: 27 · 2022: 30 · 2021: 71 · 2020: 71 · 2019: 73 · 2018: 39
- FWCI
- 35.74
- Type
- journal article
- Language
- en
- Open access
- diamond
- doi.org
- Licence
- cc-by
- Locations
- Journal of Artificial Intelligence Research (publishedVersion, cc-by)
- arXiv (Cornell University) (submittedVersion)
- arXiv (Cornell University)
- Funders
- National Science Foundation (1552533)
- Compute Canada
- Alberta Machine Intelligence Institute
- DeepMind
- Alberta Innovates - Technology Futures
- Alberta Innovates
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Reinforcement Learning in Robotics
- Physical Sciences › Computer Science › Artificial Intelligence › Artificial Intelligence in Games
- Physical Sciences › Computer Science › Artificial Intelligence › Artificial Intelligence Applications
- Keywords
- Arcade Learning Environment, evaluation methodology, benchmark results, deep Q-network, game modes, evaluation best practices
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
