2000 character limit reached
Faster Convergence with Lexicase Selection in Tree-based Automated Machine Learning (2302.00731v1)
Published 1 Feb 2023 in cs.NE and cs.AI
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.
- Nicholas Matsumoto (3 papers)
- Anil Kumar Saini (3 papers)
- Pedro Ribeiro (107 papers)
- Hyunjun Choi (4 papers)
- Alena Orlenko (2 papers)
- Leo-Pekka Lyytikäinen (1 paper)
- Jari O Laurikka (1 paper)
- Terho Lehtimäki (2 papers)
- Sandra Batista (2 papers)
- Jason H. Moore (56 papers)