REVIEW 3 cited by
Expected Diverse Utility (EDU): Diverse Bayesian Optimization of Expensive Computer Simulators
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
abstract
The optimization of expensive black-box simulators arises in a myriad of modern scientific and engineering applications. Bayesian optimization provides an appealing solution, by leveraging a fitted surrogate model to guide the selection of subsequent simulator evaluations. In practice, however, the objective is often not to obtain a single good solution, but rather a ``basket'' of good solutions from which users can choose for downstream decision-making. This need arises in our motivating application for real-time control of internal combustion engines for flight propulsion, where a diverse set of control strategies is essential for stable flight control. There has been little work on this front for Bayesian optimization. We thus propose a new Expected Diverse Utility (EDU) method that searches for diverse ``$\epsilon$-optimal'' solutions: locally-optimal solutions within a tolerance level $\epsilon > 0$ from a global optimum. We show that EDU yields a closed-form acquisition function under a Gaussian process surrogate model, which facilitates efficient sequential queries via automatic differentiation. This closed form further reveals a novel exploration-exploitation-diversity trade-off, which incorporates the desired diversity property within the well-known exploration-exploitation trade-off. We demonstrate the improvement of EDU over existing methods in a suite of numerical experiments, then explore the EDU in two applications on rover trajectory optimization and engine control for flight propulsion.
Forward citations
Cited by 3 Pith papers
-
Neural Low-Discrepancy Sequences
A trained index-to-point network generates low-discrepancy sequences whose prefixes beat Sobol, Halton, and scrambled Sobol discrepancy in four dimensions.
-
The BdryMat\'ern GP: Reliable incorporation of boundary information on irregular domains for Gaussian process modeling
A new Gaussian process kernel, derived from a stochastic PDE with boundary conditions, enforces Dirichlet, Neumann, or Robin boundaries on irregular domains with smoothness control and provable approximation error.
-
Robust designs for Gaussian process emulation of computer experiments
Energy-distance-minimizing support points and projected support points are shown to be robust Gaussian process emulation designs, with a theory linking them to maximum-entropy, minimax, and maximin designs.
Discussion (0). Sign in to comment.