The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
A Neuroevolution Approach to General Atari Game Playing
Open accessAbstract
This paper addresses the challenge of learning to play many different video games with little domain-specific knowledge. Specifically, it introduces a neuroevolution approach to general Atari 2600 game playing. Four neuroevolution algorithms were paired with three different state representations and evaluated on a set of 61 Atari games. The neuroevolution agents represent different points along the spectrum of algorithmic sophistication - including weight evolution on topologically fixed neural networks (conventional neuroevolution), covariance matrix adaptation evolution strategy (CMA-ES), neuroevolution of augmenting topologies (NEAT), and indirect network encoding (HyperNEAT). State representations include an object representation of the game screen, the raw pixels of the game screen, and seeded noise (a comparative baseline). Results indicate that direct-encoding methods work best on compact state representations while indirect-encoding methods (i.e., HyperNEAT) allow scaling to higher dimensional representations (i.e., the raw game screen). Previous approaches based on temporal-difference (TD) learning had trouble dealing with the large state spaces and sparse reward gradients often found in Atari games. Neuroevolution ameliorates these problems and evolved policies achieve state-of-the-art results, even surpassing human high scores on three games. These results suggest that neuroevolution is a promising approach to general video game playing (GVGP).
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
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 · cited 1×
“The four different neuroevolution algorithms applied to the Atari domain are simple weight evolution over a topologically static neural network (CNE), CMA–ES, evolution of weights and topology (NEAT [43]), and indirect encoding of network weights (HyperNEAT [15]).”
MethodBuilding high-level features using large scale unsupervised learning
Le, Q. V. (2013) · 2013 IEEE International Conference on Acoustics, Speech and Signal Processing · doi:10.1109/icassp.2013.6639343 · Cited by 1,695
Neuroevolution: from architectures to learning
Floreano, D., Dürr, P., & Mattiussi, C. (2008) · Evolutionary Intelligence · doi:10.1007/s12065-007-0002-4 · Cited by 734 · cited 1×
“Neuroevolution algorithms [13], [32] have been successful on a variety of tasks including quadruped locomotion [8], [50], evolution of morphology [6], design of robot morphology and control [29], Checkers [14], Unreal Tournament [38], and game playing [5], [47].”
BackgroundUniversal Artificial Intellegence
Hutter, M. (2005) · Texts in Theoretical Computer Science An EATCS Series · doi:10.1007/b138233 · Cited by 523
A video game description language for model-based or interactive learning
Schaul, T. (2013) · 2013 IEEE Conference on Computational Inteligence in Games (CIG) · doi:10.1109/cig.2013.6633610 · Cited by 214 · cited 1×
“Recently, there has been a push to bring GGP into the realm of video games [27], creating the area of GVGP [28], [36].”
Background
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
Evolution Strategies as a Scalable Alternative to Reinforcement Learning
Salimans, T., Ho, J., Chen, X., Sidor, S., & Sutskever, I. (2017) · arXiv · doi:10.48550/arxiv.1703.03864 · Cited by 1,027
“For Atari, Hausknecht et al. [2014] obtain impressive results.”
ResultDesigning neural networks through neuroevolution
Stanley, K. O., Clune, J., Lehman, J., & Miikkulainen, R. (2019) · Nature Machine Intelligence · doi:10.1038/s42256-018-0006-z · Cited by 689
Self-citationReinforcement learning algorithms: A brief survey
Shakya, A. K., Pillai, G., & Chakrabarty, S. (2023) · Expert Systems with Applications · doi:10.1016/j.eswa.2023.120495 · Cited by 656
Mocanu, D. C., Mocanu, E., Stone, P., Nguyen, P. H., Gibescu, M., & Liotta, A. (2018) · Nature Communications · doi:10.1038/s41467-018-04316-3 · Cited by 524
“While NEAT has shown some impressive empirical results 20 , in practice, NEAT and, most of its direct variants have dif fi culty scaling due to their very large search space.”
Self-citation
Metadata
- Authors
- Hausknecht, M., Lehman, J., Miikkulainen, R., & Stone, P.
- Venue
- IEEE Transactions on Computational Intelligence and AI in Games
- Published
- 2014-12
- Volume
- 6
- Issue
- 4
- Pages
- 355-366
- ISSN
- 1943-068X (ISSN-L)
- 1943-0698
- OpenAlex
- W2099397840
- Cited by
- 168
- References
- 5
- FWCI
- 18.82
- 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
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 Neuroevolution Approach to General Atari Game Playing. https://app.cochat.ai/papers/10.1109/tciaig.2013.2294713
- The paper
- Hausknecht, M., Lehman, J., Miikkulainen, R., & Stone, P. (2014). A Neuroevolution Approach to General Atari Game Playing. IEEE Transactions on Computational Intelligence and AI in Games. https://doi.org/10.1109/tciaig.2013.2294713
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.