arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1805.07489stat.MLcs.LGmath.DSmath.OCphysics.data-an
收藏

利用多个信息源通过熵减少的轮廓定位

Contour location via entropy reduction leveraging multiple information sources

Massachusetts Institute of Technology(麻省理工学院);University of Texas at Austin(德克萨斯大学奥斯汀分校)

Alexandre N. Marques, Remi R. Lam, Karen E. Willcox

摘要:

我们引入了一个算法来定位轮廓的功能,是昂贵的评估。定位轮廓的问题出现在许多应用中,包括分类,约束优化,以及机械和动力系统的性能分析(可靠性,故障概率,稳定性等)。我们的算法使用来自多个来源的信息来定位轮廓,这些信息以相对便宜、有偏见和可能有噪声的原始函数近似的形式提供。考虑多个信息源可以显著节省成本。我们还介绍了轮廓熵的概念,一个正式的措施的不确定性的位置的零轮廓的一个函数近似的统计代理模型。我们的算法定位轮廓有效地通过最大限度地减少轮廓熵单位成本。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑