Cutting Evaluation Costs: An Investigation into Early Termination in Genetic Programming

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

@InProceedings{Park:2013:CECa,

• article_id = "1638",
• author = "Namyong Park and Kangil Kim and R. I. (Bob) McKay",
• title = "Cutting Evaluation Costs: An Investigation into Early Termination in Genetic Programming",
• booktitle = "2013 IEEE Conference on Evolutionary Computation",
• volume = "1",
• year = "2013",
• month = jun # " 20-23",
• editor = "Luis Gerardo {de la Fraga}",
• pages = "3291--3298",
• address = "Cancun, Mexico",
• keywords = "genetic algorithms, genetic programming",
• isbn13 = "978-1-4799-0453-2",
• URL = "https://namyongpark.github.io/papers/cec2013_earlytermination.pdf",
• DOI = "doi:10.1109/CEC.2013.6557973",
• size = "8 pages",
• abstract = "Genetic programming is very computationally intensive, particularly in CPU time. A number of approaches to evaluation cost reduction have been proposed, among them early termination of evaluation (applicable in problem domains where estimates of the final fitness value are available during evaluation). Like all cost reduction techniques, early termination balances overall computation cost against the risk of finding worse solutions. We evaluate the influence of various properties of the problem domain, problem class, reliability of fitness estimates,trajectory of fitness estimates, and evolutionary trajectory, to determine whether any is able to predict the effects of early termination. There is little correlation with any of these, with one exception. Boolean problems see little change in running time,and hence only small changes in performance, are distinguished by both problem class, and each of the other metrics",
• notes = "CEC 2013 - A joint meeting of the IEEE, the EPS and the IET.",

}

Genetic Programming entries for Namyong Park Kangil Kim R I (Bob) McKay

Citations