TL;DR
This paper explores using prior experience in the form of opportunistic meta-knowledge to preemptively reduce the search space in automated machine learning pipeline optimization, aiming to improve efficiency and model performance.
Contribution
It introduces a method to leverage opportunistic meta-knowledge for culling classifiers/regressors before pipeline search, enhancing AutoML efficiency and effectiveness.
Findings
Opportunistic meta-knowledge can improve ML outcomes.
Moderate culling of classifiers/regressors is beneficial.
Searching within a top tier of predictors outperforms relying on a single best performer.
Abstract
Machine learning (ML) pipeline composition and optimisation have been studied to seek multi-stage ML models, i.e. preprocessor-inclusive, that are both valid and well-performing. These processes typically require the design and traversal of complex configuration spaces consisting of not just individual ML components and their hyperparameters, but also higher-level pipeline structures that link these components together. Optimisation efficiency and resulting ML-model accuracy both suffer if this pipeline search space is unwieldy and excessively large; it becomes an appealing notion to avoid costly evaluations of poorly performing ML components ahead of time. Accordingly, this paper investigates whether, based on previous experience, a pool of available classifiers/regressors can be preemptively culled ahead of initiating a pipeline composition/optimisation process for a new ML problem,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
