The DOI matches its Crossref record; 41 of the 41 references it cites were found in a registry or an index.
Competitive Coevolution through Evolutionary Complexification
Open accessAbstract
Two major goals in machine learning are the discovery and improvement of solutions to complex problems. In this paper, we argue that complexification, i.e. the incremental elaboration of solutions through adding new structure, achieves both these goals. We demonstrate the power of complexification through the NeuroEvolution of Augmenting Topologies (NEAT) method, which evolves increasingly complex neural network architectures. NEAT is applied to an open-ended coevolutionary robot duel domain where robot controllers compete head to head. Because the robot duel domain supports a wide range of strategies, and because coevolution benefits from an escalating arms race, it serves as a suitable testbed for studying complexification. When compared to the evolution of networks with fixed structure, complexifying evolution discovers significantly more sophisticated strategies. The results suggest that in order to discover and improve complex solutions, evolution, and search in general, should be allowed to complexify as well as optimize.
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
Approximation by superpositions of a sigmoidal function
Cybenko, G. (1989) · Mathematics of Control, Signals, and Systems · doi:10.1007/bf02551274 · Cited by 13,883
Genetic Programming: On the Programming of Computers by Means of Natural Selection
Koza, J. R. (1992) · Medical Entomology and Zoology · Cited by 13,082
Preservation of Duplicate Genes by Complementary, Degenerative Mutations
Force, A., Lynch, M., Pickett, F. B., Amores, A., Yan, Y.-L., & Postlethwait, J. (1999) · Genetics · doi:10.1093/genetics/151.4.1531 · Cited by 3,529
Evolving Neural Networks through Augmenting Topologies
Stanley, K. O., & Miikkulainen, R. (2002) · Evolutionary Computation · doi:10.1162/106365602320169811 · Cited by 3,258
Self-citationEvolving artificial neural networks
Yao, X. (1999) · Proceedings of the IEEE · doi:10.1109/5.784219 · Cited by 2,981
Valen, L. M. V. (1973) · Medical Entomology and Zoology · Cited by 2,448
The Cascade-Correlation learning architecture
Fahlman, S. E., & Lebiere, C. J. (2018) · doi:10.1184/r1/6610403 · Cited by 2,372
Arms races between and within species
Dawkins, R., & Krebs, J. R. (1979) · Proceedings of the Royal Society of London. Series B. Biological Sciences · doi:10.1098/rspb.1979.0081 · Cited by 2,180
Genetic algorithms with sharing for multimodal function optimization
Goldberg, D. E., & Richardson, J. T. (1987) · international conference on Genetic algorithms · Cited by 1,912
Zebrafish hox Clusters and Vertebrate Genome Evolution
Amores, A., Force, A., Yan, Y.-L., Joly, L., Amemiya, C., Fritz, A., Ho, R. K., Langeland, J., Prince, V., Wang, Y.-L., et al. (1998) · Science · doi:10.1126/science.282.5394.1711 · Cited by 1,736
Cited by
A survey on optimization metaheuristics
Boussaïd, I., Lepagnot, J., & Siarry, P. (2013) · Information Sciences · doi:10.1016/j.ins.2013.02.041 · Cited by 1,655
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-citationA Hypercube-Based Encoding for Evolving Large-Scale Neural Networks
Stanley, K. O., D'Ambrosio, D. B., & Gauci, J. (2009) · Artificial Life · doi:10.1162/artl.2009.15.2.15202 · Cited by 780
Self-citationNeuroevolution: from architectures to learning
Floreano, D., Dürr, P., & Mattiussi, C. (2008) · Evolutionary Intelligence · doi:10.1007/s12065-007-0002-4 · Cited by 734
“Neuro-evolution of augmenting topologies (NEAT) has been applied to many problems such as pole balancing [79], robot control [80], computer games [66, 82] or an automobile crash warning system [81].”
MethodCompositional pattern producing networks: A novel abstraction of development
Stanley, K. O. (2007) · Genetic Programming and Evolvable Machines · doi:10.1007/s10710-007-9028-8 · Cited by 713
Self-citationEmergent Tool Use From Multi-Agent Autocurricula
Baker, B., Kanitscheider, I., Markov, T., Wu, Y., Powell, G., McGrew, B., & Mordatch, I. (2019) · arXiv · doi:10.48550/arxiv.1909.07528 · Cited by 424
“Early work explored self-play using genetic algorithms [16, 17, 18, 19].”
BackgroundReal-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-citationPicbreeder: evolving pictures collaboratively online
Secretan, J., Beato, N., D Ambrosio, D. B., Rodriguez, A., Campbell, A., & Stanley, K. O. (2008) · Proceedings of the SIGCHI Conference on Human Factors in Computing Systems · doi:10.1145/1357054.1357328 · Cited by 192
Self-citationBerlin, L. (2005) · American Journal of Roentgenology · doi:10.2214/ajr.05.0651 · Cited by 14
Metadata
- Authors
- Stanley, K. O., & Miikkulainen, R.
- Venue
- Journal of Artificial Intelligence Research
- Publisher
- AI Access Foundation
- Published
- 2004-02-01
- Volume
- 21
- Pages
- 63-100
- ISSN
- 1076-9757 (ISSN-L)
- OpenAlex
- W2169803171
- Cited by
- 413
- References
- 41
- FWCI
- 27.11
- Type
- journal article
- Language
- en
- Open access
- diamond
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.