The chance of solving a problem by random search of
linear random programs tends to a limit as their size
increases. When all outputs are equally used this limit
is no more than 2**(-|test set|). Where |test set| is
the size of the total test set. This is a
generalisation of a previous result,
langdon:1999:sptfs.
Secondly, we show the chance of finding a long linear
general solution by random search is exponentially
small.
%0 Journal Article
%1 langdon:2001:randsearch
%A Langdon, W. B.
%D 2001
%J Genetic Programming and Evolvable Machines
%K algorithms, generality, genetic programming, random search
%N 2
%P 95--100
%R doi:10.1023/A:1011590227934
%T Long Random Linear Programs Do Not Generalize
%V 2
%X The chance of solving a problem by random search of
linear random programs tends to a limit as their size
increases. When all outputs are equally used this limit
is no more than 2**(-|test set|). Where |test set| is
the size of the total test set. This is a
generalisation of a previous result,
langdon:1999:sptfs.
Secondly, we show the chance of finding a long linear
general solution by random search is exponentially
small.
@article{langdon:2001:randsearch,
abstract = {The chance of solving a problem by random search of
linear random programs tends to a limit as their size
increases. When all outputs are equally used this limit
is no more than 2**(-|test set|). Where |test set| is
the size of the total test set. This is a
generalisation of a previous result,
\cite{langdon:1999:sptfs}.
Secondly, we show the chance of finding a long linear
general solution by random search is exponentially
small.},
added-at = {2008-06-19T17:35:00.000+0200},
author = {Langdon, W. B.},
biburl = {https://www.bibsonomy.org/bibtex/27f08a3926005ec82fc246046f8b805de/brazovayeye},
doi = {doi:10.1023/A:1011590227934},
interhash = {00a068b86a0c414d6a65e138d5380225},
intrahash = {7f08a3926005ec82fc246046f8b805de},
issn = {1389-2576},
journal = {Genetic Programming and Evolvable Machines},
keywords = {algorithms, generality, genetic programming, random search},
month = {June},
notes = {No Generalise See also RN/01/14
http://www.cs.ucl.ac.uk/staff/W.Langdon/maxproduct/
Article ID: 335707},
number = 2,
pages = {95--100},
size = {6 pages},
timestamp = {2008-06-19T17:44:58.000+0200},
title = {Long Random Linear Programs Do Not Generalize},
volume = 2,
year = 2001
}