pith. sign in

arxiv: 1805.07489 · v3 · pith:TATY6Z4Xnew · submitted 2018-05-19 · 📊 stat.ML · cs.LG· math.DS· math.OC· physics.data-an

Contour location via entropy reduction leveraging multiple information sources

classification 📊 stat.ML cs.LGmath.DSmath.OCphysics.data-an
keywords contourcontoursalgorithmentropyinformationmultiplesourcescost
0
0 comments X
read the original abstract

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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Surrogate-Guided Adaptive Importance Sampling for Failure Probability Estimation

    stat.CO 2026-03 conditional novelty 7.0

    KDE-AIS trains a Gaussian process and kernel density surrogate from shared evaluations to build an adaptive importance sampling proposal that converges to the zero-variance optimum for efficient failure probability es...