Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat

The DOI matches its Crossref record; 39 of the 39 references it cites were found in a registry or an index.

POET: open-ended coevolution of environments and their optimized solutions

Open access
Wang, Rui, Lehman, Joel, Clune, Jeff, Stanley, Kenneth O. · 2019 · Proceedings of the Genetic and Evolutionary Computation Conference

Abstract

How can progress in machine learning and reinforcement learning be automated to generate its own never-ending curriculum of challenges without human intervention? The recent emergence of quality diversity (QD) algorithms offers a glimpse of the potential for such continual open-ended invention. For example, novelty search showcases the benefits of explicit novelty pressure, MAP-Elites and Innovation Engines highlight the advantage of explicit elitism within niches in an otherwise divergent process, and minimal criterion coevolution (MCC) reveals that problems and solutions can coevolve divergently. The Paired Open-Ended Trailblazer (POET) algorithm introduced in this paper combines these principles to produce a practical approach to generating an endless progression of diverse and increasingly challenging environments while at the same time explicitly optimizing their solutions. An intriguing implication is the opportunity to transfer solutions among environments, reflecting the view that innovation is a circuitous and unpredictable process. POET is tested in a 2-D obstacles course domain, where it generates diverse and sophisticated behaviors that create and solve a wide range of environmental challenges, many of which cannot be solved by direct optimization, or by a direct-path curriculum-building control algorithm. We hope that POET will inspire a new push towards open-ended discovery across many domains.

Overview

Integrity signals

Registry

Crossref · 10.1145/3321707.3321799

Cites

39 of 39 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

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?

Citations

Cites

Show all 35 references

Research works printed but not linked: 25

  1. Bedau Mark, 2008, Proceedings of the Eleventh International Conference on Artificial Life (Alife XI), Seth Bullock, Jason Noble, Richard Watson, and Mark Bedau (Eds.). MIT Press
  2. Brockman Greg, 2016, arXiv:arXiv:1606.01540 · arXiv
  3. Florensa Carlos, 2018, International Conference on Machine Learning. 1514--1523
  4. Florensa Carlos, 2017, Proceedings of the 1st Annual Conference on Robot Learning. 482--495
  5. Forestier Sébastien, 2017, Intrinsically motivated goal exploration processes with automatic curriculum learning. arXiv preprint arXiv:1708.02190 · arXiv
  6. Gupta Abhishek, 2018, Unsupervised Meta-Learning for Reinforcement Learning. arXiv
  7. David Ha., 2018, Reinforcement Learning for Improving Agent Design. arXiv preprint arXiv:1810.03779 · arXiv
  8. Heess Nicolas, 2017, Emergence of Locomotion Behaviours in Rich Environments. CoRR abs/1707.02286 · arXiv
  9. Justesen Niels, 2018, Philip Bontrager, Ahmed Khalifa, Julian Togelius, and Sebastian Risi.
  10. Kingma Diederik, 2014, Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980 · arXiv
  11. Langdon W. B., 2005, Pfeiffer - A Distributed Open-ended Evolutionary System. In AISB'05: Proceedings of the Joint Symposium on Socially Inspired Computing (METAS 2005
  12. Lehman Joel, 2011, Stanley
  13. Matiisen Tambet, 2017, Teacher-Student Curriculum Learning. arXiv preprint arXiv:1707.00183 · arXiv
  14. Mnih Volodymyr, 2016, Mehdi Mirza, Alex Graves, Timothy Lillicrap, Tim Harley, David Silver, and Koray Kavukcuoglu.
  15. Mouret Jean-Baptiste, 2015, Illuminating search spaces by mapping elites. arXiv preprint arXiv:1504.04909 · arXiv
  16. Popovici Elena, 2012, De Jong
  17. Pugh Justin K, 2016, Stanley
  18. Salimans Tim, 2017, Evolution strategies as a scalable alternative to reinforcement learning. arXiv preprint arXiv:1703.03864 · arXiv
  19. Savinov Nikolay, 2018, EPISODIC CURIOSITY THROUGH REACHABILITY. arXiv preprint arXiv:1810.0227
  20. Schmidhuber Jürgen, 2013, Powerplay: Training an increasingly general problem solver by continually searching for the simplest still unsolvable problem. Frontiers in psychology 4
  21. Schulman John, 2015, International Conference on Machine Learning. 1889--1897
  22. Soros L.B., 2016, How the Strictness of the Minimal Criterion Impacts Open-Ended Evolution. In ALIFE 15: The Fifteenth International Conference on the Synthesis and Simulation of Living Systems. 208--215
  23. Stanley Kenneth O., 2017, Open-endedness: The last grand challenge you've never heard of. O'Reilly Online
  24. Wiegand R. Paul, Proceedings of the 3rd Annual Conference on Genetic and Evolutionary Computation (GECCO'01)
  25. Zhang Xingwen, 2017, Stanley

Cited by

See all 64

Metadata

Authors
Wang, R., Lehman, J., Clune, J., & Stanley, K. O.
Affiliations
Uber AI (United States) (US)
Venue
Proceedings of the Genetic and Evolutionary Computation Conference
Publisher
ACM
Published
2019-07-13
Pages
142-151
OpenAlex
W2954700257
Cited by
61
References
35
Citations by year
2026: 4 · 2025: 4 · 2024: 12 · 2023: 8 · 2022: 11 · 2021: 9 · 2020: 10 · 2019: 3
FWCI
3.16
Type
conference paper
Language
en
Open access
Locations
Genetic and Evolutionary Computation Conference (GECCO) (publishedVersion)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Evolutionary Algorithms and Applications
  • Physical Sciences › Computer Science › Artificial Intelligence › Reinforcement Learning in Robotics
  • Life Sciences › Biochemistry, Genetics and Molecular Biology › Genetics › Evolution and Genetic Dynamics
Keywords
open-endedness, quality diversity, novelty search, MAP-Elites, environment generation, solution transfer, reinforcement learning

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: POET: open-ended coevolution of environments and their optimized solutions. https://app.cochat.ai/papers/10.1145/3321707.3321799
The paper
Wang, R., Lehman, J., Clune, J., & Stanley, K. O. (2019). POET: open-ended coevolution of environments and their optimized solutions. Proceedings of the Genetic and Evolutionary Computation Conference. https://doi.org/10.1145/3321707.3321799

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.