Pith. sign in

REVIEW 1 cited by

Optimal Initialization of Batch 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 2404.17997 v1 pith:5GZYRSFG submitted 2024-04-27 cs.LG stat.ML

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

Field experiments and computer simulations are effective but time-consuming methods of measuring the quality of engineered systems at different settings. To reduce the total time required, experimenters may employ Bayesian optimization, which is parsimonious with measurements, and take measurements of multiple settings simultaneously, in a batch. In practice, experimenters use very few batches, thus, it is imperative that each batch be as informative as possible. Typically, the initial batch in a Batch Bayesian Optimization (BBO) is constructed from a quasi-random sample of settings values. We propose a batch-design acquisition function, Minimal Terminal Variance (MTV), that designs a batch by optimization rather than random sampling. MTV adapts a design criterion function from Design of Experiments, called I-Optimality, which minimizes the variance of the post-evaluation estimates of quality, integrated over the entire space of settings. MTV weights the integral by the probability that a setting is optimal, making it able to design not only an initial batch but all subsequent batches, as well. Applicability to both initialization and subsequent batches is novel among acquisition functions. Numerical experiments on test functions and simulators show that MTV compares favorably to other BBO methods.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Fast, Precise Thompson Sampling for Bayesian Optimization

    stat.ML 2024-11 conditional novelty 6.0 of 10

    Stagger Thompson Sampler, a Hit-and-Run Thompson sampling variant with argmax-mean initialization and a log-uniform proposal, beats standard Thompson sampling, PSS, and common acquisition functions on synthetic benchm...

Pith tools