arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2311.04465cs.LGcs.CE
收藏

用高斯过程求解高频和多尺度偏微分方程

Solving High Frequency and Multi-Scale PDEs with Gaussian Processes

University of Utah(犹他大学)

Shikai Fang, Madison Cooley, Da Long, Shibo Li, Robert Kirby, Shandian Zhe

AI总结:

针对PINNs难以求解高频多尺度PDE的问题,提出基于高斯过程的方法,通过混合谱建模和克罗内克积结构实现高效可扩展求解。

摘要:

基于机器学习的求解器在物理模拟和科学计算中引起了广泛关注,一个突出的例子是物理信息神经网络(PINNs)。然而,PINNs 常常难以求解高频和多尺度偏微分方程(PDEs),这可能是由于神经网络训练过程中的频谱偏差所致。为了解决这个问题,我们求助于高斯过程(GP)框架。为了灵活地捕获主导频率,我们用学生 t 混合或高斯混合来对 PDE 解的功率谱进行建模。我们应用逆傅里叶变换(通过维纳-辛钦定理)获得协方差函数。由高斯混合谱导出的协方差对应于已知的谱混合核。接下来,我们在对数域中估计混合权重,我们证明这等价于放置一个杰弗里斯先验。它自动诱导稀疏性,修剪多余的频率,并将剩余的频率调整到接近真实值。第三,为了实现大规模配点上的高效和可扩展计算,这对捕获高频至关重要,我们将配点放置在网格上,并在每个输入维度上乘以我们的协方差函数。我们使用 GP 条件均值来预测解及其导数,以便拟合边界条件和方程本身。因此,我们可以推导出协方差矩阵中的克罗内克积结构。我们利用克罗内克积性质和多线性代数来提高计算效率和可扩展性,而无需低秩近似。我们在系统实验中展示了我们方法的优势。代码发布于 \url{https://github.com/xuangu-fang/Gaussian-Process-Slover-for-High-Freq-PDE}。

英文摘要:

Machine learning based solvers have garnered much attention in physical simulation and scientific computing, with a prominent example, physics-informed neural networks (PINNs). However, PINNs often struggle to solve high-frequency and multi-scale PDEs, which can be due to spectral bias during neural network training. To address this problem, we resort to the Gaussian process (GP) framework. To flexibly capture the dominant frequencies, we model the power spectrum of the PDE solution with a student $t$ mixture or Gaussian mixture. We apply the inverse Fourier transform to obtain the covariance function (by Wiener-Khinchin theorem). The covariance derived from the Gaussian mixture spectrum corresponds to the known spectral mixture kernel. Next, we estimate the mixture weights in the log domain, which we show is equivalent to placing a Jeffreys prior. It automatically induces sparsity, prunes excessive frequencies, and adjusts the remaining toward the ground truth. Third, to enable efficient and scalable computation on massive collocation points, which are critical to capture high frequencies, we place the collocation points on a grid, and multiply our covariance function at each input dimension. We use the GP conditional mean to predict the solution and its derivatives so as to fit the boundary condition and the equation itself. As a result, we can derive a Kronecker product structure in the covariance matrix. We use Kronecker product properties and multilinear algebra to promote computational efficiency and scalability, without low-rank approximations. We show the advantage of our method in systematic experiments. The code is released at \url{https://github.com/xuangu-fang/Gaussian-Process-Slover-for-High-Freq-PDE}.

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

↑