mlsanityData to 7 Oct 2026

TruKAN: Towards More Efficient Kolmogorov-Arnold Networks Using Truncated Power Functions

arXiv 2602.03879 ↗First posted 2 Feb 2026cs.CV cs.AI cs.LGcited by 1

Not on the map. Why?

Abstract (arXiv)

To address the trade-off between computational efficiency and adherence to Kolmogorov-Arnold Network (KAN) principles, we propose TruKAN, a new architecture based on the KAN structure and learnable activation functions. TruKAN replaces the B-spline basis in KAN with a family of truncated power functions derived from k-order spline theory. This change maintains the KAN's expressiveness while enhancing accuracy and training time. Each TruKAN layer combines a truncated power term with a polynomial term and employs either shared or individual knots. TruKAN exhibits greater interpretability than other KAN variants due to its simplified basis functions and knot configurations. By prioritizing interpretable basis functions, TruKAN aims to balance approximation efficacy with transparency. We develop the TruKAN model and integrate it into an advanced EfficientNet-V2-based framework, which is then evaluated on computer vision benchmark datasets. To ensure a fair comparison, we develop various models: MLP-, KAN-, SineKAN and TruKAN-based EfficientNet frameworks and assess their training time and accuracy across small and deep architectures. The training phase uses hybrid optimization to improve convergence stability. Additionally, we investigate layer normalization techniques for all the models and assess the impact of shared versus individual knots in TruKAN. Overall, TruKAN outperforms other KAN models in terms of accuracy, computational efficiency and memory usage on the complex vision task, demonstrating advantages beyond the limited settings explored in prior KAN studies.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 24 of its 36 references that are in the map. First posted on arXiv 2 Feb 2026.

Builds on

24 of 36 references.

References · 24

  1. 2015Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shiftcited by 6,979
  2. 2016Layer Normalizationcited by 5,579
  3. 2017mixup: Beyond Empirical Risk Minimizationcited by 5,155
  4. 2016SGDR: Stochastic Gradient Descent with Warm Restartscited by 4,993
  5. 2017MobileNets: Efficient Convolutional Neural Networks for Mobile Vision Applicationscited by 3,827
  6. 2019CutMix: Regularization Strategy to Train Strong Classifiers with Localizable Featurescited by 2,875
  7. 2020LightGCN: Simplifying and Powering Graph Convolution Network for Recommendationcited by 1,134
  8. 2021EfficientNetV2: Smaller Models and Faster Trainingcited by 1,127
  9. 2024KAN: Kolmogorov-Arnold Networkscited by 634
  10. 2018Albumentations: fast and flexible image augmentationscited by 558
  11. 2019Lookahead Optimizer: k steps forward, 1 step backcited by 333
  12. 2024Wav-KAN: Wavelet Kolmogorov-Arnold Networkscited by 118
12 more
  1. 2024KAN 2.0: Kolmogorov-Arnold Networks Meet Sciencecited by 116
  2. 2018Three Mechanisms of Weight Decay Regularizationcited by 112
  3. 2024BSRBF-KAN: A combination of B-splines and Radial Basis Functions in Kolmogorov-Arnold Networkscited by 43
  4. 2024Demonstrating the Efficacy of Kolmogorov-Arnold Networks in Vision Taskscited by 39
  5. 2024CoxKAN: Kolmogorov-Arnold Networks for Interpretable, High-Performance Survival Analysiscited by 22
  6. 2024SineKAN: Kolmogorov-Arnold Networks Using Sinusoidal Activation Functionscited by 15
  7. 2024DropKAN: Regularizing KANs by masking post-activationscited by 14
  8. 2024PowerMLP: An Efficient Version of KANcited by 14
  9. 2025LeanKAN: A Parameter-Lean Kolmogorov-Arnold Network Layer with Improved Memory Efficiency and Convergence Behaviorcited by 12
  10. 2024On Training of Kolmogorov-Arnold Networkscited by 4
  11. 2025Improving Memory Efficiency for Training KANs via Meta Learningcited by 3
  12. 2025KASPER: Kolmogorov Arnold Networks for Stock Prediction and Explainable Regimescited by 1

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 1.

1 paper.