Advertisement

Long Random Linear Programs Do Not Generalize

  • W. B. Langdon
Article

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.

genetic programming generality random search 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    W. B. Langdon, “Scaling of program tree fitness spaces.” Evolutionary Computation vol. 7(4) pp. 399–428, Winter 1999.Google Scholar
  2. 2.
    W. B. Langdon, Data Structures and Genetic Programming, Kluwer Academic Publishers: Boston, 1998.Google Scholar

Copyright information

© Kluwer Academic Publishers 2001

Authors and Affiliations

  • W. B. Langdon
    • 1
  1. 1.Computer ScienceUniversity CollegeLondonUK

Personalised recommendations