Long Random Linear Programs Do Not Generalize
Author: Langdon, W.B.
Source: Genetic Programming and Evolvable Machines, Volume 2, Number 2, June 2001 , pp. 95-100(6)
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.
Document Type: Regular Paper
Affiliations: Computer Science, University College, London, Gower Street, London, WC1E 6BT, UK email@example.com
Publication date: June 1, 2001