Nicholas Matsumoto, A. Saini, Pedro Ribeiro, Hyun-Deok Choi, A. Orlenko, L. Lyytikainen, J. Laurikka, T. Lehtimaki, Sandra Batista, Jason W. Moore
{"title":"基于树的自动机器学习中词法选择的更快收敛","authors":"Nicholas Matsumoto, A. Saini, Pedro Ribeiro, Hyun-Deok Choi, A. Orlenko, L. Lyytikainen, J. Laurikka, T. Lehtimaki, Sandra Batista, Jason W. Moore","doi":"10.48550/arXiv.2302.00731","DOIUrl":null,"url":null,"abstract":"In many evolutionary computation systems, parent selection methods can affect, among other things, convergence to a solution. In this paper, we present a study comparing the role of two commonly used parent selection methods in evolving machine learning pipelines in an automated machine learning system called Tree-based Pipeline Optimization Tool (TPOT). Specifically, we demonstrate, using experiments on multiple datasets, that lexicase selection leads to significantly faster convergence as compared to NSGA-II in TPOT. We also compare the exploration of parts of the search space by these selection methods using a trie data structure that contains information about the pipelines explored in a particular run.","PeriodicalId":206738,"journal":{"name":"European Conference on Genetic Programming","volume":"25 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Faster Convergence with Lexicase Selection in Tree-based Automated Machine Learning\",\"authors\":\"Nicholas Matsumoto, A. Saini, Pedro Ribeiro, Hyun-Deok Choi, A. Orlenko, L. Lyytikainen, J. Laurikka, T. Lehtimaki, Sandra Batista, Jason W. Moore\",\"doi\":\"10.48550/arXiv.2302.00731\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In many evolutionary computation systems, parent selection methods can affect, among other things, convergence to a solution. In this paper, we present a study comparing the role of two commonly used parent selection methods in evolving machine learning pipelines in an automated machine learning system called Tree-based Pipeline Optimization Tool (TPOT). Specifically, we demonstrate, using experiments on multiple datasets, that lexicase selection leads to significantly faster convergence as compared to NSGA-II in TPOT. We also compare the exploration of parts of the search space by these selection methods using a trie data structure that contains information about the pipelines explored in a particular run.\",\"PeriodicalId\":206738,\"journal\":{\"name\":\"European Conference on Genetic Programming\",\"volume\":\"25 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-02-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"European Conference on Genetic Programming\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.48550/arXiv.2302.00731\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"European Conference on Genetic Programming","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.48550/arXiv.2302.00731","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Faster Convergence with Lexicase Selection in Tree-based Automated Machine Learning
In many evolutionary computation systems, parent selection methods can affect, among other things, convergence to a solution. In this paper, we present a study comparing the role of two commonly used parent selection methods in evolving machine learning pipelines in an automated machine learning system called Tree-based Pipeline Optimization Tool (TPOT). Specifically, we demonstrate, using experiments on multiple datasets, that lexicase selection leads to significantly faster convergence as compared to NSGA-II in TPOT. We also compare the exploration of parts of the search space by these selection methods using a trie data structure that contains information about the pipelines explored in a particular run.