Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
119 tokens/sec
GPT-4o
56 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
6 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
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.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (10)
  1. Nicholas Matsumoto (3 papers)
  2. Anil Kumar Saini (3 papers)
  3. Pedro Ribeiro (107 papers)
  4. Hyunjun Choi (4 papers)
  5. Alena Orlenko (2 papers)
  6. Leo-Pekka Lyytikäinen (1 paper)
  7. Jari O Laurikka (1 paper)
  8. Terho Lehtimäki (2 papers)
  9. Sandra Batista (2 papers)
  10. Jason H. Moore (56 papers)
Citations (3)

Summary

We haven't generated a summary for this paper yet.