用KAN网络统一求解多种不规则形状的流体逆问题,提升精度并降低计算成本。
Physics-informed KAN PointNet: Deep learning for simultaneous solutions to inverse problems in incompressible flow on numerous irregular geometries
- 将KAN嵌入PointNet架构,共享参数捕捉复杂几何特征
- 在135种不同圆柱形状的方腔对流中,预测精度优于传统MLP模型
- 适合需要快速泛化到新几何形貌的物理模拟场景
Kolmogorov-Arnold网络(KANs)作为传统多层感知机(MLPs)的替代,在稀疏数据下的计算物理逆问题求解中受到关注,如物理信息型KAN(PIKAN)。然而,现有方法无法在一次训练中同时求解多个不规则几何的逆问题。为此,本文提出物理信息型KAN点云网络(PI-KAN-PointNet),将共享的KAN集成至PointNet结构中,以捕获计算域的几何特征。损失函数包含通过自动微分计算的控制方程残差、稀疏观测值及部分已知边界条件。采用雅可比多项式构建共享KAN,并比较不同阶数与类型的性能,评估其计算开销与预测精度。以135种不同圆柱形状的方形腔自然对流为基准测试案例,结果表明:该方法克服了现有PIKAN仅支持单个域训练的局限,显著降低计算成本;在参数量相近、训练时间与内存使用相当的情况下,其对非光滑边界条件的预测精度明显优于基于MLPs的物理信息点云网络。
原文摘要 · Abstract (English)
Kolmogorov-Arnold Networks (KANs) have gained attention as an alternative to traditional multilayer perceptrons (MLPs) for deep learning applications in computational physics, particularly for solving inverse problems with sparse data, as exemplified by the physics-informed Kolmogorov-Arnold network (PIKAN). However, the capability of KANs to simultaneously solve inverse problems over multiple irregular geometries within a single training run remains unexplored. To address this gap, we introduce the physics-informed Kolmogorov-Arnold PointNet (PI-KAN-PointNet), in which shared KANs are integrated into the PointNet architecture to capture the geometric features of computational domains. The loss function comprises the squared residuals of the governing equations, computed via automatic differentiation, along with sparse observations and partially known boundary conditions. We construct shared KANs using Jacobi polynomials and investigate their performance by considering Jacobi polynomials of different degrees and types in terms of both computational cost and prediction accuracy. As a benchmark test case, we consider natural convection in a square enclosure with a cylinder, where the cylinder's shape varies across a dataset of 135 geometries. PI-KAN-PointNet offers two main advantages. First, it overcomes the limitation of current PIKANs, which are restricted to solving only a single computational domain per training run, thereby reducing computational costs. Second, when comparing the performance of PI-KAN-PointNet with that of the physics-informed PointNet using MLPs, we observe that, with approximately the same number of trainable parameters and comparable computational cost in terms of the number of epochs, training time per epoch, and memory usage, PI-KAN-PointNet yields more accurate predictions, particularly for values on unknown boundary conditions involving nonsmooth geometries.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。