Pith. sign in

REVIEW 1 cited by

Bayesian optimization for materials design

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 1506.01349 v1 pith:T4ISFJA3 submitted 2015-06-03 stat.ML math.OC

classification stat.MLmath.OC
keywords bayesiandesignoptimizationdesignsmaterialsevaluationsexpectedexperiments
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We introduce Bayesian optimization, a technique developed for optimizing time-consuming engineering simulations and for fitting machine learning models on large datasets. Bayesian optimization guides the choice of experiments during materials design and discovery to find good material designs in as few experiments as possible. We focus on the case when materials designs are parameterized by a low-dimensional vector. Bayesian optimization is built on a statistical technique called Gaussian process regression, which allows predicting the performance of a new design based on previously tested designs. After providing a detailed introduction to Gaussian process regression, we introduce two Bayesian optimization methods: expected improvement, for design problems with noise-free evaluations; and the knowledge-gradient method, which generalizes expected improvement and may be used in design problems with noisy evaluations. Both methods are derived using a value-of-information analysis, and enjoy one-step Bayes-optimality.

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. Enhancing finite-difference based derivative-free optimization methods with machine learning

    math.OC 2025-02 conditional novelty 6.0 of 10

    A surrogate trained with Sobolev learning accelerates a finite-difference derivative-free method, with a complexity bound that improves with the average number of successful surrogate steps.

Pith tools