Pith. sign in

REVIEW 3 cited by

SPIKANs: Separable Physics-Informed Kolmogorov-Arnold Networks

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2411.06286 v1 pith:RJUYPZDV submitted 2024-11-09 cs.LG cs.NAmath.NA

classification cs.LGcs.NAmath.NA
keywords physics-informedkanspdeskolmogorov-arnoldnetworksneuralpikansspikans
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Physics-Informed Neural Networks (PINNs) have emerged as a promising method for solving partial differential equations (PDEs) in scientific computing. While PINNs typically use multilayer perceptrons (MLPs) as their underlying architecture, recent advancements have explored alternative neural network structures. One such innovation is the Kolmogorov-Arnold Network (KAN), which has demonstrated benefits over traditional MLPs, including faster neural scaling and better interpretability. The application of KANs to physics-informed learning has led to the development of Physics-Informed KANs (PIKANs), enabling the use of KANs to solve PDEs. However, despite their advantages, KANs often suffer from slower training speeds, particularly in higher-dimensional problems where the number of collocation points grows exponentially with the dimensionality of the system. To address this challenge, we introduce Separable Physics-Informed Kolmogorov-Arnold Networks (SPIKANs). This novel architecture applies the principle of separation of variables to PIKANs, decomposing the problem such that each dimension is handled by an individual KAN. This approach drastically reduces the computational complexity of training without sacrificing accuracy, facilitating their application to higher-dimensional PDEs. Through a series of benchmark problems, we demonstrate the effectiveness of SPIKANs, showcasing their superior scalability and performance compared to PIKANs and highlighting their potential for solving complex, high-dimensional PDEs in scientific computing.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Fredholm Neural Networks for inverse problems in elliptic PDEs

    math.NA 2025-07 conditional novelty 5.0 of 10

    A boundary-integral based 'Fredholm neural network' converts fixed-point iterations into network layers and learns source terms for elliptic PDEs by backpropagating through the solver.

  2. Leveraging KANs for Expedient Training of Multichannel MLPs via Preconditioning and Geometric Refinement

    cs.LG 2025-05 conditional novelty 5.0 of 10

    Training in a B-spline KAN basis is equivalent to preconditioned gradient descent on a multichannel ReLU MLP, and geometric refinement plus trainable knots accelerate and improve training.

  3. Low Tensor-Rank Adaptation of Kolmogorov--Arnold Networks

    cs.LG 2025-02 conditional novelty 5.0 of 10

    A low tensor-rank adaptation (LoTRA) method and learning-rate guidance enable efficient fine-tuning of Kolmogorov-Arnold networks, validated on PDE solving and representation tasks.

Pith tools