Timezone: »

Contour location via entropy reduction leveraging multiple information sources
Alexandre Marques · Remi Lam · Karen Willcox

Thu Dec 06 02:00 PM -- 04:00 PM (PST) @ Room 210 #99

We introduce an algorithm to locate contours of functions that are expensive to evaluate. The problem of locating contours arises in many applications, including classification, constrained optimization, and performance analysis of mechanical and dynamical systems (reliability, probability of failure, stability, etc.). Our algorithm locates contours using information from multiple sources, which are available in the form of relatively inexpensive, biased, and possibly noisy approximations to the original function. Considering multiple information sources can lead to significant cost savings. We also introduce the concept of contour entropy, a formal measure of uncertainty about the location of the zero contour of a function approximated by a statistical surrogate model. Our algorithm locates contours efficiently by maximizing the reduction of contour entropy per unit cost.

Author Information

Alexandre Marques (Massachusetts Institute of Technology)
Remi Lam (MIT)
Karen Willcox (MIT)

Related Events (a corresponding poster, oral, or spotlight)

More from the Same Authors