AI Chat AI Image Generator AI Video Text to Speech

Blackbox: A procedure for parallel optimization of expensive black-box functions

05/03/2016

∙

by Paul Knysh, et al.

∙

∙

This note provides a description of a procedure that is designed to efficiently optimize expensive black-box functions. It uses the response surface methodology by incorporating radial basis functions as the response model. A simple method based on a Latin hypercube is used for initial sampling. A modified version of CORS algorithm with space rescaling is used for the subsequent sampling. The procedure is able to scale on multicore processors by performing multiple function evaluations in parallel. The source code of the procedure is written in Python.

Paul Knysh
1 publication
Yannis Korkolis
1 publication

page 6

page 7

research

∙ 09/27/2019

Learning search spaces for Bayesian optimization: Another view of hyperparameter transfer learning

Bayesian optimization (BO) is a successful methodology to optimize black...

0 Valerio Perrone, et al. ∙

research

∙ 03/18/2021

Learning How to Optimize Black-Box Functions With Extreme Limits on the Number of Function Evaluations

We consider black-box optimization in which only an extremely limited nu...

0 Carlos Ansótegui, et al. ∙

research

∙ 10/18/2021

A portfolio approach to massively parallel Bayesian optimization

One way to reduce the time of conducting optimization studies is to eval...

0 Mickaël Binois, et al. ∙

research

∙ 06/27/2023

PyBADS: Fast and robust black-box optimization in Python

PyBADS is a Python implementation of the Bayesian Adaptive Direct Search...

0 Gurjeet Sangra Singh, et al. ∙

research

∙ 01/27/2022

Parallel black-box optimization of expensive high-dimensional multimodal functions via magnitude

Building on the recently developed theory of magnitude, we introduce the...

0 Steve Huntsman, et al. ∙

research

∙ 08/10/2021

Asymptotic convergence rates for averaging strategies

Parallel black box optimization consists in estimating the optimum of a ...

0 Laurent Meunier, et al. ∙

research

∙ 07/26/2018

Deriving Information Acquisition Criteria For Sequentially Inferring The Expected Value Of A Black-Box Function

Acquiring information about noisy expensive black-box functions (compute...

0 Piyush Pandita, et al. ∙