基于流形学习的高维代理模型多项式混沌展开
Manifold learning-based polynomial chaos expansions for high-dimensional surrogate models
摘要:
在这项工作中,我们介绍了一个流形学习为基础的方法不确定性量化(UQ)在描述复杂的时空过程的系统。我们的第一个目标是识别一组高维数据的嵌入,这些数据表示计算或分析模型的感兴趣的量。为此,我们采用格拉斯曼扩散映射,两步非线性降维技术,使我们能够减少数据的维数,并确定有意义的几何描述在一个吝啬和廉价的方式。然后利用多项式混沌展开构造随机输入参数与约化空间的扩散坐标之间的映射。提出了一种自适应聚类技术,以确定潜在空间中的点的聚类的最佳数量。点的相似性使我们能够构建一些几何谐波仿真器,这些仿真器最终被用作一组廉价的预训练模型,以执行潜在特征到环境空间的实现的逆映射,从而执行准确的样本外预测。因此,所提出的方法作为一个编码器-解码器系统,它能够自动处理非常高维的数据,同时成功地在小数据制度。两个基准问题和对流扩散反应方程模型的两个物种之间的一阶化学反应的系统上证明了该方法。在所有的测试案例中,所提出的方法是能够实现高度准确的近似,最终导致显着加速UQ任务。
英文摘要:
In this work we introduce a manifold learning-based method for uncertainty quantification (UQ) in systems describing complex spatiotemporal processes. Our first objective is to identify the embedding of a set of high-dimensional data representing quantities of interest of the computational or analytical model. For this purpose, we employ Grassmannian diffusion maps, a two-step nonlinear dimension reduction technique which allows us to reduce the dimensionality of the data and identify meaningful geometric descriptions in a parsimonious and inexpensive manner. Polynomial chaos expansion is then used to construct a mapping between the stochastic input parameters and the diffusion coordinates of the reduced space. An adaptive clustering technique is proposed to identify an optimal number of clusters of points in the latent space. The similarity of points allows us to construct a number of geometric harmonic emulators which are finally utilized as a set of inexpensive pre-trained models to perform an inverse map of realizations of latent features to the ambient space and thus perform accurate out-of-sample predictions. Thus, the proposed method acts as an encoder-decoder system which is able to automatically handle very high-dimensional data while simultaneously operating successfully in the small-data regime. The method is demonstrated on two benchmark problems and on a system of advection-diffusion-reaction equations which model a first-order chemical reaction between two species. In all test cases, the proposed method is able to achieve highly accurate approximations which ultimately lead to the significant acceleration of UQ tasks.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。