Genetic programming: on the programming of computers by means of natural selection
Genetic programming: on the programming of computers by means of natural selection
Genetic Algorithms for Multiobjective Optimization: FormulationDiscussion and Generalization
Proceedings of the 5th International Conference on Genetic Algorithms
A Fast Elitist Non-dominated Sorting Genetic Algorithm for Multi-objective Optimisation: NSGA-II
PPSN VI Proceedings of the 6th International Conference on Parallel Problem Solving from Nature
Lexicographic Parsimony Pressure
GECCO '02 Proceedings of the Genetic and Evolutionary Computation Conference
Proceedings of the European Conference on Genetic Programming
Optimal suffix tree construction with large alphabets
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
ALPS: the age-layered population structure for reducing the problem of premature convergence
Proceedings of the 8th annual conference on Genetic and evolutionary computation
Using context-aware crossover to improve the performance of GP
Proceedings of the 8th annual conference on Genetic and evolutionary computation
CEC '02 Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02
Linear pattern matching algorithms
SWAT '73 Proceedings of the 14th Annual Symposium on Switching and Automata Theory (swat 1973)
Using Numerical Simplification to Control Bloat in Genetic Programming
SEAL '08 Proceedings of the 7th International Conference on Simulated Evolution and Learning
Semantic Aware Crossover for Genetic Programming: The Case for Real-Valued Function Regression
EuroGP '09 Proceedings of the 12th European Conference on Genetic Programming
How online simplification affects building blocks in genetic programming
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Improving symbolic regression with interval arithmetic and linear scaling
EuroGP'03 Proceedings of the 6th European conference on Genetic programming
Tree adjoining grammars, language bias, and genetic programming
EuroGP'03 Proceedings of the 6th European conference on Genetic programming
Symbolic regression using nearest neighbor indexing
Proceedings of the 12th annual conference companion on Genetic and evolutionary computation
Grammar-based Genetic Programming: a survey
Genetic Programming and Evolvable Machines
Semantically-based crossover in genetic programming: application to real-valued symbolic regression
Genetic Programming and Evolvable Machines
Genetic programming needs better benchmarks
Proceedings of the 14th annual conference on Genetic and evolutionary computation
| Hi-index | 0.00 |
We introduce Prioritized Grammar Enumeration (PGE), a deterministic Symbolic Regression (SR) algorithm using dynamic programming techniques. PGE maintains the tree-based representation and Pareto non-dominated sorting from Genetic Programming (GP), but replaces genetic operators and random number use with grammar production rules and systematic choices. PGE uses non-linear regression and abstract parameters to fit the coefficients of an equation, effectively separating the exploration for form, from the optimization of a form. Memoization enables PGE to evaluate each point of the search space only once, and a Pareto Priority Queue provides direction to the search. Sorting and simplification algorithms are used to transform candidate expressions into a canonical form, reducing the size of the search space. Our results show that PGE performs well on 22 benchmarks from the SR literature, returning exact formulas in many cases. As a deterministic algorithm, PGE offers reliability and reproducibility of results, a key aspect to any system used by scientists at large. We believe PGE is a capable SR implementation, following an alternative perspective we hope leads the community to new ideas.