We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
In many applications of black-box optimization, one can evaluate multiple points simultaneously, e.g. when evaluating the performances of several different neural network architectures in a parallel computing environment. In this paper, we develop a novel batch Bayesian optimization algorithm --- the parallel knowledge gradient method. By construction, this method provides the one-step Bayes-optimal batch of points to sample. We provide an efficient strategy for computing this Bayes-optimal batch of points, and we demonstrate that the parallel knowledge gradient method finds global optima significantly faster than previous batch Bayesian optimization algorithms on both synthetic test functions and when tuning hyperparameters of practical machine learning algorithms, especially when function evaluations are noisy.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1606.04414")
get_code_for_paper("1606.04414")
have("1606.04414")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/1606.04414.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/1606.04414)
Connect an agent — have() is free.