pith. sign in

arxiv: 1901.10452 · v3 · pith:3CDAF5B6new · submitted 2019-01-29 · 📊 stat.ML · cs.AI· cs.LG

Asynchronous Batch Bayesian Optimisation with Improved Local Penalisation

classification 📊 stat.ML cs.AIcs.LG
keywords asynchronousbatchbayesianoptimisationparallelplaybookproblemsynchronous
0
0 comments X
read the original abstract

Batch Bayesian optimisation (BO) has been successfully applied to hyperparameter tuning using parallel computing, but it is wasteful of resources: workers that complete jobs ahead of others are left idle. We address this problem by developing an approach, Penalising Locally for Asynchronous Bayesian Optimisation on $k$ workers (PLAyBOOK), for asynchronous parallel BO. We demonstrate empirically the efficacy of PLAyBOOK and its variants on synthetic tasks and a real-world problem. We undertake a comparison between synchronous and asynchronous BO, and show that asynchronous BO often outperforms synchronous batch BO in both wall-clock time and number of function evaluations.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.