Contemporary symbolic regression methods and their relative performance

W La Cava, B Burlacu, M Virgolin… - Advances in neural …, 2021 - pmc.ncbi.nlm.nih.gov
Many promising approaches to symbolic regression have been presented in recent years,
yet progress in the field continues to suffer from a lack of uniform, robust, and transparent …

Language model crossover: Variation through few-shot prompting

E Meyerson, MJ Nelson, H Bradley, A Gaier… - ACM Transactions on …, 2024 - dl.acm.org
This article pursues the insight that language models naturally enable an intelligent variation
operator similar in spirit to evolutionary crossover. In particular, language models of …

PMLB: a large benchmark suite for machine learning evaluation and comparison

RS Olson, W La Cava, P Orzechowski, RJ Urbanowicz… - BioData mining, 2017 - Springer
Background The selection, development, or comparison of machine learning methods in
data mining can be a difficult task based on the target problem and goals of a particular …

Where are we now? A large benchmark study of recent symbolic regression methods

P Orzechowski, W La Cava, JH Moore - Proceedings of the genetic and …, 2018 - dl.acm.org
In this paper we provide a broad benchmarking of recent genetic programming approaches
to symbolic regression in the context of state of the art machine learning approaches. We …

Evaluation in artificial intelligence: from task-oriented to ability-oriented measurement

J Hernández-Orallo - Artificial Intelligence Review, 2017 - Springer
The evaluation of artificial intelligence systems and components is crucial for the progress of
the discipline. In this paper we describe and critically assess the different ways AI systems …

Multifactorial genetic programming for symbolic regression problems

J Zhong, L Feng, W Cai, YS Ong - IEEE transactions on systems …, 2018 - ieeexplore.ieee.org
Genetic programming (GP) is a powerful evolutionary algorithm that has been widely used
for solving many real-world optimization problems. However, traditional GP can only solve a …

Solving uncompromising problems with lexicase selection

T Helmuth, L Spector… - IEEE Transactions on …, 2014 - ieeexplore.ieee.org
We describe a broad class of problems, called “uncompromising problems,” which are
characterized by the requirement that solutions must perform optimally on each of many test …

Better GP benchmarks: community survey results and proposals

DR White, J McDermott, M Castelli, L Manzoni… - … and evolvable machines, 2013 - Springer
We present the results of a community survey regarding genetic programming benchmark
practices. Analysis shows broad consensus that improvement is needed in problem …

General program synthesis benchmark suite

T Helmuth, L Spector - Proceedings of the 2015 Annual Conference on …, 2015 - dl.acm.org
Recent interest in the development and use of non-trivial benchmark problems for genetic
programming research has highlighted the scarcity of general program synthesis (also …

Ponyge2: Grammatical evolution in python

M Fenton, J McDermott, D Fagan… - Proceedings of the …, 2017 - dl.acm.org
Grammatical Evolution (GE) is a population-based evolutionary algorithm, where a formal
grammar is used in the genotype to phenotype map** process. PonyGE2 is an open …