Free lunches for function and program induction

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

@InProceedings{poli:2009:foga,

• author = "Riccardo Poli and Mario Graff and Nicholas Freitag McPhee",
• title = "Free lunches for function and program induction",
• booktitle = "FOGA '09: Proceedings of the tenth ACM SIGEVO workshop on Foundations of genetic algorithms",
• year = "2009",
• pages = "183--194",
• address = "Orlando, Florida, USA",
• month = "9-11 " # jan,
• organisation = "SIGEVO",
• publisher = "ACM",
• publisher_address = "New York, NY, USA",
• keywords = "genetic algorithms, genetic programming, NFL",
• ISBN = "3-540-27237-2",
• isbn13 = "978-1-60558-414-0",
• DOI = "doi:10.1145/1527125.1527148",
• size = "12 pages",
• abstract = "In this paper we prove that for a variety of practical problems and representations, there is a free lunch for search algorithms that specialise in the task of finding functions or programs that solve problems, such as genetic programming. In other words, not all such algorithms are equally good under all possible performance measures. We focus in particular on the case where the objective is to discover functions that fit sets of data-points a task that we will call symbolic regression. We show under what conditions there is a free lunch for symbolic regression, highlighting that these are extremely restrictive.",
• notes = "http://www.sigevo.org/foga-2009/ also known as \cite{1527148}",

}

Genetic Programming entries for Riccardo Poli Mario Graff Guerrero Nicholas Freitag McPhee

Citations