用可解释神经网络解决高维偏微分方程求解难题
Anant-Net: Breaking the Curse of Dimensionality with Scalable and Interpretable Neural Surrogate for High-Dimensional PDEs
- 结合柯尔莫哥洛夫-阿诺德网络,构建可解释的高维神经代理模型
- 在单张GPU上3小时内求解300维偏微分方程,精度高且鲁棒性强
- 适用于物理模拟、工程建模等需要高效高维计算的领域
高维偏微分方程(PDEs)广泛存在于科学与工程中,但因维度灾难导致计算不可行。传统数值方法在超立方域上面临计算复杂度指数增长的问题,所需配点数随维度急剧上升。本文提出Anant-Net,一种高效的神经代理模型,可突破此瓶颈,实现高维PDE求解。不同于体积随维度缩小的超球体,单位或更大边长的超立方体其内部体积不减反增,使高维计算更为困难。Anant-Net能高效处理高维边界条件,并在高维配点上最小化PDE残差。为增强可解释性,模型引入柯尔莫哥洛夫-阿诺德网络结构。我们在泊松、正弦-戈登和阿拉恩-蔡恩等线性与非线性高维方程上进行测试,结果表明其在随机采样的高维空间测试点上具有高精度与强鲁棒性。重要的是,该模型仅用单张GPU即在数小时内完成300维问题求解,且性能优于现有先进方法。这些成果证明Anant-Net是准确、可解释且可扩展的高维PDE求解框架。
原文摘要 · Abstract (English)
High-dimensional partial differential equations (PDEs) arise in diverse scientific and engineering applications but remain computationally intractable due to the curse of dimensionality. Traditional numerical methods struggle with the exponential growth in computational complexity, particularly on hypercubic domains, where the number of required collocation points increases rapidly with dimensionality. Here, we introduce Anant-Net, an efficient neural surrogate that overcomes this challenge, enabling the solution of PDEs in high dimensions. Unlike hyperspheres, where the internal volume diminishes as dimensionality increases, hypercubes retain or expand their volume (for unit or larger length), making high-dimensional computations significantly more demanding. Anant-Net efficiently incorporates high-dimensional boundary conditions and minimizes the PDE residual at high-dimensional collocation points. To enhance interpretability, we integrate Kolmogorov-Arnold networks into the Anant-Net architecture. We benchmark Anant-Net's performance on several linear and nonlinear high-dimensional equations, including the Poisson, Sine-Gordon, and Allen-Cahn equations, demonstrating high accuracy and robustness across randomly sampled test points from high-dimensional space. Importantly, Anant-Net achieves these results with remarkable efficiency, solving 300-dimensional problems on a single GPU within a few hours. We also compare Anant-Net's results for accuracy and runtime with other state-of-the-art methods. Our findings establish Anant-Net as an accurate, interpretable, and scalable framework for efficiently solving high-dimensional PDEs.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。