arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2406.03973math.NAcs.NA
收藏

一种基于稀疏高维逼近的离散算子学习方法

An approach to discrete operator learning based on sparse high-dimensional approximation

Daniel Potts, Fabian Taubert

AI总结:

本研究提出一种基于稀疏高维逼近的维度递增离散算子学习方法,通过分解微分方程源函数参数、检测基展开大系数学习高维解函数,可揭示解的结构与参数依赖关系并支持更高维推广。

摘要:

我们提出一种在有界正交乘积基下进行函数逼近的维度递增方法,用于学习各类微分方程的解。为此,我们将微分方程的源函数分解为傅里叶系数或样条系数等参数,并将微分方程的解视为关于空间变量、这些参数以及微分方程自身可能含有的其他参数的高维函数。最后,我们通过检测基展开中绝对值最大的系数,在合适的函数空间中以稀疏逼近的方式学习该函数。研究基系数的对应索引可进一步揭示解的结构、解对参数的依赖关系及参数间的相互作用,还能合理推广到更高维度,从而实现对分解后源函数更精细的分辨率。

英文摘要:

We present a dimension-incremental method for function approximation in bounded orthonormal product bases to learn the solutions of various differential equations. Therefore, we decompose the source function of the differential equation into parameters like Fourier or Spline coefficients and treat the solution of the differential equation as a high-dimensional function w.r.t. the spatial variables, these parameters and also further possible parameters from the differential equation itself. Finally, we learn this function in the sense of sparse approximation in a suitable function space by detecting coefficients of the basis expansion with the largest absolute values. Investigating the corresponding indices of the basis coefficients yields further insights on the structure of the solution as well as its dependency on the parameters and their interactions and allows for a reasonable generalization to even higher dimensions and therefore better resolutions of the decomposed source function.

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

↑