Simple and Scalable Parallelized Bayesian Optimization
Masahiro Nomura

TL;DR
This paper introduces a simple, scalable Bayesian optimization method designed for asynchronous parallel settings, effectively utilizing distributed resources for high-cost problems like hyperparameter tuning.
Contribution
The paper presents a novel asynchronous parallel Bayesian optimization approach that is simple to implement and scalable, addressing limitations of previous methods.
Findings
Demonstrates promising performance on benchmark functions
Effective hyperparameter optimization for multi-layer perceptrons
Scalable and efficient in asynchronous parallel environments
Abstract
In recent years, leveraging parallel and distributed computational resources has become essential to solve problems of high computational cost. Bayesian optimization (BO) has shown attractive results in those expensive-to-evaluate problems such as hyperparameter optimization of machine learning algorithms. While many parallel BO methods have been developed to search efficiently utilizing these computational resources, these methods assumed synchronous settings or were not scalable. In this paper, we propose a simple and scalable BO method for asynchronous parallel settings. Experiments are carried out with a benchmark function and hyperparameter optimization of multi-layer perceptrons, which demonstrate the promising performance of the proposed method.
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.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Bandit Algorithms Research · Advanced Multi-Objective Optimization Algorithms · Machine Learning and Data Classification
