The DOI matches its Crossref record.
Revising the evolutionary computation abstraction: minimal criteria novelty search
Open accessAbstract
Though based on abstractions of nature, current evolutionary algorithms and artificial life models lack the drive to complexity characteristic of natural evolution. Thus this paper argues that the prevalent fitness-pressure-based abstraction does not capture how natural evolution discovers complexity. Alternatively, this paper proposes that natural evolution can be abstracted as a process that discovers many ways to express the same functionality. That is, all successful organisms must meet the same minimal criteria of survival and reproduction. This abstraction leads to the key idea in this paper: Searching for novel ways of meeting the same minimal criteria, which is an accelerated model of this new abstraction, may be an effective search algorithm. Thus the existing novelty search method, which rewards any new behavior, is extended to enforce minimal criteria. Such minimal criteria novelty search prunes the space of viable behaviors and may often be more efficient than the search for novelty alone. In fact, when compared to the raw search for novelty and traditional fitness-based search in the two maze navigation experiments in this paper, minimal criteria novelty search evolves solutions more consistently. It is possible that refining the evolutionary computation abstraction in this way may lead to solving more ambitious problems and evolving more complex artificial organisms. Copyright 2010 ACM.
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
No references could be resolved yet.
Research works printed but not linked: 38
- 10.1103/PhysRevLett.102.152001 · DOI
- 10.1073/pnas.97.9.4463 · DOI · Paper page
- 10.5555/1732643.1732776 · doi:10.5555/1732643.1732776
- Arthur W. B., 1994, Models and Reality, 65
- 10.1162/106454698568486 · DOI
- 10.1080/002077200406570 · DOI
- Darwin Charles, 1859, Murray
- 10.1111/j.1558-5646.1997.tb03686.x · DOI
- Richard Dawkins. The Selfish Gene. Oxford University Press Oxford UK 3rd edition 1989. Richard Dawkins. The Selfish Gene. Oxford University Press Oxford UK 3rd edition 1989.
- 10.1098/rstb.1988.0062 · DOI · Paper page
- Ficici Sevan, 1998, Proceedings of the Sixth International Conference on Artificial Life, 238
- Gould Steven Jay, 1996, Harmony Books
- Harvey Inman, 1993, University of Sussex
- 10.1006/anbe.1999.1225 · DOI · Paper page
- 10.1162/artl.2008.14.3.14310 · DOI
- Lehman Joel, 2008, Proc. of the Eleventh Intl. Conf. on Artificial Life (ALIFE XI)
- 10.1038/nrg2192 · DOI · Paper page
- 10.1073/pnas.0702207104 · DOI · Paper page
- 10.1086/303231 · DOI
- 10.1007/BF00132234 · DOI · Paper page
- 10.1162/artl.2008.14.3.14307 · DOI
- Tom M. Mitchell. Machine Learning. McGraw-Hill New York 1997. Tom M. Mitchell. Machine Learning. McGraw-Hill New York 1997.
- Mouret Jean-Baptiste, 2009, Proc. of the Workshop on Exploring New Horizons in Evolutionary Design of Robots,2009 IEEE/RSJ Intl Conf on Intelligent Robots and Systems
- Nehaniv C. L., 1999, Mathematical and Computational Biology, 93
- 10.1145/1569901.1569923 · DOI
- Ruse Michael, 1993, Evolution and progress, Tree, 8, 55
- 10.1080/09540090600768658 · DOI · Paper page
- Sigmund Karl, 1993, Inc.
- 10.1145/1569901.1569925 · DOI
- Standish Russell, 2003, Open-ended artificial evolution, Journal of Comp. Intell. and Applications, 3
- 10.1109/TEVC.2005.856210 · DOI · Paper page
- 10.1162/106365602320169811 · DOI · Paper page
- 10.1162/106454603322221487 · DOI · Paper page
- 10.5555/1622467.1622471 · doi:10.5555/1622467.1622471
- Kenneth, 2004, Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2004)
- Watson James D., 1987, Inc.
- 10.5555/1248547.1248578 · doi:10.5555/1248547.1248578
- Zaera N., 1996, Conf. on Sim. of Adaptive Behavior. MIT Press Bradford Books.
Cited by
Learning quadrupedal locomotion over challenging terrain
Lee, J., Hwangbo, J., Wellhausen, L., Koltun, V., & Hutter, M. (2020) · Science Robotics · doi:10.1126/scirobotics.abc5986 · Cited by 1,156
COVID-19 Image Data Collection: Prospective Predictions are the Future
Cohen, J. P., Morrison, P., Dao, L., Roth, K., Duong, T., & Ghassem, M. (2020) · Machine Learning for Biomedical Imaging · doi:10.59275/j.melba.2020-48g7 · Cited by 927
Abandoning Objectives: Evolution Through the Search for Novelty Alone
Lehman, J., & Stanley, K. O. (2011) · Evolutionary Computation · doi:10.1162/evco_a_00025 · Cited by 917
Self-citationLearning quadrupedal locomotion over challenging terrain
Lee, J., Hwangbo, J., Wellhausen, L., Koltun, V., & Hutter, M. (2020) · Repository for Publications and Research Data (ETH Zurich) · doi:10.3929/ethz-b-000448343 · Cited by 752
Quality 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-citation
Metadata
- Authors
- Lehman, J., & Stanley, K. O.
- Venue
- Proceedings of the 12th annual conference on Genetic and evolutionary computation
- Publisher
- ACM
- Published
- 2010-07-07
- Pages
- 103-110
- OpenAlex
- W2150333870
- Cited by
- 177
- References
- 0
- FWCI
- 5.20
- Type
- conference paper
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Revising the evolutionary computation abstraction: minimal criteria novelty search. https://app.cochat.ai/papers/10.1145/1830483.1830503
- The paper
- Lehman, J., & Stanley, K. O. (2010). Revising the evolutionary computation abstraction: minimal criteria novelty search. Proceedings of the 12th annual conference on Genetic and evolutionary computation. https://doi.org/10.1145/1830483.1830503
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.