Geometry-Constrained Kolmogorov-Arnold Networks: Learning Edge Geometry via Banach Duality
This story is from 2026-08-27. It is preserved in the archive; the latest stories are on the live feed.
arXiv:2608.25807v1 Announce Type: cross Abstract: Kolmogorov-Arnold Networks (KANs) replace fixed activations in deep architectures with learnable univariate edge functions, making the choice of edge parametrisation central. Existing variants rely on fixed bases such as splines, polynomials, or Fou…
Read the full story at arXiv stat.ML ↗
Timeline · 1 report
- 2026-08-27 04:00 · arXiv stat.ML
Geometry-Constrained Kolmogorov-Arnold Networks: Learning Edge Geometry via Banach Duality