The DOI matches its Crossref record; 34 of the 34 references it cites were found in a registry or an index.
Genetic programming needs better benchmarks
Abstract
Genetic programming (GP) is not a field noted for the rigor of its benchmarking. Some of its benchmark problems are popular purely through historical contingency, and they can be criticized as too easy or as providing misleading information concerning real-world performance, but they persist largely because of inertia and the lack of good alternatives. Even where the problems themselves are impeccable, comparisons between studies are made more difficult by the lack of standardization. We argue that the definition of standard benchmarks is an essential step in the maturation of the field. We make several contributions towards this goal. We motivate the development of a benchmark suite and define its goals; we survey existing practice; we enumerate many candidate benchmarks; we report progress on reference implementations; and we set out a concrete plan for gathering feedback from the GP community that would, if adopted, lead to a standard set of benchmarks.
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
Genetic Programming: On the Programming of Computers by Means of Natural Selection
Koza, J. R. (1992) · Medical Entomology and Zoology · Cited by 13,082
Genetic programming II: Automatic discovery of reusable programs
(1995) · Computers & Mathematics with Applications · doi:10.1016/0898-1221(95)90099-3 · Cited by 1,901
Automatically finding patches using genetic programming
Weimer, W., Nguyen, T., Le Goues, C., & Forrest, S. (2009) · 2009 IEEE 31st International Conference on Software Engineering · doi:10.1109/icse.2009.5070536 · Cited by 761
Advances in genetic programming
Fogel, D. B. (1995) · Biosystems · doi:10.1016/0303-2647(95)90007-1 · Cited by 703
Vladislavleva, E. J., Smits, G. F., & den Hertog, D. (2009) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2008.926486 · Cited by 353
Improving Symbolic Regression with Interval Arithmetic and Linear Scaling
Keijzer, M. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-36599-0_7 · Cited by 346
Semantically-based crossover in genetic programming: application to real-valued symbolic regression
Uy, N. Q., Hoai, N. X., O’Neill, M., McKay, R. I., & Galván-López, E. (2011) · Genetic Programming and Evolvable Machines · doi:10.1007/s10710-010-9121-2 · Cited by 293
Open issues in genetic programming
O’Neill, M., Vanneschi, L., Gustafson, S., & Banzhaf, W. (2010) · Genetic Programming and Evolvable Machines · doi:10.1007/s10710-010-9113-2 · Cited by 224
Self-citationFFX: Fast, Scalable, Deterministic Symbolic Regression Technology
McConaghy, T. (2011) · Genetic and Evolutionary Computation · doi:10.1007/978-1-4614-1770-5_13 · Cited by 166
Silva, S., & Costa, E. (2009) · Genetic Programming and Evolvable Machines · doi:10.1007/s10710-008-9075-9 · Cited by 160
Evolutionary Consequences of Coevolving Targets
Pagie, L., & Hogeweg, P. (1997) · Evolutionary Computation · doi:10.1162/evco.1997.5.4.401 · Cited by 142
Dynamic Scheduling with Genetic Programming
Jakobović, D., & Budin, L. (2006) · Lecture notes in computer science · doi:10.1007/11729976_7 · Cited by 136
Time Series Forecasting for Dynamic Environments: The DyFor Genetic Program Model
Wagner, N., Michalewicz, Z., Khouja, M. J., & McGregor, R. R. (2007) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2006.882430 · Cited by 124
A Study of Fitness Distance Correlation as a Difficulty Measure in Genetic Programming
Tomassini, M., Vanneschi, L., Collard, P., & Clergue, M. (2005) · Evolutionary Computation · doi:10.1162/1063656054088549 · Cited by 121
Self-citationWhat Makes a Problem GP-Hard? Analysis of a Tunably Difficult Problem in Genetic Programming
Daida, J. M., Bertram, R. R., Stanhope, S. A., Khoo, J. C. H., Chaudhary, S. A., Chaudhri, O. A., & Polito, J. (2001) · Genetic Programming and Evolvable Machines · doi:10.1023/a:1011504414730 · Cited by 103
Hansen, J. V., Lowry, P. B., Meservy, R. D., & McDonald, D. M. (2006) · Decision Support Systems · doi:10.1016/j.dss.2006.04.004 · Cited by 94
Cuccu, G., & Gomez, F. J. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-20525-5_24 · Cited by 84
Theory and practice for efficient genetic programming
Vanneschi, L. (2004) · IRIS · Cited by 79
Self-citationGP-EndChess: Using Genetic Programming to Evolve Chess Endgame Players
Hauptman, A., & Sipper, M. (2005) · Lecture notes in computer science · doi:10.1007/978-3-540-31989-4_11 · Cited by 73
The Royal Tree Problem, a Benchmark for Single and Multiple Population Genetic Programming
(1996) · The MIT Press eBooks · doi:10.7551/mitpress/1109.003.0021 · Cited by 71
A genetic approach to the truck backer upper problem and the inter-twined spiral problem
Koza, J. R. (2003) · International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn.1992.227324 · Cited by 65
Repeated Sequences in Linear Genetic Programming Genomes
Langdon, W. B., & Banzhaf, W. (2005) · Complex Systems · doi:10.25088/complexsystems.15.4.285 · Cited by 55
Evolving Genes to Balance a Pole
Nicolau, M., Schoenauer, M., & Banzhaf, W. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-12148-7_17 · Cited by 46
Yu, T. (2001) · Genetic Programming and Evolvable Machines · doi:10.1023/a:1012926821302 · Cited by 44
Goldberg, D. E., & O’Reilly, U.-M. (1998) · Lecture notes in computer science · doi:10.1007/bfb0055925 · Cited by 42
Self-citationDesigning an Evolutionary Strategizing Machine for Game Playing and Beyond
Sipper, M., Azaria, Y., Hauptman, A., & Shichel, Y. (2007) · IEEE Transactions on Systems Man and Cybernetics Part C (Applications and Reviews) · doi:10.1109/tsmcc.2007.897326 · Cited by 41
GP-Gammon: Genetically Programming Backgammon Players
Azaria, Y., & Sipper, M. (2005) · Genetic Programming and Evolvable Machines · doi:10.1007/s10710-005-2990-0 · Cited by 40
Warning: statistical benchmarking is addictive. Kicking the habit in machine learning
Drummond, C., & Japkowicz, N. (2009) · Journal of Experimental & Theoretical Artificial Intelligence · doi:10.1080/09528130903010295 · Cited by 39
Is the perfect the enemy of the good
Luke, S., & Panait, L. (2002) · Cited by 31
Self-citationRepeated patterns in genetic programming
Langdon, W. B., & Banzhaf, W. (2007) · Natural Computing · doi:10.1007/s11047-007-9038-8 · Cited by 29
Vanneschi, L., Castelli, M., & Manzoni, L. (2011) · Genetic and Evolutionary Computation Conference (GECCO) · doi:10.1145/2001576.2001773 · Cited by 19
Self-citationGP challenge: evolving energy function for protein structure prediction
Widera, P., Garibaldi, J. M., & Krasnogor, N. (2009) · Genetic Programming and Evolvable Machines · doi:10.1007/s10710-009-9087-0 · Cited by 18
Variable size population for dynamic optimization with genetic programming
Vanneschi, L., & Cuccu, G. (2009) · Genetic and Evolutionary Computation Conference (GECCO) · doi:10.1145/1569901.1570222 · Cited by 6
Self-citationDynamic High Frequency Trading: A Neuro-Evolutionary Approach
Bradley, R., Brabazon, A., & O’Neill, M. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-01129-0_27 · Cited by 4
Cited by
PMLB: a large benchmark suite for machine learning evaluation and comparison
Olson, R. S., La Cava, W., Orzechowski, P., Urbanowicz, R. J., & Moore, J. H. (2017) · BioData Mining · doi:10.1186/s13040-017-0154-4 · Cited by 365
Solving Uncompromising Problems With Lexicase Selection
Helmuth, T., Spector, L., & Matheson, J. (2015) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2014.2362729 · Cited by 195
Metadata
- Authors
- McDermott, J., White, D. R., Luke, S., Manzoni, L., Castelli, M., Vanneschi, L., Jaskowski, W., Krawiec, K., Harper, R., De Jong, K., & O'Reilly, U.-M.
- Venue
- Proceedings of the 14th annual conference on Genetic and evolutionary computation
- Publisher
- ACM
- Published
- 2012-07-07
- Pages
- 791-798
- OpenAlex
- W2084288340
- Cited by
- 270
- References
- 34
- FWCI
- 16.00
- Type
- conference paper
- 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.