The DOI matches its Crossref record; 91 of the 91 references it cites were found in a registry or an index.
Abandoning Objectives: Evolution Through the Search for Novelty Alone
Open accessAbstract
In evolutionary computation, the fitness function normally measures progress toward an objective in the search space, effectively acting as an objective function. Through deception, such objective functions may actually prevent the objective from being reached. While methods exist to mitigate deception, they leave the underlying pathology untreated: Objective functions themselves may actively misdirect search toward dead ends. This paper proposes an approach to circumventing deception that also yields a new perspective on open-ended evolution. Instead of either explicitly seeking an objective or modeling natural evolution to capture open-endedness, the idea is to simply search for behavioral novelty. Even in an objective-based problem, such novelty search ignores the objective. Because many points in the search space collapse to a single behavior, the search for novelty is often feasible. Furthermore, because there are only so many simple behaviors, the search for novelty leads to increasing complexity. By decoupling open-ended search from artificial life worlds, the search for novelty is applicable to real world problems. Counterintuitively, in the maze navigation and biped walking tasks in this paper, novelty search significantly outperforms objective-based search, suggesting the strange conclusion that some problems are best solved by methods that ignore the objective. The main lesson is the inherent limitation of the objective-based paradigm and the unexploited opportunity to guide search through other means.
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
Holland, J. H. (1992) · The MIT Press eBooks · doi:10.7551/mitpress/1090.001.0001 · Cited by 47,002
Optimization by Simulated Annealing
Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983) · Science · doi:10.1126/science.220.4598.671 · Cited by 45,134
Philosophical transactions of the Royal Society of London. B
Press, H. (1886) · Cited by 10,080
The Neutral Theory of Molecular Evolution
Kimura, M. (1979) · Scientific American · doi:10.1038/scientificamerican1179-98 · Cited by 7,666
The origins of order; self organization and selection in evolution
(1994) · International Journal of Biochemistry · doi:10.1016/0020-711x(94)90119-8 · Cited by 6,649
Glover, F. (1990) · ORSA Journal on Computing · doi:10.1287/ijoc.2.1.4 · Cited by 5,647
Glover, F. (1989) · ORSA Journal on Computing · doi:10.1287/ijoc.1.3.190 · Cited by 5,106
Evolving Neural Networks through Augmenting Topologies
Stanley, K. O., & Miikkulainen, R. (2002) · Evolutionary Computation · doi:10.1162/106365602320169811 · Cited by 3,258
Self-citationArtificial Intelligence through Simulated Evolution
Fogel, L. J., Owens, A. J., & Walsh, M. J. (1966) · International Linear Collider · Cited by 2,796
Watson, J. D. (1970) · Cold Spring Harbor Laboratory Institutional Repository (Cold Spring Harbor Laboratory) · Cited by 2,062
Cited by
Four concepts for resilience and the implications for the future of resilience engineering
Woods, D. D. (2015) · Reliability Engineering & System Safety · doi:10.1016/j.ress.2015.03.018 · Cited by 880
Information-seeking, curiosity, and attention: computational and neural mechanisms
Gottlieb, J., Oudeyer, P.-Y., Lopes, M., & Baranes, A. (2013) · Trends in Cognitive Sciences · doi:10.1016/j.tics.2013.09.001 · Cited by 784
Designing 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-citationNanoparticle synthesis assisted by machine learning
Tao, H., Wu, T., Aldeghi, M., Wu, T. C., Aspuru-Guzik, A., & Kumacheva, E. (2021) · Nature Reviews Materials · doi:10.1038/s41578-021-00337-5 · Cited by 545
Exploration in deep reinforcement learning: A survey
Ladosz, P., Weng, L., Kim, M., & Oh, H. (2022) · Information Fusion · doi:10.1016/j.inffus.2022.03.003 · Cited by 525
“One of the earliest methods called novelty search was devised in [74] and [75].”
BackgroundMethodSuch, F. P., Madhavan, V., Conti, E., Lehman, J., Stanley, K. O., & Clune, J. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1712.06567 · Cited by 525
Self-citationQuality Diversity: A New Frontier for Evolutionary Computation
Pugh, J. K., Soros, L. B., & Stanley, K. O. (2016) · Frontiers in Robotics and AI · doi:10.3389/frobt.2016.00040 · Cited by 514
Self-citationThe evolutionary origins of modularity
Clune, J., Mouret, J.-B., & Lipson, H. (2013) · Proceedings of the Royal Society B: Biological Sciences · doi:10.1098/rspb.2012.2863 · Cited by 466
Intrinsic motivation, curiosity, and learning
Oudeyer, P.-Y., Gottlieb, J., & Lopes, M. (2016) · Progress in Brain Research · doi:10.1016/bs.pbr.2016.05.005 · Cited by 387
Illuminating search spaces by mapping elites
Mouret, J.-B., & Clune, J. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1504.04909 · Cited by 386
Evolving a diversity of virtual creatures through novelty search and local competition
Lehman, J., & Stanley, K. O. (2011) · Proceedings of the 13th annual conference on Genetic and evolutionary computation · doi:10.1145/2001576.2001606 · Cited by 385
Self-citationEcoffet, A., Huizinga, J., Lehman, J., Stanley, K. O., & Clune, J. (2021) · Nature · doi:10.1038/s41586-020-03157-9 · Cited by 330
Self-citationEvolutionary Robotics: What, Why, and Where to
Doncieux, S., Bredeche, N., Mouret, J.-B., & Eiben, A. E. (. (2015) · Frontiers in Robotics and AI · doi:10.3389/frobt.2015.00004 · Cited by 275
Bongard, J. C. (2013) · Communications of the ACM · doi:10.1145/2492007.2493883 · Cited by 260
Quality and Diversity Optimization: A Unifying Modular Framework
Cully, A., & Demiris, Y. (2018) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2017.2704781 · Cited by 258
Encouraging Behavioral Diversity in Evolutionary Robotics: An Empirical Study
Mouret, J.-B., & Doncieux, S. (2012) · Evolutionary Computation · doi:10.1162/evco_a_00048 · Cited by 257
Deep problems with neural network models of human vision
Bowers, J. S., Malhotra, G., Dujmović, M., Llera Montero, M., Tsvetkov, C., Biscione, V., Puebla, G., Adolfi, F., Hummel, J. E., Heaton, R. F., et al. (2023) · Behavioral and Brain Sciences · doi:10.1017/s0140525x22002813 · Cited by 204
Lehman, J., Clune, J., Misevic, D., Adami, C., Altenberg, L., Beaulieu, J., Bentley, P. J., Bernard, S., Beslon, G., Bryson, D. M., et al. (2020) · Artificial Life · doi:10.1162/artl_a_00319 · Cited by 181
“The surprise inspired Stanley to conceive the novelty search algorithm [107], which searches without an explicit objective (just as Stanley found the car unintentionally), selecting instead the most different, novel outcomes at each evolution step.”
Self-citationAutomatic Design of Robot Swarms: Achievements and Challenges
Francesca, G., & Birattari, M. (2016) · Frontiers in Robotics and AI · doi:10.3389/frobt.2016.00029 · Cited by 144
Evolution of Collective Behaviors for a Real Swarm of Aquatic Surface Robots
Duarte, M., Costa, V., Gomes, J., Rodrigues, T., Silva, F., Oliveira, S. M., & Christensen, A. L. (2016) · PLOS ONE · doi:10.1371/journal.pone.0151834 · Cited by 134
The evolutionary origins of hierarchy
Mengistu, H., Huizinga, J., Mouret, J.-B., & Clune, J. (2016) · PLOS Computational Biology · doi:10.1371/journal.pcbi.1004829 · Cited by 115
Open-Ended Evolution: Perspectives from the OEE Workshop in York
Taylor, T., Bedau, M., Channon, A., Ackley, D., Banzhaf, W., Beslon, G., Dolson, E., Froese, T., Hickinbotham, S., Ikegami, T., et al. (2016) · Artificial Life · doi:10.1162/artl_a_00210 · Cited by 111
Self-citationAutoMoDe-Chocolate: automatic design of control software for robot swarms
Francesca, G., Brambilla, M., Brutschy, A., Garattoni, L., Miletitch, R., Podevijn, G., Reina, A., Soleymani, T., Salvaro, M., Pinciroli, C., et al. (2015) · Swarm Intelligence · doi:10.1007/s11721-015-0107-9 · Cited by 99
Clune, J. (2019) · arXiv · doi:10.48550/arxiv.1905.10985 · Cited by 82
“…ambitious problems, even if you have a way to quantifiably measure what success looks like, optimizing for that score is unlikely to produce the correct path through the search space to find the global optimum, and instead usually results in getting trapped on a local optima [166, 92, 196, 123].”
BackgroundInfluentialA curious formulation robot enables the discovery of a novel protocell behavior
Grizou, J., Points, L. J., Sharma, A., & Cronin, L. (2020) · Science Advances · doi:10.1126/sciadv.aay4237 · Cited by 77
Language Model Crossover: Variation through Few-Shot Prompting
Meyerson, E., Nelson, M. J., Bradley, H., Gaier, A., Moradi, A., Hoover, A. K., & Lehman, J. (2024) · ACM Transactions on Evolutionary Learning and Optimization · doi:10.1145/3694791 · Cited by 75
“In conclusion, there are likely many creative ways to beneficially combine various models together that this paper leaves unexplored; evolution in general is a powerful and easy-to-implement way to quickly explore such possibilities, and LMX in particular is a promising and simple way of…”
Self-citationLanguage model crossover: Variation through few-shot prompting
Meyerson, E., Nelson, M. J., Bradley, H., Gaier, A., Moradi, A., Hoover, A. K., & Lehman, J. (2023) · arXiv · doi:10.48550/arxiv.2302.12170 · Cited by 75
Self-citationEvolution Through Large Models
Lehman, J., Gordon, J., Jain, S., Ndousse, K., Yeh, C., & Stanley, K. O. (2024) · Genetic and Evolutionary Computation · doi:10.1007/978-981-99-3814-8_11 · Cited by 74
Self-citationEvolution through Large Models
Lehman, J., Gordon, J., Jain, S., Ndousse, K., Yeh, C., & Stanley, K. O. (2022) · arXiv · doi:10.48550/arxiv.2206.08896 · Cited by 74
Self-citationSchrum, J., Gutierrez, J., Volz, V., Liu, J., Lucas, S., & Risi, S. (2020) · Proceedings of the 2020 Genetic and Evolutionary Computation Conference · doi:10.1145/3377930.3389821 · Cited by 63
POET: open-ended coevolution of environments and their optimized solutions
Wang, R., Lehman, J., Clune, J., & Stanley, K. O. (2019) · Proceedings of the Genetic and Evolutionary Computation Conference · doi:10.1145/3321707.3321799 · Cited by 61
Self-citationWang, R., Lehman, J., Rawal, A., Zhi, J., Li, Y., Clune, J., & Stanley, K. O. (2020) · arXiv · doi:10.48550/arxiv.2003.08536 · Cited by 53
Self-citationHuizinga, J., & Clune, J. (2022) · Evolutionary Computation · doi:10.1162/evco_a_00301 · Cited by 20
General intelligence requires rethinking exploration
Jiang, M., Rocktäschel, T., & Grefenstette, E. (2022) · arXiv · doi:10.48550/arxiv.2211.07819 · Cited by 17
Multi-task curriculum learning in a complex, visual, hard-exploration domain: Minecraft
Kanitscheider, I., Huizinga, J., Farhi, D., Guss, W. H., Houghton, B., Sampedro, R., Zhokhov, P., Baker, B., Ecoffet, A., Tang, J., et al. (2021) · arXiv · doi:10.48550/arxiv.2106.14876 · Cited by 9
Automated Design of Agentic Systems
Hu, S., Lu, C., & Clune, J. (2024) · arXiv · doi:10.48550/arxiv.2408.08435 · Cited by 10
“As is critical in prior works on open-endedness and AI-GAs (Zhang et al., 2024a; Faldor et al., 2024; Wang et al., 2019; 2020; Lehman & Stanley, 2011), Meta Agent Search innovates based on a growing archive of previous stepping stones.”
DarwinX: Evolving Agent Harnesses Through Natural Selection
Zhang, Y., Dai, Y., Tan, J., Yang, L., Mullur, R., Hoang, T., Hu, Z., Zhu, J., Mui, P., Savarese, S., et al. (2026) · arXiv · doi:10.48550/arxiv.2608.07545 · Cited by 1
“An adjacent line evolves task-solution programs rather than agents [25, 35, 38], building on quality-diversity and open-ended search [13, 24, 33, 46] and contributing the archive and cascade machinery agent evolution inherits, but presuming a deterministic fitness signal that agentic benchmarks do…”
Kinetix: Investigating the Training of General Agents through Open-Ended Physics-Based Control Tasks
Matthews, M., Beukman, M., Lu, C., & Foerster, J. (2024) · arXiv · doi:10.48550/arxiv.2410.23208 · Cited by 1
“Car-Ramp is an example of a deceptive problem (Goldberg, 1987; Liepins & Vose, 1991; Lehman & Stanley, 2011) that requires the agent to first move away from the goal (and incur a negative reward) to obtain enough momentum to jump the gap.”
Improving Environment Novelty Quantification for Effective Unsupervised Environment Design
Teoh, J., Li, W., & Varakantham, P. (2025) · arXiv
“Traditionally, learning without extrinsic rewards or fitness functions has been studied in evolutionary computation where it is referred to as ‘novelty search’ [30, 31].”
Automated Discovery Has No Universally Superior Harness
Gupta, A., Lei, J., Lu, A., Anumanchipalli, G., & Choshen, L. (2026) · arXiv · doi:10.48550/arxiv.2607.18235
Improving Environment Novelty Quantification for Effective Unsupervised Environment Design
Teoh, J., Li, W., & Varakantham, P. (2024) · Advances in Neural Information Processing Systems 37 · doi:10.52202/079017-4300
At Equal Inference Cost, Multi-Agent Structure Does Not Beat a Single Frozen Agent
Dylan, D., Brennan, A., Murphy, C., O'Sullivan, N., Kelly, C., & Walsh, S. (2026) · arXiv · doi:10.48550/arxiv.2609.04217 · Cited by 3
ShinkaEvolve: Towards Open-Ended And Sample-Efficient Program Evolution
Lange, R. T., Imajuku, Y., & Cetin, E. (2025) · arXiv · doi:10.48550/arxiv.2509.19349
Wang, R., Lehman, J., Clune, J., & Stanley, K. O. (2019) · arXiv
Self-citation
Metadata
- Authors
- Lehman, J., & Stanley, K. O.
- Venue
- Evolutionary Computation
- Publisher
- MIT Press - Journals
- Published
- 2011-06
- Volume
- 19
- Issue
- 2
- Pages
- 189-223
- ISSN
- 1063-6560 (ISSN-L)
- 1530-9304
- OpenAlex
- W2151083897
- Cited by
- 917
- References
- 91
- FWCI
- 30.27
- Type
- journal article
- Language
- en
- Open access
- green
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.