Pith. sign in

REVIEW

Stratified Bayesian Optimization

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1602.02338 v2 pith:QJ7MHEV7 submitted 2016-02-07 cs.LG math.OCstat.ML

classification cs.LGmath.OCstat.ML
keywords optimizationbayesiandependencealgorithmglobalrandomstratifiedstrong
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We consider derivative-free black-box global optimization of expensive noisy functions, when most of the randomness in the objective is produced by a few influential scalar random inputs. We present a new Bayesian global optimization algorithm, called Stratified Bayesian Optimization (SBO), which uses this strong dependence to improve performance. Our algorithm is similar in spirit to stratification, a technique from simulation, which uses strong dependence on a categorical representation of the random input to reduce variance. We demonstrate in numerical experiments that SBO outperforms state-of-the-art Bayesian optimization benchmarks that do not leverage this dependence.

Discussion (0). Continue with ORCID to comment.

Pith tools