The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Coevolutionary Computation
Abstract
This article proposes a general framework for the use of coevolution to boost the performance of genetic search. It combines coevolution with yet another biologically inspired technique, called lifetime fitness evaluation (LTFE). Two unrelated problems--neural net learning and constraint satisfaction--are used to illustrate the approach. Both problems use predator-prey interactions to boost the search. In contrast with traditional "single population" genetic algorithms (GAs), two populations constantly interact and co-evolve. However, the same algorithm can also be used with different types of co-evolutionary interactions. As an example, the symbiotic coevolution of solutions and genetic representations is shown to provide an elegant solution to the problem of finding a suitable genetic representation. The approach presented here greatly profits from the partial and continuous nature of LTFE. Noise tolerance is one advantage. Even more important, LTFE is ideally suited to deal with coupled fitness landscapes typical for coevolution.
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
Co-evolving parasites improve simulated evolution as an optimization procedure
Hillis, W. D. (1990) · Physica D: Nonlinear Phenomena · doi:10.1016/0167-2789(90)90076-2 · Cited by 780 · cited 1×
“2”
Cited by
Parameter control in evolutionary algorithms
Eiben, A. E., Hinterding, R., & Michalewicz, Z. (1999) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.771166 · Cited by 1,980
Single- and multiobjective evolutionary optimization assisted by Gaussian random field metamodels
Emmerich, M. T. M., Giannakoglou, K. C., & Naujoks, B. (2006) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2005.859463 · Cited by 759
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
Emergent 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
Forming Neural Networks Through Efficient and Adaptive Coevolution
Moriarty, D. E., & Miikkulainen, R. (1997) · Evolutionary Computation · doi:10.1162/evco.1997.5.4.373 · Cited by 304
Fazzolari, M., Alcala, R., Nojima, Y., Ishibuchi, H., & Herrera, F. (2013) · IEEE Transactions on Fuzzy Systems · doi:10.1109/tfuzz.2012.2201338 · Cited by 296
Metadata
- Authors
- Paredis, J.
- Venue
- Artificial Life
- Publisher
- MIT Press
- Published
- 1995-01
- Volume
- 2
- Issue
- 4
- Pages
- 355-375
- ISSN
- 1064-5462 (ISSN-L)
- 1530-9185
- OpenAlex
- W2912046818
- Cited by
- 229
- References
- 1
- FWCI
- 5.27
- Type
- journal article
- Language
- en
- Open access
- closed
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.