FEKAN: Feature-Enriched Kolmogorov-Arnold Networks
Sidharth S. Menon, Ameya D. Jagtap

TL;DR
FEKAN enhances Kolmogorov-Arnold Networks by adding features to improve efficiency and accuracy without increasing parameters, enabling faster convergence and better performance across various benchmarks.
Contribution
This paper introduces FEKAN, a feature-enriched extension of KAN that improves computational efficiency and predictive accuracy while maintaining interpretability.
Findings
FEKAN converges faster than baseline KAN variants.
FEKAN achieves higher approximation accuracy across benchmarks.
FEKAN reduces computational overhead in complex tasks.
Abstract
Kolmogorov-Arnold Networks (KANs) have recently emerged as a compelling alternative to multilayer perceptrons, offering enhanced interpretability via functional decomposition. However, existing KAN architectures, including spline-, wavelet-, radial-basis variants, etc., suffer from high computational cost and slow convergence, limiting scalability and practical applicability. Here, we introduce Feature-Enriched Kolmogorov-Arnold Networks (FEKAN), a simple yet effective extension that preserves all the advantages of KAN while improving computational efficiency and predictive accuracy through feature enrichment, without increasing the number of trainable parameters. By incorporating these additional features, FEKAN accelerates convergence, increases representation capacity, and substantially mitigates the computational overhead characteristic of state-of-the-art KAN architectures. We…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsModel Reduction and Neural Networks · Machine Learning in Materials Science · Neural Networks and Reservoir Computing
