mlsanityData to 7 Oct 2026

Contour location via entropy reduction leveraging multiple information sources

arXiv 1805.07489 ↗First posted 19 May 2018stat.ML cs.LG math.DScited by 10

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. Cited by 10 papers in the map (data through 7 Oct 2026). First posted on arXiv 19 May 2018.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 3; 2022: 1; 2023: 1; 2024: 2; 2025: 2; 2026: 1.

10 papers.