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

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.

• benchmarks