Ideal Evaluation from Coevolution
The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Abstract
In many problems of interest, performance can be evaluated using tests, such as examples in concept learning, test points in function approximation, and opponents in game-playing. Evaluation on all tests is often infeasible. Identification of an accurate evaluation or fitness function is a difficult problem in itself, and approximations are likely to introduce human biases into the search process. Coevolution evolves the set of tests used for evaluation, but has so far often led to inaccurate evaluation. We show that for any set of learners, a Complete Evaluation Set can be determined that provides ideal evaluation as specified by Evolutionary Multi-Objective Optimization. This provides a principled approach to evaluation in coevolution, and thereby brings automatic ideal evaluation within reach. The Complete Evaluation Set is of manageable size, and progress towards it can be accurately measured. Based on this observation, an algorithm named DELPHI is developed. The algorithm is tested on problems likely to permit progress on only a subset of the underlying objectives. Where all comparison methods result in overspecialization, the proposed method and a variant achieve sustained progress in all underlying objectives. These findings demonstrate that ideal evaluation may be approximated by practical algorithms, and that accurate evaluation for test-based problems is possible even when the underlying objectives of a problem are unknown.
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
Muiltiobjective Optimization Using Nondominated Sorting in Genetic Algorithms
Srinivas, N., & Deb, K. (1994) · Evolutionary Computation · doi:10.1162/evco.1994.2.3.221 · Cited by 6,935 · cited 2×
“For an introduction into Evolutionary Multi-Objective Optimization (EMOO), a number of sources are available (Fonseca & Fleming, 1993; Srinivas & Deb, 1994; Fonseca & Fleming, 1995; Van Veldhuizen, 1999; Coello, 2000; Deb, 2001).”
MethodSome Studies in Machine Learning Using the Game of Checkers
Samuel, A. L. (1959) · IBM Journal of Research and Development · doi:10.1147/rd.33.0210 · Cited by 4,443
Some studies in machine learning using the game of checkers
Samuel, A. L. (2000) · IBM Journal of Research and Development · doi:10.1147/rd.441.0206 · Cited by 1,439
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 7×
“Hillis (1990) used evaluators that consisted of input sequences and were called parasites.”
BackgroundMethodInfluentialNumerical testing of evolution theories: Part I Theoretical introduction and basic tests
Barricelli, N. A. (1962) · Acta Biotheoretica · doi:10.1007/bf01556771 · Cited by 107
Cited by
Preference-Inspired Coevolutionary Algorithms for Many-Objective Optimization
Wang, R., Purshouse, R. C., & Fleming, P. J. (2013) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2012.2204264 · Cited by 406
A Survey on Cooperative Co-Evolutionary Algorithms
Ma, X., Li, X., Zhang, Q., Tang, K., Liang, Z., Xie, W., & Zhu, Z. (2019) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2018.2868770 · Cited by 336
Clune, J. (2019) · arXiv · doi:10.48550/arxiv.1905.10985 · Cited by 82
“A specific version of this idea, called coevolution, is to have two populations of learning agents competing or cooperating with each other [35, 43, 79, 134, 194].”
BackgroundPOET: 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
“From an evolutionary perspective, one way to think about learning environments evolving along with their solutions is through the coevolution [10, 14, 26, 44, 62] of the two.”
BackgroundWang, 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
Metadata
- Authors
- Jong, E. D. D., & Pollack, J. B.
- Venue
- Evolutionary Computation
- Publisher
- MIT Press - Journals
- Published
- 2004-06
- Volume
- 12
- Issue
- 2
- Pages
- 159-192
- ISSN
- 1063-6560 (ISSN-L)
- 1530-9304
- OpenAlex
- W2117673555
- Cited by
- 137
- References
- 5
- FWCI
- 15.93
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Ideal Evaluation from Coevolution. https://app.cochat.ai/papers/10.1162/106365604773955139
- The paper
- Jong, E. D. D., & Pollack, J. B. (2004). Ideal Evaluation from Coevolution. Evolutionary Computation. https://doi.org/10.1162/106365604773955139
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.