Kolmogorov-Arnold Networks for Free-Boundary Partial Differential Equations
Not on the map. Why?
Abstract (arXiv)
We study free-boundary problems within a physics-informed framework using Kolmogorov-Arnold network (KAN) approximations. The proposed approach incorporates obstacle constraints, partial differential equation (PDE) inequalities, complementarity conditions, and boundary conditions through residual-based loss functions. We consider a linear elliptic obstacle problem, a nonlinear p-Laplacian obstacle problem, and a time-dependent one-phase Stefan problem. The proposed KAN solver is compared with physics-informed neural network (PINN) and residual-network baselines. Numerical experiments show that KANs achieve low relative L2 and L^∞ errors while accurately resolving contact regions and moving interfaces. The results indicate that KAN representations provide an effective alternative for solving free-boundary PDEs.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 4 of its 23 references that are in the map. First posted on arXiv 1 Oct 2026.
Builds on
4 of 23 references.
References · 4
- 2015Automatic differentiation in machine learning: a surveycited by 855
- 2017DGM: A deep learning algorithm for solving partial differential equationscited by 678
- 2024KAN: Kolmogorov-Arnold Networkscited by 649
- 2020Deep learning of free boundary and Stefan problemscited by 35
Built on by
Not cited yet.