Free lunches for neural network search

Created by W.Langdon from gp-bibliography.bib Revision:1.2031

@InProceedings{DBLP:conf/gecco/PoliG09,
  author =       "Riccardo Poli and Mario Graff",
  title =        "Free lunches for neural network search",
  booktitle =    "GECCO '09: Proceedings of the 11th Annual conference
                 on Genetic and evolutionary computation",
  year =         "2009",
  editor =       "Guenther Raidl and Franz Rothlauf and 
                 Giovanni Squillero and Rolf Drechsler and Thomas Stuetzle and 
                 Mauro Birattari and Clare Bates Congdon and 
                 Martin Middendorf and Christian Blum and Carlos Cotta and 
                 Peter Bosman and Joern Grahl and Joshua Knowles and 
                 David Corne and Hans-Georg Beyer and Ken Stanley and 
                 Julian F. Miller and Jano {van Hemert} and 
                 Tom Lenaerts and Marc Ebner and Jaume Bacardit and 
                 Michael O'Neill and Massimiliano {Di Penta} and Benjamin Doerr and 
                 Thomas Jansen and Riccardo Poli and Enrique Alba",
  pages =        "1291--1298",
  address =      "Montreal",
  publisher =    "ACM",
  publisher_address = "New York, NY, USA",
  month =        "8-12 " # jul,
  organisation = "SigEvo",
  keywords =     "genetic algorithms, genetic programming",
  isbn13 =       "978-1-60558-325-9",
  bibsource =    "DBLP, http://dblp.uni-trier.de",
  doi =          "doi:10.1145/1569901.1570074",
  abstract =     "In this paper we prove that for a variety of practical
                 situations, the no-free-lunch (NFL) theorem does not
                 apply to algorithms that search the space of artificial
                 neural networks, such as evolutionary algorithms. We
                 find, in particular, that, while conditions under which
                 NFL applies exist, these require extremely restrictive
                 symmetries on the set of possible problems which are
                 unlikely encountered in practice. In other words, not
                 all algorithms are equally good at finding neural
                 networks that solve problems under all possible
                 performance measures: a superior search algorithm for
                 this domain does exist.",
  notes =        "GECCO-2009 A joint meeting of the eighteenth
                 international conference on genetic algorithms
                 (ICGA-2009) and the fourteenth annual genetic
                 programming conference (GP-2009).

                 ACM Order Number 910092.",
}

Genetic Programming entries for Riccardo Poli Mario Graff Guerrero