The DOI matches its Crossref record; 90 of the 90 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
Genetic algorithms with sharing for multimodal function optimization
Goldberg, D. E., & Richardson, J. T. (1987) · international conference on Genetic algorithms · Cited by 1,912
Multi-objective Genetic Algorithms: Problem Difficulties and Construction of Test Problems
Deb, K. (1999) · Evolutionary Computation · doi:10.1162/evco.1999.7.3.205 · Cited by 1,451
Multiobjective Evolutionary Algorithms: Analyzing the State-of-the-Art
Veldhuizen, D. A. V., & Lamont, G. B. (2000) · Evolutionary Computation · doi:10.1162/106365600568158 · Cited by 1,201
Messy genetic algorithms: motivation, analysis, and first results
Goldberg, D. E., Korb, B., & Deb, K. (1989) · Complex Systems · Cited by 1,127
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
Niching methods for genetic algorithms
Mahfoud, S. W. (1996) · Cited by 897
Classes of recursively enumerable sets and their decision problems
Rice, H. G. (1953) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-1953-0053041-6 · Cited by 869
The frailty of adaptive hypotheses for the origins of organismal complexity
Lynch, M. (2007) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0702207104 · Cited by 817
Evolving 3D Morphology and Behavior by Competition
Sims, K. (1994) · Artificial Life · doi:10.1162/artl.1994.1.353 · Cited by 800
Evolutionary computation: a unified approach
De Jong, K. (2007) · Proceedings of the 9th annual conference companion on Genetic and evolutionary computation · doi:10.1145/1274000.1274109 · Cited by 790
Evolution of biological complexity
Adami, C., Ofria, C., & Collier, T. C. (2000) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.97.9.4463 · Cited by 596
Full House: The Spread of Excellence from Plato to Darwin
Gould, S. J. (1996) · DigitalGeorgetown (Georgetown University Library) · doi:10.4159/harvard.9780674063396 · Cited by 589
Correlated and uncorrelated fitness landscapes and how to tell the difference
Weinberger, E. (1990) · Biological Cybernetics · doi:10.1007/bf00202749 · Cited by 561
Representations for Genetic and Evolutionary Algorithms
(2006) · Springer eBooks · doi:10.1007/3-540-32444-5 · Cited by 470
Fitness Distance Correlation as a Measure of Problem Difficulty for Genetic Algorithms
Jones, T., & Forrest, S. (1995) · Cited by 469
Co-evolving parasites improve simulated evolution as an optimization procedure
Hillis, W. D. (1991) · Cited by 447
The royal road for genetic algorithms: Fitness landscapes and GA performance
Mitchell, M., Forrest, S., & Holland, J. H. (1991) · OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) · Cited by 446
Incremental Evolution of Complex General Behavior
Gomez, F., & Miikkulainen, R. (1997) · Adaptive Behavior · doi:10.1177/105971239700500305 · Cited by 428
A Taxonomy for Artificial Embryogeny
Stanley, K. O., & Miikkulainen, R. (2003) · Artificial Life · doi:10.1162/106454603322221487 · Cited by 425
Self-citationCompetitive Coevolution through Evolutionary Complexification
Stanley, K. O., & Miikkulainen, R. (2004) · Journal of Artificial Intelligence Research · doi:10.1613/jair.1338 · Cited by 413
Self-citationExploiting Open-Endedness to Solve Problems Through the Search for Novelty
Lehman, J., & Stanley, K. O. (2008) · Cited by 408
Self-citationFrequency-dependent predation, crypsis and aposematic coloration
Endler, J. A. (1988) · Philosophical Transactions of the Royal Society of London. B, Biological Sciences · doi:10.1098/rstb.1988.0062 · Cited by 390
Real-Time Neuroevolution in the NERO Video Game
Stanley, K. O., Bryant, B. D., & Miikkulainen, R. (2005) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2005.856210 · Cited by 390
Self-citationReducing Local Optima in Single-Objective Problems by Multi-objectivization
Knowles, J. D., Watson, R. A. R., & Corne, D. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44719-9_19 · Cited by 345
The evolution of genetic networks by non-adaptive processes
Lynch, M. (2007) · Nature Reviews Genetics · doi:10.1038/nrg2192 · Cited by 310
Simple Genetic Algorithms and the Minimal, Deceptive Problem
Goldberg, D. E. (1987) · Medical Entomology and Zoology · Cited by 297
Familiarity leads to female mate preference for novel males in the guppy, Poecilia reticulata
HUGHES, K. A., DU, L., RODD, F. H., & REZNICK, D. N. (1999) · Animal Behaviour · doi:10.1006/anbe.1999.1225 · Cited by 271
Complexity and evolution: What everybody knows
McShea, D. W. (1991) · Biology & Philosophy · doi:10.1007/bf00132234 · Cited by 268
Developmental robotics, optimal artificial curiosity, creativity, music, and the fine arts
Schmidhuber, J. (2006) · Connection Science · doi:10.1080/09540090600768658 · Cited by 268
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
Evolutionary Function Approximation for Reinforcement Learning
Whiteson, S., & Stone, P. (2006) · Cited by 231
ALPS: the age-layered population structure for reducing the problem of premature convergence
Hornby, G. S. (2006) · Proceedings of the 8th annual conference on Genetic and evolutionary computation · doi:10.1145/1143997.1144142 · Cited by 230
Tracking the red queen: Measurements of adaptive progress in co-evolutionary simulations
Cliff, D., & Miller, G. F. (1995) · Lecture notes in computer science · doi:10.1007/3-540-59496-5_300 · Cited by 221
Exploring phenotype space through neutral evolution
Huynen, M. A. (1996) · Journal of Molecular Evolution · doi:10.1007/bf02338823 · Cited by 214
Biped dynamic walking using reinforcement learning
Benbrahim, H., & Franklin, J. A. (1997) · Robotics and Autonomous Systems · doi:10.1016/s0921-8890(97)00043-2 · Cited by 198
Evolution of central pattern generators for bipedal walking in a real-time physics environment
Reil, T., & Husbands, P. (2002) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.996015 · Cited by 180
Revising the evolutionary computation abstraction: minimal criteria novelty search
Lehman, J., & Stanley, K. O. (2010) · Proceedings of the 12th annual conference on Genetic and evolutionary computation · doi:10.1145/1830483.1830503 · Cited by 177
Self-citationCoevolutionary dynamics in a minimal substrate
Watson, R. A. R., & Pollack, J. B. (2001) · ePrints Soton (University of Southampton) · Cited by 158
Network Random Keys—A Tree Representation Scheme for Genetic and Evolutionary Algorithms
Rothlauf, F., Goldberg, D. E., & Heinzl, A. (2002) · Evolutionary Computation · doi:10.1162/106365602317301781 · Cited by 158
Novelty-Based Multiobjectivization
Mouret, J.-B. (2011) · Studies in computational intelligence · doi:10.1007/978-3-642-18272-3_10 · Cited by 139
Deception Considered Harmful* *With apologies to Edsger Dijkstra (Dijkstra, 1968).
Grefenstette, J. J. (1993) · Foundations of genetic algorithms · doi:10.1016/b978-0-08-094832-4.50011-8 · Cited by 135
Ficici, S. G., & Pollack, J. B. (1998) · Cited by 131
Evolutionary Optimization: Pitfalls and Booby Traps
Weise, T., Chiong, R., & Tang, K. (2012) · Journal of Computer Science and Technology · doi:10.1007/s11390-012-1274-4 · Cited by 127
Through the labyrinth evolution finds a way: A silicon ridge
Harvey, I. R., & Thompson, A. (1997) · Lecture notes in computer science · doi:10.1007/3-540-63173-9_62 · Cited by 126
Bedau, M. A. (1998) · Artificial Life · doi:10.1162/106454698568486 · Cited by 112
Environment-driven distributed evolutionary adaptation in a population of autonomous robotic agents
Bredèche, N., Montanier, J.-M., Liu, W., & Winfield, A. F. T. (2011) · Mathematical and Computer Modelling of Dynamical Systems · doi:10.1080/13873954.2011.601425 · Cited by 107
Efficiently evolving programs through the search for novelty
Lehman, J., & Stanley, K. O. (2010) · Genetic and Evolutionary Computation Conference (GECCO) · doi:10.1145/1830483.1830638 · Cited by 103
Self-citationThe Hierarchical Fair Competition (HFC) Framework for Sustainable Evolutionary Algorithms
Hu, J., Goodman, E. D., Seo, K., Fan, Z., & Rosenberg, R. C. (2005) · Evolutionary Computation · doi:10.1162/1063656054088530 · Cited by 103
Increasing Genomic Complexity by Gene Duplication and the Origin of Vertebrates
Martin, A. P. (1999) · The American Naturalist · doi:10.1086/303231 · Cited by 100
An empirical study of genetic operators in genetic algorithms
Yao, X. (1993) · Microprocessing and Microprogramming · doi:10.1016/0165-6074(93)90215-7 · Cited by 98
OPEN-ENDED ARTIFICIAL EVOLUTION
Standish, R. K. (2003) · International Journal of Computational Intelligence and Applications · doi:10.1142/s1469026803000914 · Cited by 93
Coevolution of A Backgammon Player
Pollack, J. B., Blair, A., & Land, M. (1996) · Cited by 91
Netcrawling-optimal evolutionary search with neutral networks
Barnett, L. (2002) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2001.934367 · Cited by 89
Sustaining diversity using behavioral information distance
Gomez, F. J. (2009) · Genetic and Evolutionary Computation Conference (GECCO) · doi:10.1145/1569901.1569918 · Cited by 83
Multi-Objective Methods for Tree Size Control
de Jong, E. D., & Pollack, J. B. (2003) · Genetic Programming and Evolvable Machines · doi:10.1023/a:1025122906870 · Cited by 82
How novelty search escapes the deceptive trap of learning to learn
Risi, S., Vanderbleek, S. D., Hughes, C. E., & Stanley, K. O. (2009) · Genetic and Evolutionary Computation Conference (GECCO) · doi:10.1145/1569901.1569923 · Cited by 81
Self-citationThe Playground Experiment: Task-Independent Development of a Curious Robot
Oudeyer, P., Hafner, V. V., & Whyte, A. (2005) · Cited by 75
The Incremental Pareto-Coevolution Archive
de Jong, E. D. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-24854-5_55 · Cited by 73
Risi, S., & Stanley, K. O. (2012) · Artificial Life · doi:10.1162/artl_a_00071 · Cited by 71
Self-citationMeasurement of the Top-Quark Mass with Dilepton Events Selected Using Neuroevolution at CDF
Aaltonen, T., Adelman, J., AKIMOTO, T., Albrow, M. G., González, B. Á., Amerio, S., Amidei, D., Anastassov, A., Annovi, A., Antoš, J., et al. (2009) · Physical Review Letters · doi:10.1103/physrevlett.102.152001 · Cited by 67
Schmidhuber, J. (2003) · Natural Computing Series · doi:10.1007/978-3-642-18965-4_23 · Cited by 65
Guided Optimization for Balanced Locomotion
van de Panne, M., & Lamouret, A. (1995) · Eurographics · doi:10.1007/978-3-7091-9435-5_13 · Cited by 64
Hutter, M., & Legg, S. (2006) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2005.863127 · Cited by 63
Combating Coevolutionary Disengagement by Reducing Parasite Virulence
Cartlidge, J., & Bullock, S. (2004) · Evolutionary Computation · doi:10.1162/106365604773955148 · Cited by 62
(Not) Evolving Collective Behaviours in Synthetic Fish
Zaera, N., Cliff, D., & Bruten, J. (1996) · The MIT Press eBooks · doi:10.7551/mitpress/3118.003.0076 · Cited by 59
Neuromodulated Control of Bipedal Locomotion Using a Polymorphic CPG Circuit
Ishiguro, A., Fujii, A., & Hotz, P. E. (2003) · Adaptive Behavior · doi:10.1177/10597123030111001 · Cited by 51
Improving evolvability through novelty search and self-adaptation
Lehman, J., & Stanley, K. O. (2011) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2011.5949955 · Cited by 50
Self-citationManning, T., Sleator, R. D., & Walsh, P. (2013) · Bioengineered · doi:10.4161/bioe.23041 · Cited by 48
Towards the evolutionary emergence of increasingly complex advantageous behaviours
Channon, A., & Damper, R. I. (2000) · International Journal of Systems Science · doi:10.1080/002077200406570 · Cited by 45
Evolution and Complexity: The Double-Edged Sword
Miconi, T. (2008) · Artificial Life · doi:10.1162/artl.2008.14.3.14307 · Cited by 43
Lopes, M. C., & Oudeyer, P. (2010) · IEEE Transactions on Autonomous Mental Development · doi:10.1109/tamd.2010.2052419 · Cited by 37
GasNets and other evovalble neural networks applied to bipedal locomotion
Husbands, P., & McHale, G. (2004) · Figshare · Cited by 30
Evolving team behaviors with specialization
Nitschke, G., Eiben, A. E., & Schut, M. C. (2012) · Genetic Programming and Evolvable Machines · doi:10.1007/s10710-012-9166-5 · Cited by 27
Complex networks of simple neurons for bipedal locomotion
Allen, B. F., & Faloutsos, P. (2009) · IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros.2009.5354077 · Cited by 23
Novelty of behaviour as a basis for the neuro-evolution of operant reward learning
Soltoggio, A., & Jones, B. (2009) · Genetic and Evolutionary Computation Conference (GECCO) · doi:10.1145/1569901.1569925 · Cited by 21
Information-theoretic framework for unsupervised activity classification
Kaplan, F., & Hafner, V. V. (2006) · Advanced Robotics · doi:10.1163/156855306778522514 · Cited by 19
Full Body: The Importance of the Phenotype in Evolution
Kampis, G., & Gulyás, L. (2008) · Artificial Life · doi:10.1162/artl.2008.14.3.14310 · Cited by 11
Exploring Phenotype Space Through Neutral EvolutionPreprint
Huyen, M. (1995) · RePEc: Research Papers in Economics · Cited by 10
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].”
BackgroundMethod
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
- 90
- 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.