pySOT and POAP: An event-driven asynchronous framework for surrogate optimization
Not on the map. Why?
Abstract (arXiv)
This paper describes Plumbing for Optimization with Asynchronous Parallelism (POAP) and the Python Surrogate Optimization Toolbox (pySOT). POAP is an event-driven framework for building and combining asynchronous optimization strategies, designed for global optimization of expensive functions where concurrent function evaluations are useful. POAP consists of three components: a worker pool capable of function evaluations, strategies to propose evaluations or other actions, and a controller that mediates the interaction between the workers and strategies. pySOT is a collection of synchronous and asynchronous surrogate optimization strategies, implemented in the POAP framework. We support the stochastic RBF method by Regis and Shoemaker along with various extensions of this method, and a general surrogate optimization strategy that covers most Bayesian optimization methods. We have implemented many different surrogate models, experimental designs, acquisition functions, and a large set of test problems. We make an extensive comparison between synchronous and asynchronous parallelism and find that the advantage of asynchronous computation increases as the variance of the evaluation time or number of processors increases. We observe a close to linear speed-up with 4, 8, and 16 processors in both the synchronous and asynchronous setting.
Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). First posted on arXiv 30 Jul 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 3; 2023: 1.
6 papers.
- 2021Bayesian Optimization is Superior to Random Search for Machine Learning Hyperparameter Tuning: Analysis of the Black-Box Optimization Challenge 2020cited by 146
- 2023PFNs4BO: In-Context Learning for Bayesian Optimizationcited by 70
- 2021EXPObench: Benchmarking Surrogate-based Optimisation Algorithms on Expensive Black-box Functionscited by 9
- 2022HPS-Det: Dynamic Sample Assignment with Hyper-Parameter Search for Object Detectioncited by 0
- 2022Neighbor Regularized Bayesian Optimization for Hyperparameter Optimizationcited by 0
- 2022Trading Off Resource Budgets for Improved Regret Boundscited by 0
- 2023PFNs4BO: In-Context Learning for Bayesian Optimization27 May 2023
- 2022Trading Off Resource Budgets for Improved Regret Bounds11 Oct 2022
- 2022Neighbor Regularized Bayesian Optimization for Hyperparameter Optimization7 Oct 2022
- 2022HPS-Det: Dynamic Sample Assignment with Hyper-Parameter Search for Object Detection23 Jul 2022
- 2021EXPObench: Benchmarking Surrogate-based Optimisation Algorithms on Expensive Black-box Functions8 Jun 2021
- 2021Bayesian Optimization is Superior to Random Search for Machine Learning Hyperparameter Tuning: Analysis of the Black-Box Optimization Challenge 202020 Apr 2021