← Back to all news
arXiv AI By Amirhosein Azarpour

RecKAN: Kolmogorov-Arnold Networks with a Learnable Recursive Polynomial Basis

Read the original on arXiv AI →

RecKAN introduces a learnable recursive polynomial basis for Kolmogorov–Arnold Networks, replacing fixed bases like B-splines or Chebyshev polynomials. The basis is defined by a second‑order polynomial recurrence whose five coefficients are jointly learned with the network, enabling it to encompass classical families such as Chebyshev, Fibonacci, Pell, and Jacobsthal. Experiments across image, text, biomedical time‑series classification, and forecasting tasks show RecKAN outperforming parameter‑matched KAN baselines and achieving state‑of‑the‑art results on several benchmarks.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.

Related stories

arXiv AI
Oct 2

SW-KAN: Kolmogorov-Arnold Networks with Stieltjes-Wigert q-Orthogonal Polynomials

The paper introduces SW-KAN, a Kolmogorov‑Arnold Network that replaces traditional B‑spline activations with Stieltjes‑Wigert q‑orthogonal polynomials defined on the semi‑infinite domain (0, ∞). It addresses the domain mismatch between unbounded inputs and bounded polynomial bases by applying a smooth exponential‑of‑tanh mapping, and uses a numerically stable three‑term recurrence to evaluate polynomial expansions efficiently. Experiments on image classification and continuous function approximation show that SW‑KAN achieves better accuracy‑efficiency trade‑offs than existing polynomial KANs, especially in resource‑constrained scenarios with limited data or feature dimensionality.

By Amirhosein Azarpour, Seyyed Moein Kazemi
computer-visionbenchmarkssafety
More like this →
arXiv Machine Learning
Oct 16

SUPN: Shallow Universal Polynomial Networks for Efficient Function Approximation

The paper introduces Shallow Universal Polynomial Networks (SUPNs), a single‑hidden‑layer architecture that replaces standard activations with learnable multivariate polynomials, thereby increasing expressivity per unit. SUPNs achieve universal approximation by either widening the network or increasing polynomial complexity, and the authors prove convergence rates and quasi‑optimal parameter choices. Empirical tests across a wide range of smooth, nonsmooth, and discontinuous functions in up to ten dimensions show that SUPNs often outperform deep neural networks and Kolmogorov‑Arnold networks in accuracy and variability while requiring fewer parameters and lower training cost.

By Zachary Morrow, Michael Penwarden, Brian Chen, Aurya Javeed, Akil Narayan, John D. Jakeman
More like this →