Pith. sign in

REVIEW 1 cited by

Large-Batch, Iteration-Efficient Neural Bayesian Design 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 2306.01095 v4 pith:AP4MXXNG submitted 2023-06-01 cs.LG cs.AIcs.CE

classification cs.LGcs.AIcs.CE
keywords bayesiandesignproblemsefficiencyoptimizationacquisitionframeworkfunction
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Bayesian optimization (BO) provides a powerful framework for optimizing black-box, expensive-to-evaluate functions. It is therefore an attractive tool for engineering design problems, typically involving multiple objectives. Thanks to the rapid advances in fabrication and measurement methods as well as parallel computing infrastructure, querying many design problems can be heavily parallelized. This class of problems challenges BO with an unprecedented setup where it has to deal with very large batches, shifting its focus from sample efficiency to iteration efficiency. We present a novel Bayesian optimization framework specifically tailored to address these limitations. Our key contribution is a highly scalable, sample-based acquisition function that performs a non-dominated sorting of not only the objectives but also their associated uncertainty. We show that our acquisition function in combination with different Bayesian neural network surrogates is effective in data-intensive environments with a minimal number of iterations. We demonstrate the superiority of our method by comparing it with state-of-the-art multi-objective optimizations. We perform our evaluation on two real-world problems -- airfoil design and 3D printing -- showcasing the applicability and efficiency of our approach. Our code is available at: https://github.com/an-on-ym-ous/lbn_mobo

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. Uncertainty separation via ensemble quantile regression

    cs.LG 2024-12 reject novelty 4.0 of 10

    An ensemble of quantile regressors plus an iterative data-augmentation algorithm separates aleatoric from epistemic uncertainty in synthetic tasks.

Pith tools