arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2302.04945cs.LGcs.NAmath.NAstat.COstat.ME
收藏

通过重新排序Monte Carlo样本有效传播不确定性

Efficient Propagation of Uncertainty via Reordering Monte Carlo Samples

Texas A&M University(德克萨斯农工大学)

Danial Khatamsaz, Vahid Attari, Raymundo Arroyave, Douglas L. Allaire

摘要:

模型预测结果的不确定性分析是基于决策的材料设计的关键要素,以建立模型的置信度并评估模型的保真度。不确定性传播(UP)是一种基于模型输入变量的不确定性来确定模型输出不确定性的技术。将不确定性从模型输入传播到其输出的最常见和最简单的方法是通过向模型提供大量样本,称为蒙特卡罗(MC)模拟,其需要从输入变量分布中进行穷举采样。然而,MC模拟是不切实际的模型时,计算昂贵。在这项工作中,我们调查的假设,虽然所有的样本是有用的平均,一些样本必须比其他更有用。因此,重新排序MC样本和传播更有用的样本可以导致更早地增强感兴趣的统计的收敛,从而减少UP过程的计算负担。在这里,我们介绍了一种方法来自适应重新排序MC样本,并显示它如何导致减少UP过程的计算费用。

英文摘要:

Uncertainty analysis in the outcomes of model predictions is a key element in decision-based material design to establish confidence in the models and evaluate the fidelity of models. Uncertainty Propagation (UP) is a technique to determine model output uncertainties based on the uncertainty in its input variables. The most common and simplest approach to propagate the uncertainty from a model inputs to its outputs is by feeding a large number of samples to the model, known as Monte Carlo (MC) simulation which requires exhaustive sampling from the input variable distributions. However, MC simulations are impractical when models are computationally expensive. In this work, we investigate the hypothesis that while all samples are useful on average, some samples must be more useful than others. Thus, reordering MC samples and propagating more useful samples can lead to enhanced convergence in statistics of interest earlier and thus, reducing the computational burden of UP process. Here, we introduce a methodology to adaptively reorder MC samples and show how it results in reduction of computational expense of UP processes.

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

↑