arXiv:2607. 01449v1 Announce Type: new Abstract: We propose a novel hybrid neural architecture, the Geometry-aware R-Structured Kolmogorov-Arnold Network (GRS-KAN), which integrates V.
By Sergei Kucherenko, Nilay Shah
arXiv:2606. 19984v1 Announce Type: new Abstract: Reservoir computing offers a lightweight framework for forecasting dynamical systems but may struggle to capture long-range dependencies due to limited representational capacity.
By Juntian Huang, Jurgen Kurths, Ying Tang
arXiv:2604. 21174v3 Announce Type: replace-cross Abstract: Kolmogorov-Arnold Networks (KANs) replace fixed activations with learnable univariate edge functions whose behavior depends strongly on the chosen basis.
By Amir Noorizadegan, Sifan Wang, Leevan Ling
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
arXiv:2512. 09084v3 Announce Type: replace Abstract: The Kolmogorov-Arnold representation theorem offers a theoretical alternative to Multi-Layer Perceptrons (MLPs) by placing learnable univariate functions on edges rather than nodes.
By Oscar Eliasson
arXiv:2607. 18290v1 Announce Type: cross Abstract: In recent years, Kolmogorov-Arnold Networks (KANs) have attracted increasing attention due to their effectiveness in machine learning and scientific computing tasks, offering a new paradigm for neural network design.
By Hoang-Thang Ta