Abstract
The chance of solving a problem by random search of long linear programs tends to a limit as their size increases. When all outputs are equally used this limit is no more than 2−|test set|. The chance of randomly finding a long linear general solution is exponentially small.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
W. B. Langdon, “Scaling of program tree fitness spaces.” Evolutionary Computation vol. 7(4) pp. 399–428, Winter 1999.
W. B. Langdon, Data Structures and Genetic Programming, Kluwer Academic Publishers: Boston, 1998.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Langdon, W.B. Long Random Linear Programs Do Not Generalize. Genetic Programming and Evolvable Machines 2, 95–100 (2001). https://doi.org/10.1023/A:1011590227934
Issue Date:
DOI: https://doi.org/10.1023/A:1011590227934