Genetic programming: an introduction: on the automatic evolution of computer programs and its applications
Scaling of program fitness spaces
Evolutionary Computation
Modularity in genetic programming
EuroGP'03 Proceedings of the 6th European conference on Genetic programming
No free lunch theorems for optimization
IEEE Transactions on Evolutionary Computation
Grammar-Guided Neural Architecture Evolution
IWINAC '07 Proceedings of the 2nd international work-conference on The Interplay Between Natural and Artificial Computation, Part I: Bio-inspired Modeling of Cognitive Tasks
Iterative feature construction for improving inductive learning algorithms
Expert Systems with Applications: An International Journal
Free lunches for function and program induction
Proceedings of the tenth ACM SIGEVO workshop on Foundations of genetic algorithms
Free lunches for neural network search
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Modularity in genetic programming
EuroGP'03 Proceedings of the 6th European conference on Genetic programming
Theoretical results in genetic programming: the next ten years?
Genetic Programming and Evolvable Machines
Automatically designing selection heuristics
Proceedings of the 13th annual conference companion on Genetic and evolutionary computation
Evolutionary Computation
| Hi-index | 0.01 |
This paper has three aims. Firstly, to clarify the poorly understood No Free Lunch Theorem (NFL) which states all search algorithms perform equally. Secondly, search algorithms are often applied to program induction and it is suggested that NFL does not hold due to the universal nature of the mapping between program space and functionality space. Finally, NFL and combinatorial problems are examined. When evaluating a candidate solution, it can be discarded without being fully examined. A stronger version of NFL is established for this class of problems where the goal is to minimize a quantity.