Skip to main content
Search

# Kolmogorov-Arnold Network

3 related articles

Subscribe to updates
  1. arXiv

    KANs solve free-boundary PDEs: low relative L2 and L-infinity errors with accurate contact regions and moving interfaces on a linear elliptic obstacle problem, a p-Laplacian obstacle problem, and a one-phase Stefan problem

    The work embeds Kolmogorov-Arnold network (KAN) approximations in a physics-informed framework whose residual-based loss functions encode obstacle constraints, PDE inequalities, complementarity conditions, and boundary conditions, and on a linear elliptic obstacle problem, a nonlinear p-Laplacian obstacle problem, and a time-dependent one-phase Stefan problem it reports that KANs achieve low relative L2 and L-infinity errors and accurately resolve contact regions and moving interfaces compared with PINN and residual-network baselines.

  2. arXiv

    Higher-Order-KANDy recovers higher-order dynamics without a candidate library and selects the exact active set at 7.5% noise

    The authors propose Higher-Order-KANDy, which combines delay and derivative (jet) embeddings with derivative-ordered KANDy layers stacked into a machine learning architecture and learns a delay-to-jet map as a Kolmogorov-Arnold network, handling higher-order systems natively without a candidate library; on synthetic benchmarks it recovers equations under coarse sampling and noise, and at noise levels up to 7.5% it selects the exact active set on every seed, whereas an oracle weak-form regression admits a spurious term at that noise level, though the oracle remains the more accurate coefficient estimator.

  3. arXiv

    KANResDiff combines KAN spline time encoding with a local Schrödinger bridge for residual diffusion, cutting GED by up to 18.8% and raising HM-IoU32 by up to 7.7% on LIDC and ISIC3

    The work proposes KANResDiff, which learns local residual diffusion via Kolmogorov-Arnold Networks for ambiguous medical image segmentation: it replaces MLP linear time embeddings with B-spline-based Independent Time Encoding to strengthen independence across inference stages, and injects a deterministic residual prior with learnable weights through a Residual Schrödinger Bridge, achieving state-of-the-art GED and HM-IoU on the two public datasets LIDC and ISIC3 with maximum improvements of 16.8% and 7.7% respectively while keeping competitive MDM performance.

You’re all caught up