PG-KINN: A Physics-Informed Petrov-Galerkin Kolmogorov-Arnold Network for Solving Forward and Inverse PDEs
arXiv:2607.20378
2026
Training
2 ideas extracted · analyzed Aug 30, 2026
What the math gives to ML
The paper's strongest transferable contribution is not the KAN parameterization itself, but the decoupling of a neural trial space from a localized polynomial test space in a Petrov–Galerkin residual. This converts pointwise PDE differentiation into element-wise quadrature of weak residuals, reducing derivative order, improving conditioning, and supporting non-self-adjoint operators and inverse coefficient problems. A practical ML transfer is a weak-residual loss for PINNs or KANs in which compact test functions are fixed, independently chosen, and evaluated at Gauss points; the resulting local residual vector can also support adaptive sampling or preconditioned weighting.
Ideas from this paper
✗ Failed on benchmark
2026
Replace the pointwise strong-form PINN loss with a vector of localized weak residuals generated by fixed compactly supported polynomial test functions. Use a neural network or KAN as the trial function, integrate by parts once, and evaluate each test residual with Gauss–Legendre quadrature; this lowers the required derivative order and prevents a few high-curvature collocation points from dominating training.
Useful8/10
Difficulty5/10
Novelty5/10
Unverified
2026
Use the paper's correspondence between KAN splines and finite-element or isogeometric shape functions to build coordinate-separable tensor-product trial layers. Replace additive coordinate aggregation with a multiplicative contraction of one-dimensional spline expansions, yielding an explicit tensor-product basis without storing a dense multidimensional grid.
Useful6/10
Difficulty5/10
Novelty6/10