Analysis of the Complexity of the Automatic Pipeline Generation Problem

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

@InProceedings{Garciarena:2018:CEC,

• author = "Unai Garciarena and Roberto Santana and Alexander Mendiburu",
• booktitle = "2018 IEEE Congress on Evolutionary Computation (CEC)",
• title = "Analysis of the Complexity of the Automatic Pipeline Generation Problem",
• year = "2018",
• abstract = "Strategies to automatize the selection of Machine Learning algorithms and their parameters have gained popularity in recent years, to the point of coining the term Automated Machine Learning. The most general version of this problem is pipeline optimization, which seeks an optimal combination of preprocessors and classifiers, along with their respective parameters. In this paper we address the pipeline generation problem from a broader perspective, that of problem complexity understanding as a previous step before proposing a solution, a comprehension we consider critical. The main contribution of this work is the analysis of the characteristics of the fitness landscape. Furthermore, a recently introduced tool for pipeline generation is used to investigate how an automatic method behaves in the previously studied landscape. Results show the high complexity of the pipeline optimization problem, as it can contain several disperse optima, and suffers from a severe lack of generality. Results also suggest that, depending on the dimensions of the search, the model quality target, and the data being modelled, basic search methods can produce results that match the user's expectations.",
• keywords = "genetic algorithms, genetic programming",
• DOI = "doi:10.1109/CEC.2018.8477662",
• month = jul,
• notes = "Also known as \cite{8477662}",

}

Genetic Programming entries for Unai Garciarena Hualde Roberto Santana Alexander Mendiburu

Citations