FLASH

Citations Over TimeTop 10% of 2016 papers

Abstract

Modern data science relies on data analytic pipelines to organize interdependent computational steps. Such analytic pipelines often involve different algorithms across multiple steps, each with its own hyperparameters. To achieve the best performance, it is often critical to select optimal algorithms and to set appropriate hyperparameters, which requires large computational efforts. Bayesian optimization provides a principled way for searching optimal hyperparameters for a single algorithm. However, many challenges remain in solving pipeline optimization problems with high-dimensional and highly conditional search space. In this work, we propose Fast LineAr SearcH (FLASH), an efficient method for tuning analytic pipelines. FLASH is a two-layer Bayesian optimization framework, which firstly uses a parametric model to select promising algorithms, then computes a nonparametric model to fine-tune hyperparameters of the promising algorithms. FLASH also includes an effective caching algorithm which can further accelerate the search process. Extensive experiments on a number of benchmark datasets have demonstrated that FLASH significantly outperforms previous state-of-the-art methods in both search speed and accuracy. Using 50% of the time budget, FLASH achieves up to 20% improvement on test error rate compared to the baselines. FLASH also yields state-of-the-art performance on a real-world application for healthcare predictive modeling.

Related Papers

• → Exploiting Configurations of MaxSAT Solvers(2022)166 cited
• → Stable Bayesian Optimization(2017)18 cited
• → Stable Bayesian optimization(2018)14 cited
• → SMAC3: A Versatile Bayesian Optimization Package for Hyperparameter Optimization(2021)83 cited
• → Towards Assessing the Impact of Bayesian Optimization's Own Hyperparameters(2019)7 cited